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
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Petri nets with simple circuits
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
More on weak bisimilarity of normed basic parallel processes
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Model checking EGF on basic parallel processes
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Hi-index | 0.00 |