Modelling Timeouts without Timelocks

  • Howard Bowman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1601)


We address the issue of modelling a simple timeout in timed automata. We argue that expression of the timeout in the UPPAAL timed automata model is unsatisfactory. Specifically, the solutions we explore either allow timelocks or are prohibitively complex. In response we consider timed automata with deadlines which have the property that timelocks cannot be created when composing automata in parallel. We explore a number of different options for reformulating the timeout in this framework and then we relate them.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, pages 183–235, 1994.Google Scholar
  2. [2]
    Johan Bengtsson, Kim G. Larsen, Fredrik Larsson, and Paul Pettersson amd Wang Yi. Uppaal-a tool suite for automatic verification of real-time system. In Proceedings of the 4th DIMACS Workshop on Verification and Control of Hybrid Systems, 1995.Google Scholar
  3. [3]
    S. Bornot and J. Sifakis. On the composition of hybrid systems. In Hybrid Systems: Computation and Control, LNCS 1386, pages 49–63, 1998.CrossRefGoogle Scholar
  4. [4]
    S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgency in timed systems. In Compositionality, COMPOS’97, LNCS (to appear), 1997.Google Scholar
  5. [5]
    H. Bowman. Discussion document-modelling timeout behaviour in timed automata. Technical report, Available from author, 1998.Google Scholar
  6. [6]
    H. Bowman, G. Faconti, J-P. Katoen, D. Latella, and M. Massink. Automatic verification of a lip synchronisation algorithm using UPPAAL. In Proceedings of the 3rd International Workshop on Formal Methods for Industrial Critical Systems, 1998. To Appear in Special Issue of Formal Aspects of Computing.Google Scholar
  7. [7]
    C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In Hybrid Systems III, Verification and Control, LNCS 1066. Springer-Verlag, 1996.Google Scholar
  8. [8]
    Th. A. Henzinger and Pei Hsin. HyTech: The Cornell HYbrid TECHnology tool. In Proceedings of TACAS, Workshop on Tools and Algorithms for the Construction and Analysis of Systems, 1995.Google Scholar
  9. [9]
    L. Leonard and G. Leduc. An introduction to ET-LOTOS for the description of time-sens itive systems. Computer Networks and ISDN Systems, 29:271–292, 1996.CrossRefGoogle Scholar
  10. [10]
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  11. [11]
    X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebra. In Real-time Theory in Practice, LNCS 600, pages 549–572. Springer-Verlag, June 1991.CrossRefGoogle Scholar
  12. [12]
    T. Regan. Multimedia in temporal LOTOS: A lip synchronisation algorithm. In PSTV XIII, 13th Protocol Specification, Testing and Verification. North-Holland, 1993.Google Scholar
  13. [13]
    J. Sifakis and S. Yiovine. Compositional specification of timed systems, (extended abstract). In STACS’96, Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1046, pages 347–359. Springer-Verlag, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Howard Bowman
    • 1
  1. 1.Computing LaboratoryUniversity of Kent at CanterburyCanterbury, KentUK

Personalised recommendations