Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
Deciding bisimilarity of normed context-free processes is in &Sgr; p2
Theoretical Computer Science
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Handbook of Process Algebra
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 Equivalence is Decidable for all Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
| Hi-index | 0.00 |
Through the notion of expansive-bisimulation, in this paper we give a finite characterization of bisimulation equivalence for contextfree processes, i.e. we show that two context-free processes are bisimulation equivalent if and only if there is a finite expansive-bisimulation which contains them. This immediately suggests the set of finite expansivebisimulation as a complete class of verifiable evidence for bisimulation equality of context-free processes. Compared with the well known result that two context-free processes are bisimulation equivalent if and only if there is a finite self-bisimulation which relates them, the new result made improvement in the sense that whether a finite relation is an expansive-bisimulation is decidable while whether a finite relation is a self-bisimulation is only semi-decidable.