The control of dense real-time discrete event systems

The authors introduce dense real-time into the supervisory control of discrete event systems. They give conditions for the existence of a controller. If the plant and specification behaviors are represented by timed automata, there is a supremal controllable sublanguage of the specification language for a subclass of synthesis problems. The synthesized supervisor is polynomial in the number of automata states and exponential in the timing information.<<ETX>>

[1]  R. Alur.  Techniques for automatic verification of real-time systems , 1991 .

[2]  Y. Brave,et al.  Formulation and control of real time discrete event processes , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[3]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[4]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[5]  Yang Li,et al.  On Supervisory Control of Real-Time Discrete-Event Systems , 1987, 1987 American Control Conference.

[6]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[7]  W. M. Wonham,et al.  A framework for real-time discrete event control , 1990 .

[8]  Vijay K. Garg,et al.  On ω-controllability and ω-normality of deds , 1991 .

[9]  P. Ramadge.  Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata , 1989 .

[10]  W. M. Wonham,et al.  On Supervisory Control of Real-Time Discrete-Event Systems , 1987 .

[11]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[12]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[13]  Harry R. Lewis,et al.  A logic of concrete time intervals , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.