Linear invariants in commutative high level nets
APN 90 Proceedings on Advances in Petri nets 1990
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Proving nonreachability by modulo-invariants
Theoretical Computer Science - Special volume on Petri nets
Computational methods in commutative algebra and algebraic geometry
Computational methods in commutative algebra and algebraic geometry
| Hi-index | 0.00 |
The paper deals with the computation of flows in coloured nets and with the potential reachability of markings over the integers in p/t nets. We introduce Artin nets as a subclass of coloured nets, which can be handled by methods from Commutative Algebra. As a first result we develop an algorithm for the explicit computation of flows in Artin nets, which is supported by existing tools. Concerning reachability in p/t nets we prove a refined rank condition as a second result.