Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Basic process algebra with deadlocking states
Theoretical Computer Science
Simulation preorder over simple process algebras
Information and Computation
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th 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
Local Model Checking Games for Fixed Point Logic with Chop
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On Simulation-Checking with Sequential Systems
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Bisimulation and language equivalence
Logic for concurrency and synchronisation
Nested semantics over finite trees are equationally hard
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Undecidable equivalences for basic parallel processes
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
A modal fixpoint logic with chop
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects 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
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |