A structure to decide reachability in Petri nets
Theoretical Computer Science
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
Stubborn Sets for Standard Properties
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The saturation algorithm for symbolic state-space exploration
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Question-guided stubborn set methods for state properties
Formal Methods in System Design
Narrowing Petri Net State Spaces Using the State Equation
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Generating Petri net state spaces
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Finding a witness path for non-liveness in free-choice nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
| Hi-index | 0.00 |
We propose a reachability verification technique that combines the Petri net state equation (a linear algebraic overapproximation of the set of reachable states) with the concept of counterexample guided abstraction refinement. In essence, we replace the search through the set of reachable states by a search through the space of solutions of the state equation. We demonstrate the excellent performance of the technique on several real-world examples. The technique is particularly useful in those cases where the reachability query yields a negative result: While state space based techniques need to fully expand the state space in this case, our technique often terminates promptly. In addition, we can derive some diagnostic information in case of unreachability while state space methods can only provide witness paths in the case of reachability.