Refining the undecidability border of weak bisimilarity

MaRDI QIDQ2852014zbMATH OpenFDO

Authors Vojtěch Řehák, Jan Strejček, Mojmír Křetínský

Publication date 7 October 2013

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1927587
• scientific article; zbMATH DE number 1948498
• scientific article; zbMATH DE number 1701362
• Completeness results for undecidable bisimilarity problems
• Undecidable equivalences for basic process algebra

Cited in

(13)

• scientific article; zbMATH DE number 1948498 (Why is no real title available?)
• scientific article; zbMATH DE number 1927587 (Why is no real title available?)
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP
• scientific article; zbMATH DE number 1361133 (Why is no real title available?)
• An algebra of behavioural types
• Complexity of weak bisimilarity and regularity for BPA and BPP
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity
• scientific article; zbMATH DE number 2163042 (Why is no real title available?)
• Decidability of behavioral equivalences in process calculi with name scoping
• Modifications of expansion trees for weak bisimulation in BPA
• Branching bisimilarity checking for PRS
• Foundations of Software Science and Computation Structures
• Approximating weak bisimilarity of basic parallel processes

This page was built for publication: Refining the undecidability border of weak bisimilarity

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