Behavioral Cartography of Timed Automata [chapter]

Étienne André, Laurent Fribourg
2010 Lecture Notes in Computer Science  
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
more » ... 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.
doi:10.1007/978-3-642-15349-5_5 fatcat:opiebs35efctxao3rkl3ujo6ji