Relating average and discounted costs for quantitative analysis of timed systems

Embedded Systems Week 2011, ESWEEK 2011 - Proceedings of the 9th ACM International Conference on Embedded Software, EMSOFT'11

Volumn , Issue , 2011, Pages 165-174

  Alur, Rajeev ^a   Trivedi, Ashutosh ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

And tauberian theorems; Blackwell optimality; Quantitative analysis; Timed automata

Indexed keywords

AVERAGE COST; BLACKWELL OPTIMALITY; CONTROLLER SYNTHESIS; DISCOUNTED COSTS; FINITE-STATE; OPTIMAL VALUES; OPTIMIZATION PROBLEMS; PERFORMANCE OBJECTIVE; PROBABILISTIC EXTENSION; PROBABILISTIC SYSTEMS; PROBABILISTIC TIMED AUTOMATA; STATE-SPACE; TAUBERIAN THEOREM; TIMED AUTOMATA; TIMED SYSTEMS;

COMPUTABILITY AND DECIDABILITY; COST BENEFIT ANALYSIS; COSTS; EMBEDDED SOFTWARE; OPTIMIZATION; REAL TIME SYSTEMS; TIME SHARING SYSTEMS;

EMBEDDED SYSTEMS;

EID: 80455143359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2038642.2038668     Document Type: Conference Paper

References (29)

1. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
2. R. Alur, S. La Torre, and G. Pappas. Optimal paths in weighted timed automata. In International Workshop on Hybrid Systems: Computation and Control (HSCC), volume 2034 of LNCS, pages 49-62. Springer, 2001. (Pubitemid 33256408)
3. E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In International Workshop on Hybrid Systems: Computation and Control (HSCC), volume 1569 of LNCS, pages 19-30. Springer, 1999.
4. G. Behrmann, K. G. Larsen, and J. I. Rasmussen. Priced timed automata: Algorithms and applications. In International Symposium Formal Methods for Components and Objects (FMCO), pages 162-182, 2004.
5. D. Blackwell. Discrete dynamic programming. Annals of Mathematical Statistics, 33:719-726, 1962.
6. P. Bouyer, E. Brinksma, and K. G. Larsen. Staying alive as cheaply as possible. In International Workshop on Hybrid Systems: Computation and Control (HSCC), volume 2993 of LNCS, pages 203-218. Springer, 2004.
7. T. Brihaye, T. A. Henzinger, V. S. Prabhu, and J. Raskin. Minimum-time reachability in timed games. In International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of LNCS, pages 825-837, 2007.
8. F. Cassez, J. Jessen, K. Larsen, J. Raskin, and P. Reynier. Automatic synthesis of robust and optimal controllers: an industrial case study. In International Workshop on Hybrid Systems: Computation and Control (HSCC), volume 5469 of LNCS, pages 90-104. Springer, 2009.
9. U. Fahrenberg and K. G. Larsen. Discount-optimal infinite runs in priced timed automata. ENTCS, 239:179 - 191, 2009. Joint Proceedings of INFINITY 2006, 2007, 2008.
10. W. Feller. An Introduction to Probability Theory and its Applications, volume II. John Wiley & Sons, New York, second edition, 1971.
11. J. Filar and K. Vrieze. Competitive Markov Decision Processes. 1997.
12. V. Forejt, M. Kwiatkowska, G. Norman, and A. Trivedi. Expected reachability-time games. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), volume 6246 of LNCS, pages 122-136. Springer, September 2010.
13. G. H. Hardy and J. E. Littlewood. Tauberian theorems concerning power series and Dirichlet's series whose coefficients are positive. Proc. of London Math. Soc., 13:174-191, 1914.
14. M. Hendriks and M. Verhoef. Timed automata based analysis of embedded system architectures. In International Parallel and Distributed Processing Symposium (IPDPS), pages 179-187. IEEE Computer Society, 2006.
15. P. Herber, J. Fellmuth, and S. Glesner. Model checking system C designs using timed automata. In Proceedings of the Hardware/Software Codesign and System Synthesis, pages 131-136. ACM, 2008.
16. M. Jurdzínski, M. Kwiatkowska, G. Norman, and A. Trivedi. Concavely-priced probabilistic timed automata. In International Conference on Concurrency Theory (CONCUR), volume 5710 of LNCS, pages 415-430. Springer, 2009.
17. M. Jurdzínski and A. Trivedi. Average-time games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 2 of Leibniz International Proceedings in Informatics. Schloss Dagstuhl, 2008.
18. M. Jurdzínski and A. Trivedi. Concavely-priced timed automata. In International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), volume 5215 of LNCS, pages 48-62. Springer, 2008.
19. Marcin Jurdzínski and Ashutosh Trivedi. Average-time games on timed automata. CoRR, abs/0910.2891, 2009.
20. Kronos. http://www-verimag.imag.fr/TEMPORISE/kronos/.
21. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282:101-150, 2002. (Pubitemid 34715712)
22. E. Lehrer and S. Sorin. A uniform Tauberian theorem in dynamic programming. Mathematics of Operation Research, 17:303-307, 1992.
23. O. Maler, K. G. Larsen, and B.H. Krogh. On zone-based analysis of duration probabilistic automata. In Proc. of International Workshop on Verification of Infinite-State Systems, volume 39 of EPTCS, pages 33-46, 2010.
24. J.-F. Mertens and A. Neyman. Stochastic games. International Journal of Game Theory, 10:53-66, 1981.
25. Prism. http://www.prismmodelchecker.org/.
26. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, 1994.
27. RED. http://cc.ee.ntu.edu.tw/̃farn/red/.
28. D. Rosenberg and S. Sorin. An operator approach to zero-sum stochastic games. Israel Journal of Mathematics, 121(1):221-246, 2001. (Pubitemid 33571999)
29. UPPAAL. http://www.uppaal.com/.