| Publication | Date of Publication | Type |
|---|
| A case in point: verification and testing of a EULYNX interface | 2024-09-25 | Paper |
| On the axiomatisation of branching bisimulation congruence over CCS | 2024-08-13 | Paper |
| Pushdown automata and context-free grammars in bisimulation semantics | 2023-12-08 | Paper |
| Pushdown Automata and Context-Free Grammars in Bisimulation Semantics | 2023-03-22 | Paper |
| Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity | 2023-02-03 | Paper |
| Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089283 | 2022-07-18 | Paper |
| Off-the-shelf automated analysis of liveness properties for just paths (extended abstract) | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028469 | 2022-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020941 | 2022-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020944 | 2022-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5014795 | 2021-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015359 | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155681 | 2021-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856418 | 2021-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4963995 | 2021-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5119395 | 2020-09-04 | Paper |
| On the axiomatisability of priority. III: Priority strikes again | 2020-08-25 | Paper |
| Up-to Techniques for Branching Bisimilarity | 2020-07-20 | Paper |
| Divide and congruence III: Stability & divergence | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111639 | 2020-05-27 | Paper |
| Off-the-shelf automated analysis of liveness properties for just paths | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5216151 | 2020-02-14 | Paper |
| Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence | 2019-09-17 | Paper |
| On series-parallel pomset languages: rationality, context-freeness and automata | 2019-03-27 | Paper |
| Evidence for Fixpoint Logic | 2017-08-31 | Paper |
| A finite equational base for CCS with left merge and communication merge | 2017-07-12 | Paper |
| Expressiveness modulo bisimilarity of regular expressions with parallel composition | 2017-04-04 | Paper |
| On the Executability of Interactive Computation | 2016-08-17 | Paper |
| Unique parallel decomposition in branching and weak bisimulation semantics | 2015-12-15 | Paper |
| Reflections on a Geometry of Processes | 2015-07-10 | Paper |
| Reactive Turing machines | 2014-01-16 | Paper |
| Proof Graphs for Parameterised Boolean Equation Systems | 2013-08-12 | Paper |
| Turing Meets Milner | 2012-09-25 | Paper |
| Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics | 2012-09-21 | Paper |
| Reactive Turing Machines | 2011-08-19 | Paper |
| On the axiomatizability of priority. II | 2011-07-07 | Paper |
| Unguardedness mostly means many solutions | 2011-07-07 | Paper |
| The equational theory of prebisimilarity over basic CCS with divergence | 2010-06-09 | Paper |
| A Process-Theoretic Look at Automata | 2010-01-28 | Paper |
| Computation Tree Logic with Deadlock Detection | 2010-01-28 | Paper |
| Branching Bisimilarity with Explicit Divergence | 2009-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396576 | 2009-09-19 | Paper |
| On finite alphabets and infinite bases | 2008-05-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge | 2007-10-11 | Paper |
| A Finite Equational Base for CCS with Left Merge and Communication Merge | 2007-09-11 | Paper |
| Some Remarks on Definability of Process Graphs | 2007-09-04 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Model Checking Software | 2006-11-01 | Paper |
| Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal | 2005-10-17 | Paper |
| Decomposition orders -- another generalisation of the fundamental theorem of arithmetic | 2005-06-10 | Paper |
| CCS with Hennessy's merge has no finite-equational axiomatization | 2005-02-22 | Paper |
| Remarks on Thatte's transformation of term rewriting systems | 2005-02-22 | Paper |
| On the expressiveness of choice quantification | 2003-05-22 | Paper |
