Rodney R. Howell

WorldScientific, ISBN: 9789811263859, 2023

2012

Computing First-to-First Propagation Delays through Sequences of Fixed-Priority Periodic Tasks.

[BibT_eX]

[DOI]

Proceedings of the 24th Euromicro Conference on Real-Time Systems, 2012

2010

Propagation Delays in Fixed-Priority Scheduling of Periodic Tasks.

[BibT_eX]

[DOI]

Masaaki Mizuno

Proceedings of the 22nd Euromicro Conference on Real-Time Systems, 2010

2002

Finite-State Self-Stabilizing Protocols in Message-Passing Systems.

[BibT_eX]

[DOI]

Mikhail Nesterenko

Masaaki Mizuno

J. Parallel Distributed Comput., 2002

1995

On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times

[BibT_eX]

[DOI]

Muralidhar K. Venkatrao

Inf. Comput., February, 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]

Sanjoy K. Baruah

Theor. Comput. Sci., 1993

Normal and Sinkless Petri Nets.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

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

The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Single-Path Petri Nets.

[BibT_eX]

[DOI]

Petr Jancar

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

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

[BibT_eX]

[DOI]

Sanjoy K. Baruah

Real Time Syst., 1990

The Instability of Self-Stabilization.

[BibT_eX]

[DOI]

Mohamed G. Gouda

Acta Informatica, 1990

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

[BibT_eX]

[DOI]

Sanjoy K. Baruah

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

System Simulation and the Sensitivity of Self-Stabilization.

[BibT_eX]

[DOI]

Mohamed G. Gouda

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

Completeness Results for Conflict-Free Vector Replacement Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

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

On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 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

1986

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

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

[BibT_eX]

[DOI]