A Complete Axiomatisation for Timed Automata
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Bisimulation on speed: worst-case efficiency
Information and Computation
A bulk-synchronous parallel process algebra
Computer Languages, Systems and Structures
A Relation-Algebraic Theory of Bisimulations
Fundamenta Informaticae
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Impossibility results for the equational theory of timed CCS
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
Unifying behavioral equivalences of timed transition systems
Programming and Computing Software
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Relation-Algebraic Theory of Bisimulations
Fundamenta Informaticae
An Axiomatization for Regular Processes in Timed Branching Bisimulation
Fundamenta Informaticae
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 5.23 |