zbMATH — the first resource for mathematics

Behavioral cartography of timed automata. (English) Zbl 1287.68089
Kučera, Antonín (ed.) et al., Reachability problems. 4th international workshop, RP 2010, Brno, Czech Republic, August 28–29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15348-8/pbk). Lecture Notes in Computer Science 6227, 76-90 (2010).
Summary: We aim at finding a set of timing parameters for which a given timed automaton has a “good” behavior. We present here a novel approach based on the decomposition of the parametric space into behavioral tiles, i.e., sets of parameter valuations for which the behavior of the system is uniform. This gives us a behavioral cartography according to the values of the parameters. It is then straightforward to partition the space into a “good” and a “bad” subspace, according to the behavior of the tiles. We extend this method to probabilistic systems, allowing to decompose the parametric space into tiles for which the minimal (resp. maximal) probability of reaching a given location is uniform. An implementation has been made, and experiments successfully conducted.
For the entire collection see [Zbl 1194.68049].

68Q45 Formal languages and automata
Full Text: DOI