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

Citing 9
Cited 6

Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Optimal-Reachability and Control for Acyclic Weighted Timed Automata

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Updatable timed automata

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines
On model-checking timed automata with stopwatch observers

Information and Computation
On optimal timed strategies

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Optimal strategies in priced timed game automata

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Q-Automata: Modelling the Resource Usage of Concurrent Components

Electronic Notes in Theoretical Computer Science (ENTCS)
Model-checking Timed Temporal Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Model-checking one-clock priced timed automata

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A Kleene-Schützenberger theorem for weighted timed automata

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Kleene-Schützenberger theorem for weighted timed automata

Theoretical Computer Science

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.