Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Communication and concurrency
Bisimulation Equivalence is Decidable for all Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
The maximal strong and weak bisimulations on any class of processes can be obtained cis the limits of decreeising chains of binary relations, approximants. In the case of strong bisimulation and Bcisic Process Algebrais this chain has length at most ω which enables semidecidability of strong bisimilarity. We show that it is not so for weak bisimulation where the chain can grow much longer, and discuss the implications this has for (semi)decidability of weak bisimilarity.