A Tool for the Syntactic Detection of Zeno-timelocks in Timed Automata

Authors:
Howard Bowman;Rodolfo Gomez;Li Su
Affiliations:
Computing Laboratory, University of Kent, Canterbury, United Kingdom;Computing Laboratory, University of Kent, Canterbury, United Kingdom;Computing Laboratory, University of Kent, Canterbury, United Kingdom
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 4
Cited 0

Communication and Concurrency

Communication and Concurrency
Time and Action Lock Freedom Properties for Timed Automata

FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
On the Composition of Hybrid Systems

HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Modelling Timeouts without Timelocks

ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.