| Publication | Date of Publication | Type |
|---|
| Correct and efficient antichain algorithms for refinement checking | 2024-02-06 | Paper |
| Compositional learning for interleaving parallel automata | 2023-11-24 | Paper |
| Lowerbounds for Bisimulation by Partition Refinement | 2023-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6176115 | 2023-08-21 | Paper |
| Minimisation of spatial models using branching bisimilarity | 2023-08-17 | Paper |
| Problem Solving Using Process Algebra Considered Insightful | 2022-11-09 | Paper |
| A Complete Axiomatisation for Probabilistic Trace Equivalence | 2022-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089272 | 2022-07-18 | Paper |
| Term rewriting on GPUs | 2022-06-17 | Paper |
| A set automaton to locate all pattern matches in a term | 2022-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3385650 | 2021-12-20 | Paper |
| An O(m log n) algorithm for branching bisimilarity on labelled transition systems | 2021-11-10 | Paper |
| Logic Gates, Circuits, Processors, Compilers and Computers | 2021-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856411 | 2021-03-26 | Paper |
| Wait-free concurrent memory management by Create and Read until Deletion (CaRuD) | 2020-12-03 | Paper |
| An algorithm for the asynchronous Write-All problem based on process collision | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5129943 | 2020-11-03 | Paper |
| An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation | 2019-09-17 | Paper |
| An efficient algorithm to determine probabilistic bisimulation | 2019-05-08 | Paper |
| The mean drift: tailoring the mean field theory of Markov processes for real-world applications | 2018-10-23 | Paper |
| An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation | 2017-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2818569 | 2016-09-07 | Paper |
| A Probabilistic Analysis of the Game of the Goose | 2016-05-20 | Paper |
| From μCRL to mCRL2 | 2015-07-10 | Paper |
| Discretization of Timed Automata in Timed μCRL à la Regions and Zones | 2015-07-10 | Paper |
| Switching Graphs | 2015-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191614 | 2014-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2851074 | 2013-10-02 | Paper |
| An Overview of the mCRL2 Toolset and Its Recent Advances | 2013-08-05 | Paper |
| Lock-free dynamic hash tables with open addressing | 2013-06-07 | Paper |
| Transforming equality logic to propositional logic | 2013-04-19 | Paper |
| Specification Guidelines to Avoid the State Space Explosion Problem | 2012-06-29 | Paper |
| A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus | 2011-07-07 | Paper |
| Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study | 2011-01-08 | Paper |
| SWITCHING GRAPHS | 2009-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395989 | 2009-09-15 | Paper |
| A syntactic commutativity format for SOS | 2009-08-27 | Paper |
| Search algorithms for automated validation | 2009-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3614665 | 2009-03-09 | Paper |
| Hiding propositional constants in BDDs. | 2008-12-21 | Paper |
| Statistical Certification of Software Systems | 2008-03-18 | Paper |
| Task allocation in a multi-server system | 2007-12-20 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5754517 | 2007-08-22 | Paper |
| Operational semantics for Petri net components | 2007-07-16 | Paper |
| SOS formats and meta-theory: 20 years after | 2007-04-19 | Paper |
| Lock-free parallel and concurrent garbage collection by mark\&sweep | 2007-01-11 | Paper |
| Theoretical Aspects of Computing – ICTAC 2005 | 2006-11-01 | Paper |
| A computer checked algebraic verification of a distributed summation algorithm | 2005-12-13 | Paper |
| Verification of a sliding window protocol in \(\mu\) CRL and PVS | 2005-12-13 | Paper |
| Parameterised Boolean equation systems | 2005-11-01 | Paper |
| Algebraic Methodology and Software Technology | 2005-08-25 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| Formal Methods for Components and Objects | 2005-08-22 | Paper |
| Model-checking processes with data | 2005-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043797 | 2004-08-06 | Paper |
| Binary decision diagrams for first-order predicate logic. | 2004-03-14 | Paper |
| Resolution and binary decision diagrams cannot simulate each other polynomially | 2003-09-15 | Paper |
| Analysis of a distributed system for lifting trucks. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417960 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148335 | 2003-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536374 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551157 | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767014 | 2002-07-22 | Paper |
| Linearization in parallel pCRL | 2002-07-22 | Paper |
| Focus points and convergent process operators: A proof strategy for protocol verification | 2002-05-21 | Paper |
| The parallel composition of uniform processes with data | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749861 | 2001-11-21 | Paper |
| Analysis of three hybrid systems in timed \(\mu CRL\) | 2001-07-05 | Paper |
| The propositional formula checker HeerHugo | 2001-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760254 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4255544 | 1999-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250361 | 1999-06-17 | Paper |
| A complete equational axiomatization for MPA with string iteration | 1999-01-12 | Paper |
| Formal verification of a leader election protocol in process algebra | 1998-07-23 | Paper |
| The meaning of negative premises in transition system specifications | 1998-01-22 | Paper |
| Formalizing process algebraic verifications in the calculus of constructions | 1997-08-17 | Paper |
| Confluence for process verification | 1997-02-27 | Paper |
| Undecidable equivalences for basic process algebra | 1995-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4312484 | 1994-11-29 | Paper |
| Process algebra with guards: Combining hoare logic with process algebra | 1994-06-29 | Paper |
| Transition system specifications with negative premises | 1994-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036587 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038723 | 1993-05-18 | Paper |
| A short proof of the decidability of bisimulation for normed BPA- processes | 1993-01-16 | Paper |
| Structured operational semantics and bisimulation as a congruence | 1993-01-16 | Paper |
