Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
Affine Parikh automata
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the , that extends the PA by having each transition induce an affine transformation on the PA registers, and the , that restricts the PA by forcing any two transitions on the same letter to affect the registers...
Affine Parikh automata
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the , that extends the PA by having each transition induce an affine transformation on the PA registers, and the , that restricts the PA by forcing any two transitions on...
Affine Parikh automata
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the , that extends the PA by having each transition induce an affine transformation on the PA registers, and the , that restricts the PA by forcing any two transitions on...
Page 1