Undecidability of accordance for open systems with unbounded message queues
From MaRDI portal
Publication:402353
DOI10.1016/J.IPL.2014.07.010zbMATH Open1371.68196OpenAlexW2001076149MaRDI QIDQ402353FDOQ402353
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fair testing
- A trace-based service semantics guaranteeing deadlock freedom
- Does My Service Have Partners?
- Deciding Substitutability of Services with Operating Guidelines
- 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
- Relating fair testing and accordance for service replaceability
- Can I find a partner? Undecidability of partner existence for open nets
Cited In (2)
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)
