A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Modelling Timeouts without Timelocks
[chapter]
1999
Lecture Notes in Computer Science
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. Speci cally, 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 di erent options for reformulating the timeout in this framework and then
doi:10.1007/3-540-48778-6_20
fatcat:hdnw5wbslbfyjn6i6am5p5e2km