Sciweavers

IPL
2006

Improved undecidability results on weighted timed automata

13 years 4 months ago
Improved undecidability results on weighted timed automata
In this paper, we strengthen two recent undecidability results of [9,10] 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 [9,10]. Key words: Weighted timed automata, weighted timed games, undecidability
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors Patricia Bouyer, Thomas Brihaye, Nicolas Markey
Comments (0)