Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DOI10.1007/978-3-540-85780-8_4zbMATH Open1161.68621OpenAlexW1753356046MaRDI QIDQ3532999FDOQ3532999
Authors: Petr Jančar 
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_4
Recommendations
- scientific article; zbMATH DE number 1361117
- Completeness results for undecidable bisimilarity problems
- Decidability of weak bisimilarity for a subset of BPA
- Refining the undecidability border of weak bisimilarity
- Undecidability of bisimilarity by defender's forcing
- Deciding bisimilarity is P-complete
- Undecidability of theories of Boolean algebras with selected ideals
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 1231553
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Three Partition Refinement Algorithms
- Verification on infinite structures.
- Decidability of DPDA equivalence
- CCS expressions, finite state processes, and three problems of equivalence
- \(L(A)=L(B)\)? decidability results from complete formal systems
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Bisimulation equivalence is decidable for all context-free processes
- Normed BPA vs. Normed BPP Revisited
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- Title not available (Why is that?)
- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
- Decidability of bisimulation equivalence for process generating context-free languages
- Equivalence and preorder checking for finite-state systems
- Equivalence-checking on infinite-state systems: Techniques and results
- On the regular structure of prefix rewriting
- Decidability of bisimulation equivalence for normed pushdown processes
- An elementary bisimulation decision procedure for arbitrary context-free processes
- Title not available (Why is that?)
- Undecidability of bisimilarity by defender's forcing
- Title not available (Why is that?)
- \(L(A)=L(B)\)? A simplified decidability proof.
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree
- Strong bisimilarity of simple process algebras: Complexity lower bounds
- Comparing expressibility of normed BPA and normed BPP processes
- Deciding bisimilarity between BPA and BPP processes.
Cited In (2)
This page was built for publication: Selected Ideas Used for Decidability and Undecidability of Bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532999)
