Undecidability of performance equivalence of Petri nets
From MaRDI portal
Publication:507373
DOI10.1016/j.tcs.2016.01.034zbMath1356.68155arXiv0910.5819MaRDI QIDQ507373
Sławomir Lasota, Marcin Poturalski
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.5819
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Undecidability of bisimilarity for Petri nets and some related problems
- A theory of processes with durational actions
- Performance preorder and competitive equivalence
- On performance congruences for process algebras
- Decidability of performance equivalence for basic parallel processes
- The Reachability Problem for Vector Addition System with One Zero-Test
- Nets with Tokens Which Carry Data
- Reachability in Petri Nets with Inhibitor Arcs
- Mathematical Foundations of Computer Science 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item