Completeness results for undecidable bisimilarity problems

MaRDI QIDQ2847411zbMATH OpenFDO

Authors Jiří Srba

Publication date 9 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104050522

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2163042
• scientific article; zbMATH DE number 1927587
• scientific article; zbMATH DE number 1759489
• High undecidability of weak bisimilarity for Petri nets
• Undecidability of bisimilarity for Petri nets and some related problems

Cited in

(13)

• Deciding bisimilarity is P-complete
• Refining the undecidability border of weak bisimilarity
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity
• Undecidability of bisimilarity by defender's forcing
• scientific article; zbMATH DE number 1948498 (Why is no real title available?)
• Complexity of weak bisimilarity and regularity for BPA and BPP
• scientific article; zbMATH DE number 1927587 (Why is no real title available?)
• scientific article; zbMATH DE number 1759489 (Why is no real title available?)
• scientific article; zbMATH DE number 2163042 (Why is no real title available?)
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP
• High undecidability of weak bisimilarity for Petri nets
• Bisimilarity of pushdown automata is nonelementary
• Foundations of Software Science and Computation Structures

This page was built for publication: Completeness results for undecidable bisimilarity problems

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