Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Register-machine based processes
Journal of the ACM (JACM)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
A ground-complete axiomatization of finite state processes in process algebra
CONCUR 2005 - Concurrency Theory
Information and Computation
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
Process Algebra: An Algebraic Theory of Concurrency
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Information and Computation
Symbolic equivalences for open systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
An Algebra of Behavioural Types
Information and Computation
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |