Three partition refinement algorithms
SIAM Journal on Computing
Communication and concurrency
Process algebra
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
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
Information and Computation - Special issue on EXPRESS 1997
Effective decomposability of sequential behaviours
Theoretical Computer Science
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Weak Bisimulation and Model Checking for Basic Parallel Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Simulation preorder over simple process algebras
Information and Computation
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
Theoretical Computer Science - Expressiveness in concurrency
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Normed BPA vs. Normed BPP Revisited
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Information and Computation
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
| Hi-index | 5.23 |
We prove that weak bisimilarity is decidable in polynomial time between finite-state systems and several classes of infinite-state systems: context-free processes and normed basic parallel processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity problems involving infinite-state systems.