Distributed implementation of a process-algebra based programming language for embedded systems
Nordic Journal of Computing
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
From Bialgebraic Semantics to Congruence Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Bisimulation and Open Maps for Timed Transition Systems
Fundamenta Informaticae
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.01 |