| Publication | Date of Publication | Type |
|---|
| An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling | 1997-06-09 | Paper |
| Bounded self-stabilizing Petri nets | 1995-06-21 | Paper |
| Completeness results for single-path Petri nets | 1994-05-06 | Paper |
| Feasibility problems for recurring tasks on one processor | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035241 | 1993-05-18 | Paper |
| Normal and sinkless Petri nets | 1993-05-16 | Paper |
| Pinwheel scheduling with two distinct numbers | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974867 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975147 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975150 | 1992-06-26 | Paper |
| Global and local views of state fairness | 1991-01-01 | Paper |
| A taxonomy of fairness and temporal logic problems for Petri nets | 1991-01-01 | Paper |
| The instability of self-stabilization | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361873 | 1990-01-01 | Paper |
| Problems concerning fairness and temporal logic for conflict-free Petri nets | 1989-01-01 | Paper |
| On the complexity of deciding fair termination of probabilistic concurrent finite-state programs | 1988-01-01 | Paper |
| Completeness results for conflict-free vector replacement systems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802633 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823147 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730790 | 1988-01-01 | Paper |
| An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines | 1987-01-01 | Paper |
| An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3766869 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774963 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776647 | 1987-01-01 | Paper |
| Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780411 | 1987-01-01 | Paper |
| A note on Presburger arithmetic with array segments, permutation and equality | 1986-01-01 | Paper |
| Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states | 1986-01-01 | Paper |
| A multiparameter analysis of the boundedness problem for vector addition systems | 1986-01-01 | Paper |
| Boundedness, empty channel detection, and synchronization for communicating finite automata | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740236 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746869 | 1986-01-01 | Paper |
| Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines | 1986-01-01 | Paper |
| A note on Parikh maps, abstract languages, and decision problems | 1985-01-01 | Paper |
| Priority Networks of Communicating Finite State Machines | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685206 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692862 | 1985-01-01 | Paper |
| The equivalence problem and correctness formulas for a simple class of programs | 1985-01-01 | Paper |
| On simple programs with primitive conditional statements | 1985-01-01 | Paper |
| Some characterizations of multihead finite automata | 1985-01-01 | Paper |
| On space and time efficient TM simulations of some restricted classes of PDA's | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216146 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217582 | 1984-01-01 | Paper |
| A note on the complexity of program evaluation | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685230 | 1984-01-01 | Paper |
| Simple programming languages and restricted classes of Turing machines | 1983-01-01 | Paper |
| On the control power of integer division | 1983-01-01 | Paper |
| Probabilistic algorithms and straight-line programs for some rank decision problems | 1981-01-01 | Paper |
| On the decidability of equivalence for deterministic pushdown transducers | 1981-01-01 | Paper |
| On restricted one-counter machines | 1981-01-01 | Paper |
