Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Basic process algebra with deadlocking states
Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
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
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Decidability of Weak Bisimilarity for a Subset of BPA
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding Bisimilarity of Full BPA Processes Locally
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Expansive-bisimulation for context-free processes
Formal methods and hybrid real-time systems
Information and Computation
Hi-index | 0.89 |