Petri nets play a central role in the analysis of discrete, parallel and distributed systems. Reachability problem is one of the analysis of Petri nets. This paper address the analysis of reachable marking of petri nets using invariants. We translate Petri nets as transition systems. Then, through computing vanishing ideal of sample points, we present a new approach for constructing polynomial equation invariants of Petri nets. Our approach avoids first-order quantifier elimination and cylindrical algebraic decomposition. From the preliminary experiment results, we demonstrate the feasibility of our approach.
Generating Inductive Invariants for Petri Nets
Adv.Intel.,Soft Computing
2012-01-01
8 pages
Article/Chapter (Book)
Electronic Resource
English
Reversibility Analysis for Petri Nets by Using T-invariants
British Library Conference Proceedings | 2008
|Partition by Place Invariants and Discrimination of Its Properties in Petri Nets
British Library Online Contents | 1996
|Generating Real-time Software Test Cases by Time Petri Nets
British Library Online Contents | 2000
|A New Scheme for Verifying Rule-Based Systems by Using Net-Invariants of Petri Nets
British Library Online Contents | 2000
|British Library Online Contents | 1997
|