Nonprimitive recursive complexity and undecidability for Petri net equivalences
From MaRDI portal
Publication:5941099
DOI10.1016/S0304-3975(00)00100-6zbMath0974.68130MaRDI QIDQ5941099
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Verifying lossy channel systems has nonprimitive recursive complexity., Petri nets and regular processes, Context-free commutative grammars with integer counters and resets, Complexity Hierarchies beyond Elementary
Cites Work
- Modular construction and partial order semantics of Petri nets
- Undecidability of bisimilarity for Petri nets and some related problems
- The equality problem for vector addition systems is undecidable
- The covering and boundedness problems for vector addition systems
- Decidability of bisimilarity for one-counter processes.
- The Complexity of the Finite Containment Problem for Petri Nets
- Infinite results
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item