Priced timed automata: Algorithms and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3657 LNCS, Issue , 2005, Pages 162-182

  Behrmann, Gerd ^a   Larsen, Kim G ^a   Rasmussen, Jacob I ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SCHEDULING; PLANNING PROBLEMS; PRICED TIMED AUTOMATA; REAL-TIME VERIFICATION;

ALGORITHMS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS;

AUTOMATA THEORY;

EID: 33646030637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561163_8     Document Type: Conference Paper

References (25)

1. Y. Abdeddaim, A. Kerbaa, and O. Maler. Task graph scheduling using timed automata. In Proc. of International Parallel and Distributed Processing Symposium, pages 8-15, 2003.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
3. R. Alur, S. La Torre, and G. Pappas. Optimal paths in weighted timed automata. Lecture Notes in Computer Science, 2034:pp. 49-62, 2001.
4. J. E. Beasley, M. Krishnamoorthy, Y. M. Sharaiha, and D. Abramson. Scheduling aircraft landings - the static case. Transportation Science, 34(2):pp. 180-197, 2000.
5. G. Behrmann, A. David, and K. Larsen. A tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems, number 3185 in Lecture Notes in Computer Science, pages 200-236. Springer Verlag, 2004.
6. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, and J. Romijn. Efficient guiding towards cost-optimality in Uppaal. In Proc. of Tools and Algorithms for the Construction and Analysis of System.s, number 2031 in Lecture Notes in Computer Science, pages 174-188. Springer-Verlag, 2001.
7. Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. In Proc. of Hybrid Systems: Computation and Control, number 2034 in Lecture Notes in Computer Sciences, pages 147-161. Springer-Verlag, 2001.
8. P. Bouyer, E. Brinksma, and K. Larsen. Staying alive as cheaply as possible. In Proc. of Hybrid Systems: Computation and Control, volume 2993 of Lecture Notes in Computer Science, pages 203-218. Springer-Verlag, 2004.
9. P. Bouyer, F. Cassez, E. Fleury, and K. Larsen. Optimal strategies in priced timed game automata. In Proc. of Foundations of Software Technology and Theoretical Computer Science, volume 3328 of Lecture Notes in Computer Science, pages 148-160. Springer-Verlag, 2004.
10. Patricia Bouyer, Franck Cassez, Emmanuel Fleury, and Kim G. Larsen. Synthesis of optimal strategies using hytech. In Workshop on Games in Design and Verification, volume 119(1) of Electronic Notes in Theoretical Computer Science, pages 11-31, Boston, MA, USA, July 2004. Elsevier Science Publishers.
11. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In Proc. of Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 546-550. Springer-Verlag, 1998.
12. UPPAAL CORA. http://www.cs.aau.dk/~behrmann/cora, Jan. 2005.
13. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Proc. Of Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notex in Computer Science, pages 197-212. Springer-Verlag, 1989.
14. A. Fehnker. Scheduling a steel plant with timed automata. In Proc. of Real-Time and Embedded Computing Systems and Applications., page 280. IEEE Computer Society, 1999.
15. T. Hune, K. Larsen, and P. Pettersson. Guided synthesis of control programs using Uppaal. Nordic Journal of Computing, 8(1):43-64, 2001.
16. IF. http://www-verimag.imag.fr/~async/IF, Jan. 2005.
17. Advanced Methods in Timed Systems (AMETIST). http://ametist.cs.utwente. nl, Jan. 2005.
18. R. M. Karp. A characterization of the minimum mean-cycle in a digraph. Discrete Mathematics, 23(3):309-311, 1978.
19. K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In Proc. of Computer Aided Verification, volume 2102, pages pp. 493+, 2001.
20. K. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, 1997.
21. K. Larsen and J. Rasmussen. Optimal conditional reachability for multi-priced timed automata. In Proc. of Foundations of Software Science and Computation Structures, volume 3441 of Lecture Notes in Computer Science, pages 234-249. Springer-Verlag, 2005.
22. Verification of Hybrid Systems (VHS). http://www-verimag.imag.fr/VHS/, Jan. 2005.
23. J. Rasmussen, K. Larsen, and K. Subramani. Resource-optimal scheduling using priced timed automata. In Proc. of Tool and Algortihms for the Construction and Analysis of Systems, volume 2988 of Lecture Notes in Computer Science, pages 220-235. Springer Verlag, 2004.
24. M. Stobbe. Results on scheduling the sidmar steel plant using constraint programming. Internal report, 2000.
25. UPPAAL. http://www.uppaal.com, Jan. 2005.