| Publication | Date of Publication | Type |
|---|
| Interface automata for shared memory | 2023-08-02 | Paper |
| An algebraic theory of multiple clocks | 2023-05-17 | Paper |
| Interface automata for shared memory | 2022-09-26 | Paper |
| A linear-time branching-time perspective on interface automata | 2020-05-26 | Paper |
| A generalised theory of interface automata, component compatibility and error | 2019-05-21 | Paper |
| The intuitionism behind Statecharts steps | 2017-06-13 | Paper |
| Nondeterministic modal interfaces | 2016-07-20 | Paper |
| A Generalised Theory of Interface Automata, Component Compatibility and Error | 2016-06-17 | Paper |
| Richer interface automata with optimistic and pessimistic compatibility | 2015-06-24 | Paper |
| Nondeterministic Modal Interfaces | 2015-02-20 | Paper |
| Measuring and evaluating parallel state-space exploration algorithms | 2013-12-13 | Paper |
| Modal interface automata | 2013-09-06 | Paper |
| A logical process calculus | 2013-08-15 | Paper |
| Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory | 2013-08-05 | Paper |
| Modal Interface Automata | 2012-09-21 | Paper |
| Safe reasoning with logic LTS | 2011-07-07 | Paper |
| To Parallelize or to Optimize? | 2011-02-02 | Paper |
| What Is in a Step: New Perspectives on a Classical Question | 2010-09-07 | Paper |
| Ready simulation for concurrency: it's logical! | 2010-08-18 | Paper |
| Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? | 2010-06-25 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| On the Expressiveness of Refinement Settings | 2010-01-28 | Paper |
| Improving Static Variable Orders Via Invariants | 2009-03-11 | Paper |
| Safe Reasoning with Logic LTS | 2009-02-03 | Paper |
| Is Observational Congruence Axiomatisable in Equational Horn Logic? | 2008-09-18 | Paper |
| Ready Simulation for Concurrency: It’s Logical! | 2007-11-28 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams | 2007-09-03 | Paper |
| Exploiting interleaving semantics in symbolic state-space generation | 2007-08-17 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Conjunction on processes: Full abstraction via ready-tree semantics | 2007-04-13 | Paper |
| Bisimulation on speed: a unified approach | 2006-09-14 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| Bisimulation on speed: Lower time bounds | 2005-09-01 | Paper |
| Bisimulation on speed: Worst-case efficiency | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472454 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484500 | 2003-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791840 | 2003-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766555 | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769596 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754141 | 2001-11-11 | Paper |
| Priority in process algebra. | 2001-01-01 | Paper |
| Compositional minimisation of finite state systems using interface specifications | 1996-12-01 | Paper |
