Modelling Timeouts without Timelocks [chapter]

Howard Bowman
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
more » ... we relate them. ? Howard Bowman is currently on leave at VERIMAG, Centre Equation, 2 rue Vignate, 38610 GIERES, France and CNR-Istituto CNUCE, Via S. Maria 36, 56126 -Pisa -Italy with the support of the European Commission's TMR programme.
doi:10.1007/3-540-48778-6_20 fatcat:hdnw5wbslbfyjn6i6am5p5e2km