An efficient algorithm for branching bisimulation and stuttering equivalence
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Process algebra
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
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Information and Computation - Special issue on EXPRESS 1997
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
| Hi-index | 0.00 |
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Ku***era and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows an early work of Ku***era and Mayr, where similar results for weak bisimilarity are established.