Modelling Timeouts without Timelocks

Bowman, Howard (1999) Modelling Timeouts without Timelocks. In: Formal Methods for Real-Time and Probabilistic Systems. Lecture Notes in Computer Science, 1601. Springer-Verlag pp. 334-354. (Full text available)

PDF
Download (251kB)
[img]
Preview
Postscript
Download (424kB)
[img]
Preview
Official URL
http://dx.doi.org/10.1007/3-540-48778-6_20

Abstract

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: Conference or workshop item (Paper)
Uncontrolled keywords: Timed Automata, Timelocks, Timeouts
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 12 Oct 2009 16:58
Last Modified: 12 May 2014 14:35
Resource URI: http://kar.kent.ac.uk/id/eprint/21826 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year