On expressiveness and complexity in real-time model checking

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

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 124-135

  Bouyer, Patricia ^a,b   Markey, Nicolas ^b   Ouaknine, Joël ^a   Worrell, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

METRIC INTERVAL TEMPORAL LOGIC; MODEL-CHECKING PROBLEMS; REAL-TIME MODELING; REAL-TIME SPECIFICATIONS; TIMING CONSTRAINTS;

CHLORINE COMPOUNDS; COMPUTABILITY AND DECIDABILITY; LINGUISTICS; RECURSIVE FUNCTIONS; SPECIFICATIONS; TEMPORAL LOGIC; TIMING CIRCUITS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 49049111608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_11     Document Type: Conference Paper

References (19)

1. Alur, R., Dill, D.: A theory of timed automata. TCS 126(2), 183-235 (1994)
2. Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. of the ACM43(1), 116-146 (1996)
3. Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Real-Time: Theory in Practice, Proc. REX Workshop 1991. LNCS, vol. 600, pp. 74-106. Springer, Heidelberg (1992)
4. Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. Inf. & Comp. 104(1), 35-77 (1993)
5. Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1-24. Springer, Heidelberg (2004)
6. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: Proc. 22nd Ann. IEEE Symp. Logic in Computer Science (LICS 2007), pp. 109-118. IEEE, Los Alamitos (2007)
7. Comon, H., Cortier, V.: Flatness is not a weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 262-276. Springer, Heidelberg (2000)
8. Demri, S., Lazíc, R., Nowak, D.: On the freeze quantifier in constraint LTL: Decidability and complexity. Inf. & Comp. 205(1), 2-24 (2007)
9. Henzinger, T.A.: It's about time: Real-time logics reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 439-454. Springer, Heidelberg (1998)
10. 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, pp. 580-591. Springer, Heidelberg (1998)
11. Hirshfeld, Y., Rabinovich, A.: Timer formulas and decidable metric temporal logic. Inf. & Comp. 198(2), 148-178 (2005)
12. Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems 2(4), 255-299 (1990)
13. Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Proc. Conference on Logics of Programs. LNCS, vol. 193, pp. 413-424. Springer, Heidelberg (1985)
14. Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics over the reals: PSPACE and below. Inf. & Comp. 205(1), 99-123 (2007)
15. Maler, O., Nickovic, D., Pnueli, A.: From MITL to timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 274-289. Springer, Heidelberg (2006)
16. Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol. 3921, pp. 217-230. Springer, Heidelberg (2006)
17. Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real-Time. PhD thesis, Université de Namur, Belgium (1999)
18. Reynolds, M.: The complexity of the temporal logic over the reals (submitted 2004)
19. Wolper, P.: Constructing automata from temporal logic formulas: A tutorial. In: European Educational Forum: School on Formal Methods and Performance Analysis. LNCS, vol. 2090, pp. 261-277. Springer, Heidelberg (2000)