Refining the undecidability border of weak bisimilarity

zbMATH Open1273.68261MaRDI QIDQ2852014FDOQ2852014

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

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

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)

Cited In (13)

• Complexity of Weak Bisimilarity and Regularity for BPA and BPP
• Title not available (Why is that?)
• Complexity of weak bisimilarity and regularity for BPA and BPP
• An algebra of behavioural types
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)