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
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
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
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |