Undecidability of performance equivalence of Petri nets

DOI10.1016/J.TCS.2016.01.034zbMath1356.68155arXiv0910.5819OpenAlexW2963269395MaRDI 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

zbMATH Keywords

Petri netsbisimulation equivalenceperformance equivalence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

This page was built for publication: Undecidability of performance equivalence of Petri nets