Optimal conditional reachability for multi-priced timed automata

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 234-249

  Larsen, Kim Guldstrand ^a   Rasmussen, Jacob Illum ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

COST VARIABLES; TIMED AUTOMATA; ZONE-BASED ALGORITHMS;

AUTOMATA THEORY;

EID: 24644519083     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_15     Document Type: Conference Paper

References (11)

1. Parosh Aziz Abdulla and Aletta Nylén. Better is better than well: On efficient verification of infinite-state systems. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, page 132. IEEE Computer Society, 2000.
2. R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, number 443, pages 322-335, July 1990.
3. Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, and Pei-Hsin Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, pages 209-229, 1992.
4. Rajeev Alur, Salvatore La Torre, and George J. Pappas. Optimal paths in weighted timed automata. Lecture Notes in Computer Science, 2034:pp. 49, 2001.
5. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In A. J. Hu and M. Y. Vardi, editors, Proc. 10th International Conference on Computer Aided Verification, Vancouver, Canada, volume 1427, pages 546-550. Springer-Verlag, 1998.
6. Thomas Brihaye, Véronique Bruyére, and Jean-François Raskin. Model-checking weighted timed automata. In the proc. of FORMATS'04, Lecture Notes in Computer Science. Springer-Verlag, 2004.
7. Michael R. Garey and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
8. Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. HYTECH: A model checker for hybrid systems. International Journal on Software Tools for Technology Transfer, 1(1-2):110-122, 1997.
9. Kim Larsen, Gerd Behrmann, Ed. Brinksma, Ansgar Fehnker, Thomas Hune, Paul Petterssón, and Judi Romijn. As cheap as possible: Efficient cost- optimal reachability for priced timed automata. Lecture Notes in Computer Science, 2102:pp. 493+, 2001.
10. Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2): 134-152, 1997.
11. Anuj Puri and Stavros Tripakis. Algorithms for the multi-constrained routing problem. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, pages 338-347. Springer-Verlag, 2002.