Rodney R. Howell
According to our database1,
Rodney R. Howell
authored at least 25 papers
between 1986 and 2012.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2012
Computing First-to-First Propagation Delays through Sequences of Fixed-Priority Periodic Tasks.
Proceedings of the 24th Euromicro Conference on Real-Time Systems, 2012
2010
Propagation Delays in Fixed-Priority Scheduling of Periodic Tasks.
Proceedings of the 22nd Euromicro Conference on Real-Time Systems, 2010
1999
Finite-state self-stabilizing protocols in message-passing systems.
Proceedings of the 1999 ICDCS Workshop on Self-stabilizing Systems, 1999
1995
On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times
Inf. Comput., February, 1995
1993
Completeness Results for Single-Path Petri Nets
Inf. Comput., October, 1993
Feasibility Problems for Recurring Tasks on one Processor.
Theor. Comput. Sci., 1993
1991
Global and Local Views of State Fairness.
Theor. Comput. Sci., 1991
The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets.
Inf. Process. Lett., 1991
Single-Path Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991
Bounded Self-Stabilizing Petri Nets.
Proceedings of the Advances in Petri Nets 1993, 1991
1990
Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.
Real-Time Systems, 1990
The Instability of Self-Stabilization.
Acta Inf., 1990
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
1989
Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets.
Theor. Comput. Sci., 1989
System Simulation and the Sensitivity of Self-Stabilization.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989
Normal and Sinkless Petri Nets.
Proceedings of the Fundamentals of Computation Theory, 1989
1988
Completeness Results for Conflict-Free Vector Replacement Systems.
J. Comput. Syst. Sci., 1988
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
1987
An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.
Inf. Process. Lett., 1987
On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.
Proceedings of the STACS 87, 1987
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
On Questions of Fairness and Temporal Logic for Conflict- Free Petri Nets.
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.
Theor. Comput. Sci., 1986
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986
Recent results on the complexity of problems related to Petri nets.
Proceedings of the Advances in Petri Nets 1987, 1986