Static guard analysis in timed automata verification

DMCA

Static guard analysis in timed automata verification (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gerd Behrmann , Patricia Bouyer , Emmanuel Fleury , Kim G. Larsen

Venue:	IN TACAS
Citations:	26 - 8 self

BibTeX

@INPROCEEDINGS{Behrmann03staticguard,
    author = {Gerd Behrmann and Patricia Bouyer and Emmanuel Fleury and Kim G. Larsen},
    title = {Static guard analysis in timed automata verification},
    booktitle = {IN TACAS},
    year = {2003},
    pages = {254--277},
    publisher = {Springer}
}

OpenURL

Abstract

By definition Timed Automata have an infinite state-space, thus for verification purposes, an exact finite abstraction is required. We propose a location-based finite zone abstraction, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed to all guards). We show that the location-based zone abstraction is sound and complete with respect to location reachability; that it generalises active-clock reduction, in the sense that an inactive clock has no relevant guards at all; that it enlarges the class of timed automata, that can be verified. We generalise the new abstraction to the case of networks of timed automata, and experimentally demonstrate a potentially exponential speedup compared to the usual abstraction.

Keyphrases

timed automaton verification static guard analysis relevant guard timed automaton particular state usual abstraction exact finite abstraction location-based zone abstraction location reachability inactive clock active-clock reduction locationbased finite zone abstraction verification purpose exponential speedup new abstraction infinite state-space definition timed automaton

DMCA