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
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
| Hi-index | 5.23 |