© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Modelling timeouts without timelocks
Howard Bowman
In ARTS'99, 5th International AMAST Workshop on Real-time and Probabilistic Systems, volume 1601 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, May 1999.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.
Download publication 415 kbytes (PostScript)Bibtex Record
@inproceedings{695, author = {Howard Bowman}, title = {Modelling Timeouts without Timelocks}, month = {May}, year = {1999}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/1999/695}, booktitle = {ARTS'99, 5th International AMAST Workshop on Real-time and Probabilistic Systems}, publisher = {Springer-Verlag}, refereed = {yes}, series = {Lecture Notes in Computer Science}, volume = {1601}, }