Timed Models

  • Christos G. Cassandras
  • Stéphane Lafortune
Part of the The Kluwer International Series on Discrete Event Dynamic Systems book series (DEDS, volume 11)


From this point on we will concentrate on timed models of DES. This means that the sample paths we consider can no longer be specified as event sequences {e 1, e 2,...} or state sequences {x 0, x 1,...}, but they must include some form of timing information. For example, let, t k , k = 1, 2,..., denote the time instant when the kth state transition occurs (with to given); then a timed sample path of a DES may be described by the sequence {(x 0, t 0), (x 1, t 1),...}. Creating a framework for timed DES models will enable us to address questions such as “how many events of a particular type can occur in a given time interval?”, or “how long does the system spend in a given state?” These issues are of critical importance in analyzing the behavior of DES such as computer systems and communication networks, since they provide us with particularly useful measures of system performance.


Sample Path State Transition Diagram Marked Graph Event Clock Time Automaton Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Selected References

Timed Automata and Timed Petri Nets

  1. Alur, R., and D.L. Dill, “A Theory of Timed Automata,” Theoretical Computer Science, No. 126, pp. 183–235, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  2. Brandin, B., and W.M. Wonham, “Supervisory Control of Timed Discrete-Event Systems,” IEEE Transactions on Automatic Control, Vol. 39, No. 2, pp. 329–342, February 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  3. David, R., and H. Alla, Petri Nets and Grafcet: Tools for Modelling Discrete Event Systems, Prentice-Hall, New York, 1992.zbMATHGoogle Scholar
  4. Murata, T., “Petri Nets: Properties, Analysis and Applications,” Proceedings of the IEEE, Vol. 77, 4, pp. 541–580, 1989.CrossRefGoogle Scholar
  5. Ostroff, J.S., Temporal Logic for Real-Time Systems, Research Studies Press and John Wiley & Sons, New York, 1989.Google Scholar

Max-Plus Algebra

  1. Baccelli, F., G. Cohen, G.J. Olsder, and J.P. Quadrat, Synchronization and Linearity, Wiley, 1992.Google Scholar
  2. Cohen, G., P. Moller, J.P. Quadrat, and M. Viot, “Algebraic Tools for the Performance Evaluation of Discrete Event Systems,” Proceedings of the IEEE, Vol. 77, 1, pp. 39–58, 1989.CrossRefGoogle Scholar
  3. Cunningham-Greene, R.A., Minimax Algebra, Springer-Verlag, Berlin, 1979.CrossRefGoogle Scholar


  1. Benveniste, A., and P. Le Guernic, “Hybrid Dynamical Systems Theory and the SIGNAL Language,” IEEE Transactions on Automatic Control, Vol. 35, No. 5, pp. 535–546, May 1990.zbMATHCrossRefGoogle Scholar
  2. Holloway, L.E., B.H. Krogh, and A. Giva, “A Survey of Petri Net Methods for Controlled Discrete Event Systems,” Journal of Discrete Event Dynamic Systems: Theory and Applications, Vol. 7, No. 2, pp. 151–190, April 1997.zbMATHCrossRefGoogle Scholar
  3. Levi, S.-T., and A.K. Agrawala, Real-Time System Design, McGraw-Hill, New York, 1990.Google Scholar
  4. Manna, Z., and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag, New York, 1992.CrossRefGoogle Scholar
  5. Manna, Z., and A. Pnueli, Temporal Verification of Reactive Systems: Safety, Springer-Verlag, New York, 1995.CrossRefGoogle Scholar
  6. Ostroff, J.S., “Formal Methods for the Specification and Design of Real-Time Safety-Critical Systems,” Journal of Systems and Software, Vol. 18, pp. 33–60, April 1992.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Christos G. Cassandras
    • 1
  • Stéphane Lafortune
    • 2
  1. 1.Boston UniversityUSA
  2. 2.The University of MichiganUSA

Personalised recommendations