Improved undecidability results on weighted timed automata

Information Processing Letters

Volumn 98, Issue 5, 2006, Pages 188-194

  Bouyer, Patricia ^a   Brihaye, Thomas ^b   Markey, Nicolas ^a  

^a CNRS   (France)

^b UNIVERSITY OF MONS   (Belgium)

Author keywords

Real time systems; Weighted timed automata; Weighted timed games

Indexed keywords

CLOCKS; COMPUTABILITY AND DECIDABILITY; COST ACCOUNTING; MACHINERY; REAL TIME SYSTEMS; REDUCTION; SIGNAL ENCODING; STOP WATCHES;

COST VARIABLES; WEIGHTED TIMED AUTOMATA; WEIGHTED TIMED GAMES;

AUTOMATA THEORY;

EID: 33645056725     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.01.012     Document Type: Article

References (13)

1. R. Alur, M. Bernadsky, and P. Madhusudan Optimal reachability in weighted timed games Proc. 31st Internat. Coll. Automata, Languages and Programming (ICALP'04) Lecture Notes in Comput. Sci. vol. 3142 2004 Springer Berlin 122 133
2. R. Alur, C. Courcoubetis, and D. Dill Model-checking in dense real-time Inform. and Comput. 104 1 1993 2 34
3. R. Alur, and D. Dill A theory of timed automata Theoret. Comput. Sci. 126 2 1994 183 235
4. R. Alur, Th.A. Henzinger, and P.-H. Ho Automatic symbolic verification of embedded systems IEEE Trans. Software Engrg. 22 3 1996 181 201
5. R. Alur, S. La Torre, and G.J. Pappas Optimal paths in weighted timed automata Proc. 4th Internat. Workshop Hybrid Systems: Computation and Control (HSCC'01) Lecture Notes in Comput. Sci. vol. 2034 2001 Springer Berlin 49 62
6. G. Behrmann, A. Fehnker, Th. Hune, K.G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager Minimum-cost reachability for priced timed automata Proc. 4th Internat. Workshop Hybrid Systems: Computation and Control (HSCC'01) Lecture Notes in Comput. Sci. vol. 2034 2001 Springer Berlin 147 161
7. P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen Optimal strategies in priced timed game automata Proc. 24th Conf. Foundations of Software Technology & Theoretical Computer Science (FST&TCS'04) Lecture Notes in Comput. Sci. vol. 3328 2004 Springer Berlin 148 160
8. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit Updatable timed automata Theoret. Comput. Sci. 321 2-3 2004 291 345
9. Th. Brihaye, V. Bruyère, and J.-F. Raskin On model-checking timed automata with stopwatch observers Inform. and Comput. 204 3 2006 408 433
10. Th. Brihaye, V. Bruyère, and J.-F. Raskin On optimal timed strategies Proc. 3rd Internat. Conference Formal Modeling and Analysis of Timed Systems (FORMATS'05) Lecture Notes in Comput. Sci. vol. 3821 2005 Springer Berlin 49 64
11. Th. Brihaye, V. Bruyère, and J.-F. Raskin Model-checking for weighted timed automata Proc. Joint Conf. Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS+ FTRTFT'04) Lecture Notes in Comput. Sci. vol. 3253 2004 Springer Berlin 277 292
12. S. La Torre, S. Mukhopadhyay, and A. Murano Optimal-reachability and control for acyclic weighted timed automata Proc. 2nd IFIP Internat. Conf. Theoret. Comput. Sci. (TCS 2002) IFIP Conf. Proc. vol. 223 2002 Kluwer Dordrecht
13. M. Minsky Computation: Finite and Infinite Machines 1967 Prentice-Hall Int. Englewood Cliffs, NJ