Proving nonreachability by modulo-invariants
From MaRDI portal
Publication:672866
DOI10.1016/0304-3975(95)00117-4zbMath0872.68131OpenAlexW2025727968MaRDI QIDQ672866
K.-P. Neuendorf, Jörg Desel, M.-D. Radola
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00117-4
Related Items (3)
Petri net based verification of distributed algorithms: An example ⋮ Algebraic nets with flexible arcs ⋮ Structural Place Invariants for Analyzing the Behavioral Properties of Nested Petri Nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability in cyclic extended free-choice systems
- System modelling with high-level Petri nets
- An Algorithm for the General Petri Net Reachability Problem
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes
This page was built for publication: Proving nonreachability by modulo-invariants