Simulation preorder over simple process algebras
Information and Computation
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Undecidability of weak bisimulation equivalence for 1-counter processes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
RP'10 Proceedings of the 4th international conference on Reachability problems
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |