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
Decidability of Weak Bisimilarity for a Subset of BPA
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Checking equality and regularity for normed BPA with silent moves
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 5.23 |