Louis E. Rosier

According to our database1, Louis E. Rosier
  • authored at least 57 papers between 1980 and 1997.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1997
An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling.
Algorithmica, 1997

1995
Bounded Self-Stabilizing Petri Nets.
Acta Inf., 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

Normal and Sinkless Petri Nets.
J. Comput. Syst. Sci., 1993

1992
Pinwheel Scheduling with Two Distinct Numbers.
Theor. Comput. Sci., 1992

On the Competitiveness of On-Line Real-Time Task Scheduling.
Real-Time Systems, 1992

1991
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
Theor. Comput. Sci., 1991

Global and Local Views of State Fairness.
Theor. Comput. Sci., 1991

On the competitiveness of on-line real-time task scheduling.
Proceedings of the Real-Time Systems Symposium, 1991

Single-Path Petri Nets.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

On-line Scheduling in the Presence of Overload
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Static and dynamic scheduling of sporadic tasks for single-processor systems.
Proceedings of the Euromicro '91 Workshop on Real Time Systems, 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

Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor.
Proceedings of the Real-Time Systems Symposium, 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

Pinwheel Scheduling With Tow Distinct Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1989, 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
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.
Theor. Comput. Sci., 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
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines.
SIAM J. Comput., 1987

An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines.
J. Comput. Syst. Sci., 1987

An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.
Inf. Process. Lett., 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

A Survey on the Decidability Questions for Classes of FIFO Nets.
Proceedings of the Advances in Petri Nets 1988, 1987

1986
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata.
Theor. Comput. Sci., 1986

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.
Theor. Comput. Sci., 1986

A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems.
J. Comput. Syst. Sci., 1986

A Note on Presburger Arithmetic with Array Segments, Permutation and Equality.
Inf. Process. Lett., 1986

Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines.
Proceedings of the STACS 86, 1986

An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

Recent results on the complexity of problems related to Petri nets.
Proceedings of the Advances in Petri Nets 1987, 1986

1985
On Simple Programs with Primitive Conditional Statements
Information and Control, April, 1985

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs
Information and Control, April, 1985

Priority Networks of Communicating Finite State Machines.
SIAM J. Comput., 1985

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

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's
Information and Control, 1985

Some Characterizations of Multihead Finite Automata
Information and Control, 1985

Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines.
Proceedings of the STACS 85, 1985

A multiparameter analysis of the boundedness problem for vector addition systems.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
A Note on the Complexity of Program Evaluation.
Mathematical Systems Theory, 1984

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.
Proceedings of the Automata, 1984

Communicating Finite State Machines with Priority Channnels.
Proceedings of the Automata, 1984

1983
Simple Programming Languages and Restricted Classes of Turing Machines.
Theor. Comput. Sci., 1983

On the Control Power of Integer Division.
Theor. Comput. Sci., 1983

1981
On Restricted One-counter Machines.
Mathematical Systems Theory, 1981

On the Decidability of Equivalence for Deterministic Pushdown Transducers.
Inf. Process. Lett., 1981

Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems.
Inf. Process. Lett., 1981

1980
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices.
Inf. Process. Lett., 1980


  Loading...