Louis E. Rosier

Algorithmica, 1997

1995

Bounded Self-Stabilizing Petri Nets.

[BibT_eX]

[DOI]

Ludmila Cherkasova

Acta Informatica, 1995

1993

Completeness Results for Single-Path Petri Nets

[BibT_eX]

[DOI]

Petr Jancar

Inf. Comput., October, 1993

Feasibility Problems for Recurring Tasks on one Processor.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Normal and Sinkless Petri Nets.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

1992

Pinwheel Scheduling with Two Distinct Numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

On the Competitiveness of On-Line Real-Time Task Scheduling.

[BibT_eX]

[DOI]

Real Time Syst., 1992

1991

A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Global and Local Views of State Fairness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Single-Path Petri Nets.

[BibT_eX]

[DOI]

Petr Jancar

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

On-line Scheduling in the Presence of Overload

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Static and dynamic scheduling of sporadic tasks for single-processor systems.

[BibT_eX]

[DOI]

Donald A. Varvel

Proceedings of the Euromicro '91 Workshop on Real Time Systems, 1991

1990

Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.

[BibT_eX]

[DOI]

Real Time Syst., 1990

The Instability of Self-Stabilization.

[BibT_eX]

[DOI]

Acta Informatica, 1990

Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor.

[BibT_eX]

[DOI]

Aloysius K. Mok

Proceedings of the Real-Time Systems Symposium, 1990

On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Algorithms and complexity of the periodic maintenance problem.

[BibT_eX]

[DOI]

Microprocessing and Microprogramming, 1989

Pinwheel Scheduling With Tow Distinct Numbers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

System Simulation and the Sensitivity of Self-Stabilization.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Completeness Results for Conflict-Free Vector Replacement Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

1987

Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1988, 1987

A Survey on the Decidability Questions for Classes of FIFO Nets.

[BibT_eX]

[DOI]

Alain Finkel

Proceedings of the Advances in Petri Nets 1988, 1987

1986

Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

A Note on Presburger Arithmetic with Array Segments, Permutation and Equality.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Recent results on the complexity of problems related to Petri nets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1987, 1986

1985

On Simple Programs with Primitive Conditional Statements

[BibT_eX]

[DOI]

Inf. Control., April, 1985

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs

[BibT_eX]

[DOI]

Inf. Control., April, 1985

Priority Networks of Communicating Finite State Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

A note on Parikh maps, abstract languages, and decision problems.

[BibT_eX]

[DOI]

Alfred E. Borm

Inf. Sci., 1985

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's

[BibT_eX]

[DOI]

Sam M. Kim

Inf. Control., 1985

Some Characterizations of Multihead Finite Automata

[BibT_eX]

[DOI]

Sam M. Kim

Inf. Control., 1985

Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1984

A Note on the Complexity of Program Evaluation.

[BibT_eX]

[DOI]

Brian S. Leininger

Math. Syst. Theory, 1984

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.

[BibT_eX]

[DOI]

Sam M. Kim

Proceedings of the Automata, 1984

Communicating Finite State Machines with Priority Channnels.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

Simple Programming Languages and Restricted Classes of Turing Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

On the Control Power of Integer Division.

[BibT_eX]

[DOI]

Shlomo Moran

Theor. Comput. Sci., 1983

1981

On Restricted One-counter Machines.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1981

On the Decidability of Equivalence for Deterministic Pushdown Transducers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems.

[BibT_eX]

[DOI]

Shlomo Moran

Inf. Process. Lett., 1981

1980

A Note on the Parallel Complexity of Computing the Rank of Order n Matrices.

[BibT_eX]

[DOI]

Shlomo Moran