Improved Undecidability Results on Weighted Timed Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2006

Improved Undecidability Results on Weighted Timed Automata

Résumé

In this paper, we improve two recent undecidability results of Brihaye, Bruyère and Raskin about weighted timed automata, an extension of timed automata with a cost variable. Our results rely on a new encoding of the two counters of a Minsky machine that only require three clocks and one stopwatch cost, while previous reductions required five clocks and one stopwatch cost.
Fichier principal
Vignette du fichier
IPL-BBM06.pdf (185.59 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01194609 , version 1 (07-09-2015)

Identifiants

Citer

Patricia Bouyer, Thomas Brihaye, Nicolas Markey. Improved Undecidability Results on Weighted Timed Automata. Information Processing Letters, 2006, 98 (5), pp.188-194. ⟨10.1016/j.ipl.2006.01.012⟩. ⟨hal-01194609⟩
53 Consultations
151 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More