Undecidability of accordance for open systems with unbounded message queues

DOI10.1016/J.IPL.2014.07.010MaRDI QIDQ402353zbMATH OpenOpenAlexFDO

Authors Richard Müller, Christian Stahl, Walter Vogler

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)

Recommendations

• Undecidability results for deterministic communicating sequential processes
• Undecidability results for distributed probabilistic systems
• scientific article; zbMATH DE number 1927587
• Undecidable verification problems for programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Decidability of model checking for infinite-state concurrent systems
• scientific article; zbMATH DE number 1948471
• scientific article; zbMATH DE number 1948498
• Undecidable equivalences for basic process algebra
• Undecidable equivalences for basic parallel processes

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A trace-based service semantics guaranteeing deadlock freedom
• Can I find a partner? Undecidability of partner existence for open nets
• Deciding Substitutability of Services with Operating Guidelines
• Does My Service Have Partners?
• Fair testing
• Modular construction and partial order semantics of Petri nets
• Relating fair testing and accordance for service replaceability
• Trace- and failure-based semantics for responsiveness
• Undecidability of bisimilarity for Petri nets and some related problems

Cited in

(2)

• Trace- and failure-based semantics for responsiveness
• Can I find a partner? Undecidability of partner existence for open nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402353)