Behavioral Cartography of Timed Automata

  • Étienne André
  • Laurent Fribourg
Conference paper

DOI: 10.1007/978-3-642-15349-5_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6227)
Cite this paper as:
André É., Fribourg L. (2010) Behavioral Cartography of Timed Automata. In: Kučera A., Potapov I. (eds) Reachability Problems. RP 2010. Lecture Notes in Computer Science, vol 6227. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Étienne André
    • 1
  • Laurent Fribourg
    • 1
  1. 1.LSV – ENS de Cachan & CNRSFrance

Personalised recommendations