Skip to main content

Modelling Timeouts without Timelocks

Bowman, Howard (1999) Modelling Timeouts without Timelocks. In: Formal Methods for Real-Time and Probabilistic Systems 5th International. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 334-354. ISBN 978-3-540-66010-1. E-ISBN 978-3-540-48778-4. (doi:10.1007/3-540-48778-6_20) (KAR id:21826)


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 since when composed with a component behaviour, the timeout can generate timelocks. In response we consider an alternative timed automata framework - timed automata with deadlines. This framework has 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.

Item Type: Book section
DOI/Identification number: 10.1007/3-540-48778-6_20
Uncontrolled keywords: Timed Automata, Timelocks, Timeouts
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 12 Oct 2009 16:58 UTC
Last Modified: 16 Nov 2021 10:00 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.