| Publication | Date of Publication | Type |
|---|
| Algorithms | 2023-03-10 | Paper |
Finite-state self-stabilizing protocols in message-passing systems
Journal of Parallel and Distributed Computing | 2002-10-16 | Paper |
Bounded self-stabilizing Petri nets
Acta Informatica | 1995-06-21 | Paper |
On non-preemptive scheduling of recurring tasks using inserted idle times
Information and Computation | 1995-05-28 | Paper |
Completeness results for single-path Petri nets
Information and Computation | 1994-05-06 | Paper |
Feasibility problems for recurring tasks on one processor
Theoretical Computer Science | 1993-12-06 | Paper |
| scientific article; zbMATH DE number 176140 (Why is no real title available?) | 1993-05-18 | Paper |
Normal and sinkless Petri nets
Journal of Computer and System Sciences | 1993-05-16 | Paper |
The complexity of problems involving structurally bounded and conservative Petri nets
Information Processing Letters | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17543 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17805 (Why is no real title available?) | 1992-06-26 | Paper |
Global and local views of state fairness
Theoretical Computer Science | 1991-01-01 | Paper |
A taxonomy of fairness and temporal logic problems for Petri nets
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4215346 (Why is no real title available?) | 1990-01-01 | Paper |
The instability of self-stabilization
Acta Informatica | 1990-01-01 | Paper |
Problems concerning fairness and temporal logic for conflict-free Petri nets
Theoretical Computer Science | 1989-01-01 | Paper |
Completeness results for conflict-free vector replacement systems
Journal of Computer and System Sciences | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4070338 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4096790 (Why is no real title available?) | 1988-01-01 | Paper |
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
Journal of Computer and System Sciences | 1987-01-01 | Paper |
An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4024808 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4035164 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4037227 (Why is no real title available?) | 1987-01-01 | Paper |
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3974295 (Why is no real title available?) | 1986-01-01 | Paper |
