Discount-Optimal Infinite Runs in Priced Timed Automata

Electronic Notes in Theoretical Computer Science

Volumn 239, Issue C, 2009, Pages 179-191

  Fahrenberg, Uli ^a   Larsen, Kim G ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

infinite schedules; infinite zones; optimal scheduling; priced timed automata; Timed automata

Indexed keywords

INFINITE SCHEDULES; INFINITE ZONES; OPTIMAL SCHEDULING; PRICED TIMED AUTOMATA; TIMED AUTOMATA;

COSTS; OPTIMIZATION; ROBOTS; SCHEDULING; SEMANTICS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 67649432520     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.05.039     Document Type: Article

References (15)

1. Abdeddaïm Y., Asarin E., and Maler O. Scheduling with timed automata. Theor. Comput. Sci. 354 (2006) 272-300
2. Aceto L., Ingólfsdóttir A., Larsen K.G., and Srba J. Reactive Systems (2007), Cambridge University Press
3. Alur R., and Dill D. Automata for modeling real-time systems. Proc. 17th Int. Coll. on Automata, Languages and Programming. (ICALP'90). Lecture Notes in Computer Science 443 (1990) 322-335
4. Alur R., La Torre S., and Pappas G.J. Optimal paths in weighted timed automata. Proc. 4th Int. Work. on Hybrid Systems: Computation and Control. (HSCC'01). Lecture Notes in Computer Science 2034 (2001) 49-62
5. Andersson, D., "Improved Combinatorial Algorithms for Discounted Payoff games," Master's thesis, Uppsala University, Department of Information Technology (2006)
6. Behrmann, G., E. Brinksma, M. Hendriks and A. Mader, Production scheduling by reachability analysis - a case study, in: Proc. 19th Int. Parallel and Distributed Processing Symp. (IPDPS'05) (2005)
7. Behrmann G., Fehnker A., Hune T., Larsen K.G., Pettersson P., Romijn J., and Vaandrager F. Minimum-cost reachability for priced timed automata. Proc. 4th Int. Work. on Hybrid Systems: Computation and Control. (HSCC'01). Lecture Notes in Computer Science 2034 (2001) 147-161
8. Bouyer P., Brinksma E., and Larsen K.G. Staying alive as cheaply as possible. Proc. 7th Int. Work. on Hybrid Systems: Computation and Control. (HSCC'04). Lecture Notes in Computer Science 2993 (2004) 203-218
9. Bozga, M., A. Kerbaa and O. Maler, Scheduling acyclic branching programs on parallel machines, in: Proc. 25th IEEE Real-Time Syst. Symp. (RTSS'04) (2004), pp. 208-217
10. Brinksma E., Mader A., and Fehnker A. Verification and optimization of a PLC control schedule. J. Software Tools for Technology Transfer (STTT) 4 (2002) 21-33
11. Fahrenberg, U. and K.G. Larsen, Discounting in time, in: Proc. 7th Work. on Quantitative Aspects of Programming Languages (QAPL'09), Electronic Notes in Theoretical Computer Science (2009), to appear
12. Henzinger T.A., Majumdar R., and Prabhu V.S. Quantifying similarities between timed systems. In: Pettersson P., and Yi W. (Eds). Proc. 3rd Int. Conf. on Formal Modeling and Analysis of Timed Systems. (FORMATS'05). Lecture Notes in Computer Science 3829 (2005) 226-241
13. Hune, T., K.G. Larsen and P. Pettersson, Guided synthesis of control programs using uppaal, in: Proc. IEEE ICDS Int. Work. Distributed Systems Verification and Validation (2000), pp. E15-E22
14. Larsen K.G., Behrmann G., Brinksma E., Fehnker A., Hune T., Pettersson P., and Romijn J. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. Proc. 13th Int. Conf. on Computer Aided Verification. (CAV'01). Lecture Notes in Computer Science 2102 (2001) 493-505
15. Zwick U., and Paterson M. The complexity of mean payoff games. Proc. 1st Int. Conf. on Computing and Combinatorics. (COCOON'95). Lecture Notes in Computer Science 959 (1995) 1-10