Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
An Introduction to Decidability of DPDA Equivalence
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical 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
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
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
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
| Hi-index | 5.23 |