A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Information and Computation
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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
On the Unification of Process Semantics: Observational Semantics
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Information Processing Letters
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Liveness, fairness and impossible futures
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Operational determinism and fast algorithms
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.90 |