Time-bounded verification

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

Volumn 5710 LNCS, Issue , 2009, Pages 496-510

  Ouaknine, Joël ^a   Rabinovich, Alexander ^b   Worrell, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED LANGUAGE; METRIC TEMPORAL LOGIC; MODEL CHECKING PROBLEM; PREDICATE LOGIC; SATISFIABILITY; SECOND-ORDER LOGIC; TIME INTERVAL; TIMED AUTOMATA; VERIFICATION PROBLEMS;

COMPUTABILITY AND DECIDABILITY; LINEARIZATION; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 70349871428     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_33     Document Type: Conference Paper

References (42)

1. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for real-time systems. In: Proceedings of LICS. IEEE Computer Society Press, Los Alamitos (1990)
2. Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci. 126 (1994)
3. Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1) (1996)
4. Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed automata. Theor. Comput. Sci. 211 (1999)
5. Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.600, pp. 74-106. Springer, Heidelberg (1992)
6. Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. Inf. and Comput. 104(1) (1993)
7. Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.3414, pp. 70-85. Springer, Heidelberg (2005)
8. Baier, C., Hermanns, H., Katoen, J.-P., Haverkort, B.R.: effcient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comput. Sci. 345(1) (2005)
9. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: On expressiveness and complexity in real-time model checking. In: Aceto, L., Damgård, I., Goldberg, L.A., Halld́orsson, M.M., Ingólfsd́ottir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.5126, pp. 124-135. Springer, Heidelberg (2008)
10. Boisnaicki, D.: Digitization of timed automata. In: Proceedings of FMICS (1999)
11. Emmi, M., Majumdar, R.: Decision problems for the verification of real-time software. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol.3927, pp. 200-211. Springer, Heidelberg (2006)
12. Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal basis of fairness. In: Proceedings of POPL. ACM Press, New York (1980)
13. Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol.1201, pp. 331-345. Springer, Heidelberg (1997)
14. Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.623, pp. 545-558. Springer, Heidelberg (1992)
15. Henzinger, T.A., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.1790, p. 145. Springer, Heidelberg (2000)
16. Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.1443, p. 580. Springer, Heidelberg (1998)
17. Herrmann, P.: Timed automata and recognizability. Inf. Process. Lett. 65 (1998)
18. Hirshfeld, Y., Rabinovich, A.: Future temporal logic needs infinitely many modalities. Inf. Comput. 187(2) (2003)
19. Hirshfeld, Y., Rabinovich, A.: Logics for real time: Decidability and complexity. Fundam. Inform. 62(1) (2004)
20. Hirshfeld, Y., Rabinovich, A.: Expressiveness of metric modalities for continuous time. Logical Methods in Computer Science 3(1) (2007)
21. Kamp, H.: Tense logic and the theory of linear order. Ph.D. Thesis (1968)
22. Katoen, J.-P., Zapreev, I.S.: Safe on-the-.y steady-state detection for timebounded reachability. In: Proceedings of QEST. IEEE Computer Society, Los Alamitos (2006)
23. Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: Timed I/O Automata: A mathematical framework for modeling and analyzing real-time systems. In: Proceedings of RTSS. IEEE Computer Society Press, Los Alamitos (2003)
24. Koymans, R.: Specifying real-time properties with metric temporal logic. Real- Time Systems 2(4) (1990)
25. Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics over the reals: PSpace and below. Inf. and Comput. 205 (2007)
26. Lynch, N.A., Attiya, H.: Using mappings to prove timing properties. Distributed Computing 6(2) (1992)
27. Meyer, A.R.: Weak monadic second-order theory of successor is not elementaryrecursive. In: Logic colloquium. LNM, vol.453, pp. 72-73. Springer, Heidelberg (1975)
28. Ouaknine, J.: Digitisation and full abstraction for dense-time model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.2280, p. 37. Springer, Heidelberg (2002)
29. Ouaknine, J., Rabinovich, A.,Worrell, J.: Time-bounded verification (full version) (in preparation, 2009)
30. Ouaknine, J., Worrell, J.: Revisiting digitization, robustness, and decidability for timed automata. In: Proceedings of LICS. IEEE Computer Society Press, Los Alamitos (2003)
31. Ouaknine, J., Worrell, J.: Universality and language inclusion for open and closed timed automata. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol.2623, pp. 375-388. Springer, Heidelberg (2003)
32. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of LICS. IEEE Computer Society Press, Los Alamitos (2004)
33. Ouaknine, J., Worrell, J.: On the decidability of Metric Temporal Logic. In: Proceedings of LICS. IEEE Computer Society Press, Los Alamitos (2005)
34. Ouaknine, J., Worrell, J.: Safety Metric Temporal Logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.3920, pp. 411-425. Springer, Heidelberg (2006) (Pubitemid 44019385)
35. Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science 3(1) (2007)
36. Rabinovich, A.: Finite variability interpretation of monadic logic of order. Theor. Comput. Sci. 275(1-2) (2002)
37. Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, University of Namur (1999)
38. Reynolds, M.: The complexity of temporal logic over the reals (2004) (submitted)
39. Roux, O., Rusu, V.: Verifying time-bounded properties for ELECTRE reactive programs with stopwatch automata. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol.999, pp. 105-116. Springer, Heidelberg (1995)
40. Shelah, S.: The monadic theory of order. Ann. Math. 102 (1975)
41. Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. PhD thesis, MIT (1974)
42. Taşiran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying abstractions of timed systems. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.1119, pp. 546-562. Springer, Heidelberg (1996)