Undecidability of accordance for open systems with unbounded message queues

DOI10.1016/j.ipl.2014.07.010zbMath1371.68196OpenAlexW2001076149MaRDI QIDQ402353

J. Herrera, H. S. Yoon

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.07.010

zbMATH Keywords

Petri netstheory of computationaccordance preorderopen nets

Mathematics Subject Classification ID

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

Related Items (1)

Trace- and failure-based semantics for responsiveness

Cites Work

• Modular construction and partial order semantics of Petri nets
• Trace- and failure-based semantics for responsiveness
• Undecidability of bisimilarity for Petri nets and some related problems
• Fair testing
• Relating fair testing and accordance for service replaceability
• Can I find a partner? Undecidability of partner existence for open nets
• A trace-based service semantics guaranteeing deadlock freedom
• Does My Service Have Partners?
• Deciding Substitutability of Services with Operating Guidelines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Undecidability of accordance for open systems with unbounded message queues