| Publication | Date of Publication | Type |
|---|
| A note on the message complexity of Cidon's distributed depth-first search algorithm | 2023-07-26 | Paper |
| Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? | 2022-12-08 | Paper |
| Creating Büchi Automata for Multi-valued Model Checking | 2022-06-15 | Paper |
| Compositional coordinator synthesis of extended finite automata | 2021-12-09 | Paper |
| Detecting useless transitions in pushdown automata | 2021-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4963898 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146596 | 2021-01-26 | Paper |
| A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity | 2021-01-21 | Paper |
| Structuring Multilevel Discrete-Event Systems With Dependence Structure Matrices | 2020-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111628 | 2020-05-27 | Paper |
| Congruence from the operator's point of view. Syntactic requirements on modal characterizations | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111193 | 2020-05-26 | Paper |
| Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence | 2019-09-17 | Paper |
| Reliable Restricted Process Theory | 2019-05-24 | Paper |
| Axiomatizations for the perpetual loop in process algebra | 2018-07-04 | Paper |
| Divide and Congruence II | 2018-04-23 | Paper |
| Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity | 2017-11-16 | Paper |
| Model checking mobile ad hoc networks | 2017-07-26 | Paper |
| Precongruence formats for decorated trace semantics | 2017-07-12 | Paper |
| A finite equational base for CCS with left merge and communication merge | 2017-07-12 | Paper |
| Detecting Useless Transitions in Pushdown Automata | 2017-06-01 | Paper |
| Maximally permissive controlled system synthesis for non-determinism and modal logic | 2017-03-03 | Paper |
| Unification for infinite sets of equations between finite terms | 2016-05-26 | Paper |
| Bonsai: Cutting Models Down to Size | 2015-12-03 | Paper |
| On the Axiomatizability of Impossible Futures | 2015-10-29 | Paper |
| Model Checking MANETs with Arbitrary Mobility | 2015-09-30 | Paper |
| Petri Nets Are a Biologist’s Best Friend | 2015-08-06 | Paper |
| Maximally Permissive Controlled System Synthesis for Modal Logic | 2015-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2865941 | 2013-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852097 | 2013-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2851076 | 2013-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2848414 | 2013-09-26 | Paper |
| Fast leader election in anonymous rings with bounded expected delay | 2013-04-04 | Paper |
| Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics | 2012-09-25 | Paper |
| Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols | 2012-09-21 | Paper |
| Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity | 2012-05-24 | Paper |
| Modal logic and the approximation induction principle | 2012-05-11 | Paper |
| Verification of mobile ad hoc networks: an algebraic approach | 2011-07-07 | Paper |
| Equational Reasoning on Mobile Ad Hoc Networks | 2011-03-28 | Paper |
| Ready to preorder: the case of weak process semantics | 2010-06-09 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Equational Reasoning on Ad Hoc Networks | 2010-01-28 | Paper |
| Process Algebra: An Algebraic Theory of Concurrency | 2009-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395989 | 2009-09-15 | Paper |
| An analytical model of information dissemination for a gossip-based protocol | 2009-08-26 | Paper |
| A note on an expressiveness hierarchy for multi-exit iteration | 2009-04-28 | Paper |
| Ready to Preorder: Get Your BCCSP Axiomatization for Free! | 2009-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601869 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601881 | 2009-02-12 | Paper |
| On Finite Bases for Weak Semantics: Failures Versus Impossible Futures | 2009-02-03 | Paper |
| Adapting the UPPAAL Model of a Distributed Lift System | 2008-07-01 | Paper |
| Design Issues for Qualitative Modelling of Biological Cells with Petri Nets | 2008-06-17 | Paper |
| On finite alphabets and infinite bases | 2008-05-19 | Paper |
| On the axiomatisability of priority | 2008-04-10 | Paper |
| Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge | 2007-10-11 | Paper |
| Modelling distributed systems. | 2007-10-08 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation | 2007-09-11 | Paper |
| On the Axiomatizability of Priority | 2007-09-11 | Paper |
| A Finite Equational Base for CCS with Left Merge and Communication Merge | 2007-09-11 | Paper |
| On Finite Alphabets and Infinite Bases III: Simulation | 2007-09-04 | Paper |
| Computing with actions and communications | 2007-08-10 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Model checking a cache coherence protocol of a Java DSM implementation | 2007-02-09 | Paper |
| Bisimilarity is not finitely based over BPA with interrupt | 2007-01-09 | Paper |
| Cones and foci: A mechanical framework for protocol verification | 2006-11-17 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Algebra and Coalgebra in Computer Science | 2006-10-20 | Paper |
| An effective axiomatization for real time ACP | 2006-10-10 | Paper |
| Compositionality of Hennessy-Milner logic by structural operational semantics | 2006-04-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Which two-sorted algebras of Booleans and naturals have a finite basis? | 2006-01-06 | Paper |
| Verification of a sliding window protocol in \(\mu\) CRL and PVS | 2005-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5705140 | 2005-11-08 | Paper |
| Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal | 2005-10-17 | Paper |
| Algebraic Methodology and Software Technology | 2005-08-25 | Paper |
| CCS with Hennessy's merge has no finite-equational axiomatization | 2005-02-22 | Paper |
| Nested semantics over finite trees are equationally hard | 2004-08-06 | Paper |
| Structural operational semantics and bounded nondeterminism | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449168 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417864 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484474 | 2003-06-12 | Paper |
| Algebra of timed frames | 2002-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551157 | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762495 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760242 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754192 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760240 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790410 | 2001-01-01 | Paper |
| Language preorder as a precongruence | 2000-08-21 | Paper |
| Rooted branching bisimulation as a congruence | 2000-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490742 | 2000-07-20 | Paper |
| A complete equational axiomatization for prefix iteration | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940887 | 2000-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941495 | 2000-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699301 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4235435 | 1999-03-22 | Paper |
| A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces | 1999-03-22 | Paper |
| On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based | 1999-01-12 | Paper |
| A conservative look at operational semantics with variable binding | 1999-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839065 | 1998-10-08 | Paper |
| Termination modulo equations by abstract commutation with an application to iteration | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375630 | 1998-05-10 | Paper |
| An equational axiomatization for multi-exit iteration | 1998-02-16 | Paper |
| Axiomatizing prefix iteration with silent steps | 1996-11-25 | Paper |
| \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules | 1996-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4880140 | 1996-06-02 | Paper |
| A Relation Between Partitions and the Number of Divisors | 1996-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763192 | 1995-11-28 | Paper |
