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
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
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th 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 computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
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
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Information Processing Letters
On the computational complexity of bisimulation, redux
Information and Computation
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
The Ground Tree Transducer Game
Fundamenta Informaticae
Hi-index | 0.00 |