On using priced timed automata to achieve optimal scheduling

Formal Methods in System Design

Volumn 29, Issue 1, 2006, Pages 97-114

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

^a AALBORG UNIVERSITY   (Denmark)

^b West Virginia University   (United States)

Author keywords

Cost optimality; Linear programming; Priced timed automata; Real time scheduling; Zone based

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COST ACCOUNTING; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PERFORMANCE; PROBLEM SOLVING; SCHEDULING;

COST OPTIMALITY; PRICED-TIMED AUTOMATA; REAL-TIME SCHEDULING; ZONE-BASED;

OPTIMAL CONTROL SYSTEMS;

EID: 33746056120     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-006-0014-1     Document Type: Article

References (18)

1. Bozga M, Daws C, Maler O, Olivero A, Tripakis S, Yovine S (1998) Kronos: A model-checking tool tor real-time systems. In: Proc. 10th International Conference on Computer Aided Verification vol. 1427, pp. 546-550
2. Larsen KG, Pettersson P, Yi W (1997) UPPAAL in a nutshell. Int J Softw Tools Technol Transfer 1(1-2):134-152
3. Abdeddaïm Y, Kerbaa A, Maler O (2003) Task graph scheduling using timed automata. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), pp. 8 +
4. Behrmann G, Fehnker A, Hune T, Larsen K, Petterson P, Romijn J (2001) Efficient guiding towards cost-optimality in UPPAAL. Lecture Notes Comp Sci 2031:174 +
5. Larsen K, Behrmann G, Brinksma E, Fehnker A, Hune T, Pettersson P, Romijn J (2001) As cheap as possible: Efficient cost-optimal reachability for priced timed automata. Lect Notes Comp Sci 2102:493 +
6. Alur R, La Torre S, Pappas GJ (2001) Optimal paths in weighted timed automata. Lect Notes Comp Sci 2034:49 +
7. Gruian F, Kuchcinski K (1999) Low-energy directed architecture selection and task scheduling. In: Proceeding of the 25th EuroMICRO Conference vol. 1, pp. 296-302
8. Kwok Y-K, Ahmad I (1999) Benchmarking and comparison of the task graph scheduling algorithms. J Parallel Distrib Comp 59(3):381-422
9. Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2000) Scheduling aircraft landings - the static case. Transp Sci 34(2):180-197
10. Berkelaar M (Oct. 2003) www.es.sunysb.edu/~algorith/implement/lpsol%ve/ implement.shtml
11. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJ
12. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows - theory, algorithms, and applications. Prentice Hall
13. Cunningham WH (1976) A network simplex method. Math Prog 11:105-106
14. UPPAAL CORA (Nov. 2004) URL http://www.cs.aau.dk/behrmann/cora
15. Behrmann G, Fehnker A, Hune T, Larsen K, Pettersson P, Romijn J, Vaandrager F (2001) Minimum-cost reachability for priced timed automata. Lect Notes Comp Sci 2034:147 +
16. Alur R, Dill D (1990) Automata for modelling real-time systems. In: Proc. of Int. Colloquium on Algorithms, Languages and Programming, Lect Notes Comp Sci 443:322-335
17. Larsen K, Larsson F, Pettersson P, Yi W (1997) Efficient verification of real-time systems: Compact data structure and state space reduction. In: Proc. Real-Time Systems Symposium, pp. 14-24
18. Tobita T, Kouda M, Kasahara H (2000) Performance evaluation of minimum execution time multiprocessor scheduling algorithms using standard task graph set. In: Proc. of PDPTA'00, pp 745-751