| Publication | Date of Publication | Type |
|---|
| Modal Open Petri Nets | 2024-01-29 | Paper |
| Interface automata for shared memory | 2023-08-02 | Paper |
| Interface automata for shared memory | 2022-09-26 | Paper |
| Stubborn Sets, Frozen Actions, and Fair Testing | 2021-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4965857 | 2021-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964718 | 2021-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146599 | 2021-01-26 | Paper |
| A linear-time branching-time perspective on interface automata | 2020-05-26 | Paper |
| Asynchronous communication of Petri Nets and the refinement of transitions | 2019-12-04 | Paper |
| Timed testing of concurrent systems | 2019-03-29 | Paper |
| Fault-Free Refinements for Interface Automata | 2019-02-08 | Paper |
| The limit of splitn-language equivalence | 2019-01-10 | Paper |
| Efficiency of asynchronous systems and read arcs in petri nets | 2018-07-04 | Paper |
| ACTL for modal interface automata | 2017-09-12 | Paper |
| Nondeterministic modal interfaces | 2016-07-20 | Paper |
| Fair Testing and Stubborn Sets | 2016-06-22 | Paper |
| Error-pruning in interface automata | 2015-08-17 | Paper |
| Richer interface automata with optimistic and pessimistic compatibility | 2015-06-24 | Paper |
| Nondeterministic Modal Interfaces | 2015-02-20 | Paper |
| Error-Pruning in Interface Automata | 2015-01-13 | Paper |
| Recent advances in unfolding technique | 2014-08-29 | Paper |
| Modular construction and partial order semantics of Petri nets | 2014-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2848134 | 2013-09-25 | Paper |
| Modal Interface Automata | 2013-09-06 | Paper |
| Modal Interface Automata | 2012-09-21 | Paper |
| A trace-based service semantics guaranteeing deadlock freedom | 2012-04-26 | Paper |
| Safe reasoning with logic LTS | 2011-07-07 | Paper |
| A Trace-Based View on Operating Guidelines | 2011-05-19 | Paper |
| Ready simulation for concurrency: it's logical! | 2010-08-18 | Paper |
| Another short proof of optimality for the MIN cache replacement algorithm | 2010-04-19 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Avoiding Irreducible CSC Conflicts by Internal Communication | 2010-02-05 | Paper |
| STG decomposition strategies in combination with unfolding | 2009-10-23 | Paper |
| Liveness of a mutex algorithm in a fair process algebra | 2009-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602753 | 2009-02-12 | Paper |
| Time and Fairness in a Process Algebra with Non-blocking Reading | 2009-02-03 | Paper |
| Safe Reasoning with Logic LTS | 2009-02-03 | Paper |
| Stronger Reduction Criteria for Local First Search | 2008-09-11 | Paper |
| Component refinement and CSC-solving for STG decomposition | 2007-12-18 | Paper |
| Ready Simulation for Concurrency: It’s Logical! | 2007-11-28 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Checking a Mutex Algorithm in a Process Algebra with Fairness | 2007-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5295516 | 2007-07-30 | 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 |
| Fair testing | 2007-02-20 | Paper |
| Performance of pipelined asynchronous systems | 2007-02-09 | Paper |
| Merged processes: a new condensed representation of Petri net behaviour | 2006-12-06 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| Formal Methods for the Design of Real-Time Systems | 2006-10-19 | Paper |
| Bisimulation on speed: a unified approach | 2006-09-14 | Paper |
| Fairness of actions in system computations | 2006-09-12 | Paper |
| Fairness of components in system computations | 2006-05-29 | Paper |
| Applications and Theory of Petri Nets 2005 | 2005-12-14 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| Foundations of Software Science and Computational Structures | 2005-11-10 | Paper |
| Bisimulation on speed: Lower time bounds | 2005-09-01 | Paper |
| Measuring the performance of asynchronous systems with PAFAS | 2005-06-10 | Paper |
| Canonical prefixes of Petri net unfoldings | 2004-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818825 | 2004-09-24 | Paper |
| Bisimulation on speed: Worst-case efficiency | 2004-08-06 | Paper |
| Comparing the worst-case efficiency of asynchronous systems with PAFAS | 2003-09-01 | Paper |
| Faster asynchronous systems. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417602 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415268 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804927 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791840 | 2003-02-03 | Paper |
| Partial order semantics and read arcs | 2002-08-13 | Paper |
| Efficiency of asynchronous systems, read arcs, and the MUTEX-problem | 2002-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766578 | 2002-06-17 | Paper |
| An improvement of McMillan's unfolding algorithm | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535187 | 2002-06-13 | Paper |
| Fast asynchronous systems in dense time | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2703738 | 2001-05-08 | Paper |
| Generalized OM-bisimulation | 2000-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699325 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251922 | 1999-06-17 | Paper |
| Fairness and partial order semantics | 1997-02-28 | Paper |
| The limit of split\(_ n\)-language equivalence | 1996-11-25 | Paper |
| Timed testing of concurrent systems | 1995-10-10 | Paper |
| On hyperedge replacement and BNLC graph grammars | 1993-12-10 | Paper |
| Bisimulation and action refinement | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694744 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035680 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036588 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037335 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4032308 | 1993-04-01 | Paper |
| Executions: A new partial-order semantics of Petri nets | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976036 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4711083 | 1992-06-25 | Paper |
| Failures semantics based on interval semiwords is a congruence for refinement | 1991-01-01 | Paper |
| A generalization of traces | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355248 | 1990-01-01 | Paper |
| Step failures semantics and a complete proof system | 1989-01-01 | Paper |
| Failures semantics and deadlocking of modular Petri nets | 1989-01-01 | Paper |
| Metatheorems for decision problems on hyperedge replacement graph languages | 1989-01-01 | Paper |
| On the synchronization of traces | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795239 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798213 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804188 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753474 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785958 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809730 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815541 | 1987-01-01 | Paper |
| Representing abstract groups by powers of a graph | 1986-01-01 | Paper |
| Representing groups by graphs with constant link and hypergraphs | 1986-01-01 | Paper |
| Some remarks on universal graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676162 | 1985-01-01 | Paper |
| The square of a connected S(K1,3)-free graph is vertex pancyclic | 1985-01-01 | Paper |
| Graphs with given group and given constant link | 1984-01-01 | Paper |
