A tool for the syntactic detection of zeno-timelocks in timed automata

Bowman, H. and Gomez, R.S. and Su, L. (2005) A tool for the syntactic detection of zeno-timelocks in timed automata. Electronic Notes in Theoretical Computer Science, 139 (1). pp. 25-47. (Full text available)

Download (266kB)


Timed automata are a very successful notation for specifying and verifying real-time systems, but timelocks can freely arise. These are counter-intuitive situations in which a specifier's description of a component automaton can inadvertently prevent time from passing beyond a certain point, possibly making the entire system stop. In particular, a zeno-timelock represents a situation where infinite computation is performed in a finite period of time. Zeno-timelocks are very hard to detect for real-time model checkers, e.g. UPPAAL and Kronos. We have developed a tool which can take an UPPAAL model as input and return a number of loops which can potentially cause zeno-timelocks. This tool implements an algorithm which refines a static verification approach introduced by Tripakis. We illustrate the use of this tool on a real-life case-study, the CSMA/CD protocol.

Item Type: Article
Additional information: Proceedings of the 6th AMAST Workshop on Real-time Systems (ARTS 2004)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:02
Last Modified: 20 Apr 2012 11:42
Resource URI: http://kar.kent.ac.uk/id/eprint/14234 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year