Difference Bound Constraint Abstraction for Timed Automata Reachability Checking - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Difference Bound Constraint Abstraction for Timed Automata Reachability Checking

Résumé

We consider the reachability problem for timed automata. One of the most well-known solutions for this problem is the zone-based search method. Max bound abstraction and LU-bound abstraction on zones have been proposed to reduce the state space for zone based search. These abstractions use bounds collected from the timed automata structure to compute an abstract state space. In this paper we propose a difference bound constraint abstraction for zones. In this abstraction, sets of difference bound constraints collected from the symbolic run are used to compute the abstract states. Based on this new abstraction scheme, we propose an algorithm for the reachability checking of timed automata. Experiment results are reported on several timed automata benchmarks.
Fichier principal
Vignette du fichier
978-3-319-19195-9_10_Chapter.pdf (425.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01767323 , version 1 (16-04-2018)

Licence

Paternité

Identifiants

Citer

Weifeng Wang, Li Jiao. Difference Bound Constraint Abstraction for Timed Automata Reachability Checking. 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.146-160, ⟨10.1007/978-3-319-19195-9_10⟩. ⟨hal-01767323⟩
33 Consultations
182 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More