Improved undecidability results on weighted timed automata

  • Authors:

  • Patricia Bouyer;Thomas Brihaye;Nicolas Markey

  • Affiliations:

  • Lab. Spécification & Véérification, CNRS & ENS de Cachan, France;Univ. Mons-Hainault, Centre Fédéré en Vérification, Belgium;Lab. Spécification & Véérification, CNRS & ENS de Cachan, France

  • Venue:
  • Information Processing Letters
  • Year:
  • 2006

Quantified Score

Hi-index 0.89

Visualization

Abstract

In this paper, we strengthen two recent undecidability results about weighted timed automata, an extension of timed automata with cost variables. More precisely, we propose new encodings of a Minsky machine that only require three clocks and one stopwatch cost, while previous reductions required five clocks and one stopwatch cost. Timed Systems (FORMATS'05), in: Lecture Notes in Comput. Sci., vol. 3821, Springer, Berlin, 2005, pp. 49-64] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we propose new encodings of a Minsky machine that only require three clocks and one stopwatch cost, while they required five clocks and one stopwatch cost in [Th. Brihaye, V. Bruyere, J.-F. Raskin, On model-checking timed automata with stopwatch observers, 2005, submitted for publication; Th. Brihaye, V. Bruyere, J.-F. Raskin, On optimal timed strategies, in: Proc. 3rd Internat. Conference Formal Modeling and Analysis of Timed Systems (FORMATS'05), in: Lecture Notes in Comput. Sci., vol. 3821, Springer, Berlin, 2005, pp. 49-64].