Backward Symbolic Optimal Reachability in Weighted Timed Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Backward Symbolic Optimal Reachability in Weighted Timed Automata

Rémi Parrot
  • Fonction : Auteur
  • PersonId : 1253052
  • IdHAL : remi-parrot
STR
Didier Lime
STR

Résumé

We address the problem of computing the infimum accumulated weight for the reachability of some goal location in weighted timed automata. While there already exist efficient techniques to solve this problem, we propose here a backwards symbolic algorithm computing the accumulated weight to the goal, instead of the accumulated weight from the initial state. Going backwards has in itself a few advantages: most notably it does not require any extrapolation operation to ensure termination. Also it may be more efficient than going forward if the set of co-reachable states is smaller than the set of reachable states. Backwards algorithms are also instrumental in several problems beyond reachability, like control problems for instance. We obtain our backward algorithm by proposing extensions of the classical action and time predecessor operations on zones to account for weights. We have implemented the approach and report on its performance.
Fichier principal
Vignette du fichier
parrot-FORMATS-20.pdf (385.23 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02939596 , version 1 (15-09-2020)

Identifiants

Citer

Rémi Parrot, Didier Lime. Backward Symbolic Optimal Reachability in Weighted Timed Automata. 18th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2020), Sep 2020, Vienna, Austria. pp.41-57, ⟨10.1007/978-3-030-57628-8_3⟩. ⟨hal-02939596⟩
42 Consultations
103 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More