Undecidability of cost-bounded reachability in priced probabilistic timed automata

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

Volumn 5532 LNCS, Issue , 2009, Pages 128-137

  Berendsen, Jasper ^a   Chen, Taolue ^b   Jansen, David N ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTER MACHINES; PROBABILISTIC TIMED AUTOMATA; REACHABILITY; TIME BOUND; TIMED AUTOMATA; UNDECIDABILITY;

COSTS; LOCATION; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 67650248513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02017-9_16     Document Type: Conference Paper

References (9)

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
2. Alur, R., Torre, S.L., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49-62. Springer, Heidelberg (2001)
3. Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J., Vaandrager, F.W.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147-161. Springer, Heidelberg (2001)
4. Berendsen, J., Jansen, D.N., Katoen, J.P.: Probably on time and within budget: On reachability in priced probabilistic timed automata. In: QEST, pp. 311-322. IEEE Computer Society Press, Los Alamitos (2006)
5. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282(1), 101-150 (2002)
6. Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5), 188-194 (2006)
7. Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 33-47. Springer, Heidelberg (2008)
8. Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains, 2nd edn. Springer, New York (1976)
9. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River (1967)