| Publication | Date of Publication | Type |
|---|
An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling
Algorithmica | 1997-06-09 | Paper |
Bounded self-stabilizing Petri nets
Acta Informatica | 1995-06-21 | 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 |
Pinwheel scheduling with two distinct numbers
Theoretical Computer Science | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 17808 (Why is no real title available?) | 1992-06-26 | 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 |
A taxonomy of fairness and temporal logic problems for Petri nets
Theoretical Computer Science | 1991-01-01 | Paper |
Global and local views of state fairness
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 4115984 (Why is no real title available?) | 1988-01-01 | Paper |
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
Theoretical Computer Science | 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 4043216 (Why is no real title available?) | 1987-01-01 | Paper |
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4037227 (Why is no real title available?) | 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 |
A multiparameter analysis of the boundedness problem for vector addition systems
Journal of Computer and System Sciences | 1986-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 |
Boundedness, empty channel detection, and synchronization for communicating finite automata
Theoretical Computer Science | 1986-01-01 | Paper |
A note on Presburger arithmetic with array segments, permutation and equality
Information Processing Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982496 (Why is no real title available?) | 1986-01-01 | Paper |
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
STACS 86 | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3974295 (Why is no real title available?) | 1986-01-01 | Paper |
Some characterizations of multihead finite automata
Information and Control | 1985-01-01 | Paper |
Priority Networks of Communicating Finite State Machines
SIAM Journal on Computing | 1985-01-01 | Paper |
The equivalence problem and correctness formulas for a simple class of programs
Information and Control | 1985-01-01 | Paper |
A note on Parikh maps, abstract languages, and decision problems
Information Sciences | 1985-01-01 | Paper |
On space and time efficient TM simulations of some restricted classes of PDA's
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3907779 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917705 (Why is no real title available?) | 1985-01-01 | Paper |
On simple programs with primitive conditional statements
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3883587 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3907803 (Why is no real title available?) | 1984-01-01 | Paper |
A note on the complexity of program evaluation
Mathematical Systems Theory | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3881887 (Why is no real title available?) | 1984-01-01 | Paper |
Simple programming languages and restricted classes of Turing machines
Theoretical Computer Science | 1983-01-01 | Paper |
On the control power of integer division
Theoretical Computer Science | 1983-01-01 | Paper |
On the decidability of equivalence for deterministic pushdown transducers
Information Processing Letters | 1981-01-01 | Paper |
Probabilistic algorithms and straight-line programs for some rank decision problems
Information Processing Letters | 1981-01-01 | Paper |
On restricted one-counter machines
Mathematical Systems Theory | 1981-01-01 | Paper |
