Modeling Urgency in Timed Systems

  • Sébastien Bornot
  • Joseph Sifakis
  • Stavros Tripakis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1536)


Timed systems can be modeled as automata (or, generally, discrete transition structures) extended with real-valued variables (clocks) measuring the time elapsed since their initialization. The following features are also common in the above models.
  • States are associated with time progress conditions specifying how time can advance. Time can progress at a state by t only if all the intermediate states reached satisfy the associated time progress condition.

  • At transitions, clock values can be tested and modified. This is usually done by associating with transitions guards (conditions on clocks) and assignments. If a guard is true from an automaton state and a given clock valuation, the corresponding transition can be executed by modifying clocks as specified by the corresponding assignment.


Media Object Synchronization Mode Multimedia Document Input Place Speci Cation 
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.


  1. [ABRW91]
    N.C. Audsley, A. Bums, M.F. Richardson, and A.J. Wellings. Deadlinemonotonic scheduling. In Proc. 8th IEEE Workshop on Real-time Operating Systems and Software, 1991.Google Scholar
  2. [ACD93]
    R. Alur, C. Courcoubetis, and D.L. Dill. Model checking in dense real time. Information and Computation, 104(1):2–34, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [A1183]
    J.F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, November 1983.Google Scholar
  4. [BS97a]
    S. Bornot and J. Sifakis. On the composition of hybrid systems (complete version). In International NATO Summer School on “Verification of Digital and Hybrid Systems”, Antalya, Turkey, 1997.Google Scholar
  5. [BS97b]
    S. Bornot and J. Sifakis. Relating time progress and deadlines in hybrid systems. In International Workshop, HART’97, pages 286–300, Grenoble, France, March 1997. Lecture Notes in Computer Science 1201, Spinger-Verlag.Google Scholar
  6. [HNSY94]
    T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [JLSIR97]
    M. Jourdan, N. Layaïda, L. Sabry-Ismail, and C. Roisin. Authoring and presentation environment for interactive multimedia documents. In Proc. of the 4th Conf. on Multimedia Modelling, Singapore, November 1997. World Scientific Publishing.Google Scholar
  8. [Mer74]
    P. Merlin. A study of the recoverability of computer systems. Master’s thesis, University of California, Irvine, 1974.Google Scholar
  9. [SDdSS94]
    P. Sénac, M. Diaz, and P. de Saqui-Sannes. Toward a formal specification of multimedia scenarios. Annals of telecomunications, 49(5-6):297–314, 1994.Google Scholar
  10. [Sif77]
    J. Sifakis. Use of petri nets for performance evaluation. In H. Beilner and E. Gelenebe, editors, Measuring, modelling and evaluating computer systems, pages 75–93. North-Holland, 1977.Google Scholar
  11. [SY96]
    J. Sifakis and S. Yovine. Compositional specification of timed systems. In 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS’96, pages 347–359, Grenoble, France, February 1996. Lecture Notes in Computer Science 1046, Spinger-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Sébastien Bornot
    • 1
  • Joseph Sifakis
    • 1
  • Stavros Tripakis
    • 1
  1. 1.Centre ÉquationVERIMAGGièresFrance

Personalised recommendations