Undecidability of weak bisimilarity for PA-processes

DOI10.1007/3-540-45005-X_17MaRDI QIDQ4412112zbMATH OpenFDO

Authors Jiří Srba

Publication date 13 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2450/24500197.htm

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Undecidability of weak bisimilarity for pushdown processes
• scientific article; zbMATH DE number 2163042
• Decidability of weak bisimilarity for a subset of basic parallel processes
• Completeness results for undecidable bisimilarity problems
• Refining the undecidability border of weak bisimilarity

Cited in

(10)

• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Decidability of weak bisimilarity for a subset of basic parallel processes
• Modifications of expansion trees for weak bisimulation in BPA
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Refining the undecidability border of weak bisimilarity
• Undecidability of accordance for open systems with unbounded message queues
• scientific article; zbMATH DE number 1232243 (Why is no real title available?)
• Undecidability of weak bisimulation equivalence for 1-counter processes
• Undecidability of weak bisimilarity for pushdown processes
• scientific article; zbMATH DE number 2163042 (Why is no real title available?)

This page was built for publication: Undecidability of weak bisimilarity for PA-processes

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