Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Decidability of DPDA equivalence
Theoretical Computer Science
Communication and Concurrency
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Normed BPA vs. Normed BPP Revisited
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
The paper tries to highlight some crucial ideas appearing in the decidability and undecidability proofs for the bisimilarity problem on models originating in language theory, like context-free grammars and pushdown automata. In particular, it focuses on the method of finite bases of bisimulations in the case of decidability and the method of "Defender's forcing" in the case of undecidability. An intent was to write an easy-to-read article in a slightly informal way, which should nevertheless convey the basic ideas with sufficient precision.