Foundations of Software Science and Computation Structures

DOI10.1007/11690634zbMATH Open1180.68193OpenAlexW2504714231MaRDI QIDQ5899094FDOQ5899094

Authors: Petr Jančar, Jiří Srba 

Publication date: 2 May 2007

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

Full work available at URL: https://doi.org/10.1007/11690634

Recommendations

• Undecidability of bisimilarity by defender's forcing
• Completeness results for undecidable bisimilarity problems
• scientific article; zbMATH DE number 1927587
• scientific article; zbMATH DE number 1222559
• Refining the undecidability border of weak bisimilarity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• Undecidability of bisimilarity by defender's forcing
• Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity

This page was built for publication: Foundations of Software Science and Computation Structures

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