Resource-optimal scheduling using priced timed automata

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

Volumn 2988, Issue , 2004, Pages 220-235

  Rasmussen, J I ^a   Larsen, K G ^a   Subramani, K ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COST ACCOUNTING; COSTS; LINEAR PROGRAMMING; SCHEDULING;

APPLICATION AREA; LINEAR PROGRAMS; OPTIMAL SCHEDULING; PERFORMANCE GAIN; REACHABILITY ANALYSIS; SIMPLE STRUCTURES; TASK GRAPH SCHEDULING PROBLEMS; TIMED AUTOMATA;

COST BENEFIT ANALYSIS;

EID: 35048885121     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_19     Document Type: Article

References (19)

1. Yasmina Abdeddaim, Abdelkarim Kerbaa, and Oded Maler. Task graph scheduling using timed automata. Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.
2. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows Theory, Algorithms, and Applications. Prentice Hall, 1993.
3. 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.
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. 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.
6. Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Petterson, and Judi Romijn. Efficient guiding towards cost-optimality in UPPAAL. Lecture Notes in Computer Science, 2031:pp. 174+, 2001.
7. Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. Minimum-cost reachability for priced timed automata. Lecture Notes in Computer Science, 2034:pp. 147+, 2001.
8. Michel Berkelaar. http://www.cs.sunysb.edu/~algorith/implement/lpsolve/ implement.shtml, Oct. 2003.
9. 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.
10. W. H. Cunningham. A network simplex method. Mathematical Programming, 11:pp. 105-106, 1976.
11. George B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.
12. Flavius Gruian and Krzysztof Kuchcinski. Low-energy directed architecture selection and task scheduling. Proceedings of the 25th EuroMICRO Conference, 1:pp. 296-302, 1999.
13. Yu-Kwong Kwok and Ishfaq Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59(3):pp. 381-422, 1999.
14. K. Larsen, F. Larsson, P. Pettersson, and W. Yi. Efficient verification of real-time systems: Compact data structure and state space reduction. In Proc. Real-Time Systems Symposium, pages pp. 14-24, 1997.
15. Kim Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. Lecture Notes in Computer Science, 2102:pp. 493+, 2001.
16. 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.
17. Andreas Löbel. http://www.zib.de/Optimization/Software/Mcf/, Oct. 2003.
18. Jacob Illum Rasmussen. Priced timed automata and duality - available at http://www.cs.auc.dk/~illum/pubs/ptaduality.html, 2003.
19. T. Tobita, M. Kouda, and H. Kasahara. Performance evaluation of minimum execution time multiprocessor scheduling algorithms using standard task graph set. Proc. of PDPTA'00, pages 745-751, 2000.