메뉴 건너뛰기




Volumn 5215 LNCS, Issue , 2008, Pages 1-13

Some recent results in metric temporal logic

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; FORMAL LOGIC; INFORMATION THEORY; LINEARIZATION; MODEL CHECKING; POLYNOMIAL APPROXIMATION; POLYNOMIALS; REAL TIME SYSTEMS; SURVEYS; TIME SHARING SYSTEMS;

EID: 53049109834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85778-5_1     Document Type: Conference Paper
Times cited : (147)

References (30)
  • 4
    • 51549096502 scopus 로고
    • Logics and models of real time: A survey
    • Proceedings of Real Time: Theory in Practice, Springer, Heidelberg
    • Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Proceedings of Real Time: Theory in Practice. LNCS, vol. 600. Springer, Heidelberg (1992)
    • (1992) LNCS , vol.600
    • Alur, R.1    Henzinger, T.A.2
  • 5
    • 43949167687 scopus 로고
    • Real-time logics: Complexity and expressiveness
    • Alur, R., Henzinger, T.A.: Real-time logics: complexity and expressiveness. Information and Computation 104, 35-77 (1993)
    • (1993) Information and Computation , vol.104 , pp. 35-77
    • Alur, R.1    Henzinger, T.A.2
  • 7
    • 35048817380 scopus 로고    scopus 로고
    • Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, 3185. Springer, Heidelberg (2004)
    • Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185. Springer, Heidelberg (2004)
  • 8
    • 33744900631 scopus 로고    scopus 로고
    • On the Expressiveness of TPTL and MTL
    • Ramanujam, R, Sen, S, eds, FSTTCS 2005, Springer, Heidelberg
    • Bouyer, P., Chevalier, F., Markey, N.: On the Expressiveness of TPTL and MTL. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3821
    • Bouyer, P.1    Chevalier, F.2    Markey, N.3
  • 10
    • 49049111608 scopus 로고    scopus 로고
    • On Expressiveness and Complexity in Real-time Model Checking
    • Proceedings of ICALP, Springer, Heidelberg to appear
    • Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: On Expressiveness and Complexity in Real-time Model Checking. In: Proceedings of ICALP 2008. LNCS. Springer, Heidelberg (to appear, 2008)
    • (2008) LNCS
    • Bouyer, P.1    Markey, N.2    Ouaknine, J.3    Worrell, J.4
  • 12
    • 53049100397 scopus 로고    scopus 로고
    • Comon, H., Cortier, V.: Flatness is not a Weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, 1862. Springer, Heidelberg (2000)
    • Comon, H., Cortier, V.: Flatness is not a Weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862. Springer, Heidelberg (2000)
  • 13
    • 84855204406 scopus 로고    scopus 로고
    • On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
    • Demri, S., Lazić, R., Nowak, D.: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. Information and Computation 205(1), 2-24 (2007)
    • (2007) Information and Computation , vol.205 , Issue.1 , pp. 2-24
    • Demri, S.1    Lazić, R.2    Nowak, D.3
  • 14
    • 0001240170 scopus 로고
    • Sooner is safer than later
    • Henzinger, T.A.: Sooner is safer than later. Processing Letters 43, 135-141 (1992)
    • (1992) Processing Letters , vol.43 , pp. 135-141
    • Henzinger, T.A.1
  • 15
    • 84945905717 scopus 로고    scopus 로고
    • It's about time: Real-time logics reviewed
    • Sangiorgi, D, de Simone, R, eds, CONCUR 1998, Springer, Heidelberg
    • Henzinger, T.A.: It's about time: Real-time logics reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466. Springer, Heidelberg (1998)
    • (1998) LNCS , vol.1466
    • Henzinger, T.A.1
  • 16
    • 84957102718 scopus 로고
    • What good are digital clocks?
    • Kuich, W, ed, ICALP 1992, Springer, Heidelberg
    • Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623. Springer, Heidelberg (1992)
    • (1992) LNCS , vol.623
    • Henzinger, T.A.1    Manna, Z.2    Pnueli, A.3
  • 17
    • 4644225156 scopus 로고    scopus 로고
    • Logics for Real Time: Decidability and Complexity
    • Hirshfeld, Y., Rabinovich, A.M.: Logics for Real Time: Decidability and Complexity. Fundam. Inform. 62(1), 1-28 (2004)
    • (2004) Fundam. Inform , vol.62 , Issue.1 , pp. 1-28
    • Hirshfeld, Y.1    Rabinovich, A.M.2
  • 18
    • 84878576366 scopus 로고    scopus 로고
    • The regular real-time languages
    • Larsen, K.G, Skyum, S, Winskel, G, eds, ICALP 1998, Springer, Heidelberg
    • Henzinger, T.A., Raskin, J.-F., Shobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443. Springer, Heidelberg (1998)
    • (1998) LNCS , vol.1443
    • Henzinger, T.A.1    Raskin, J.-F.2    Shobbens, P.-Y.3
  • 19
  • 21
    • 0001601021 scopus 로고
    • Specifying real-time properties with metric temporal logic
    • Koymans, R.: Specifying real-time properties with metric temporal logic. Real-time Systems 2(4), 255-299 (1990)
    • (1990) Real-time Systems , vol.2 , Issue.4 , pp. 255-299
    • Koymans, R.1
  • 22
    • 24644477667 scopus 로고    scopus 로고
    • Alternating timed automata
    • Sassone, V, ed, FOSSACS 2005, Springer, Heidelberg
    • Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3441
    • Lasota, S.1    Walukiewicz, I.2
  • 23
    • 53049107306 scopus 로고    scopus 로고
    • Ostroff, J.: Temporal logic of real-time systems. Research Studies Press, Taunton 24. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of LICS 2004. IEEE Computer Society Press, Los Alamitos (2004)
    • Ostroff, J.: Temporal logic of real-time systems. Research Studies Press, Taunton 24. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of LICS 2004. IEEE Computer Society Press, Los Alamitos (2004)
  • 24
    • 33745788757 scopus 로고    scopus 로고
    • Metric temporal logic and faulty Turing machines
    • Aceto, L, Ingólfsdóttir, A, eds, FOSSACS 2006, Springer, Heidelberg
    • Ouaknine, J., Worrell, J.: Metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3921
    • Ouaknine, J.1    Worrell, J.2
  • 25
    • 33745777623 scopus 로고    scopus 로고
    • Safety metric temporal logic is fully decidable
    • Hermanns, H, Palsberg, J, eds, TACAS 2006, Springer, Heidelberg
    • Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3920
    • Ouaknine, J.1    Worrell, J.2
  • 26
    • 84987860312 scopus 로고    scopus 로고
    • On the Decidability and Complexity of Metric Temporal Logic over Finite Words. Logicical Methods in Computer
    • Ouaknine, J., Worrell, J.: On the Decidability and Complexity of Metric Temporal Logic over Finite Words. Logicical Methods in Computer Science 3(1) (2007)
    • (2007) Science , vol.3 , Issue.1
    • Ouaknine, J.1    Worrell, J.2
  • 27
    • 85047040703 scopus 로고
    • The temporal logic of programs
    • IEEE Computer Society Press, Los Alamitos
    • Pnueli, A.: The temporal logic of programs. In: Proceedings of FOCS 1977. IEEE Computer Society Press, Los Alamitos (1977)
    • (1977) Proceedings of FOCS
    • Pnueli, A.1
  • 28
    • 35048822458 scopus 로고    scopus 로고
    • Raskin, J.-F., Schobbens, P.-Y.: State-clock logic: a decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, 1201. Springer, Heidelberg (1997)
    • Raskin, J.-F., Schobbens, P.-Y.: State-clock logic: a decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201. Springer, Heidelberg (1997)
  • 29
    • 0037105927 scopus 로고    scopus 로고
    • Verifying lossy channel systems has nonprimitive recursive complexity
    • Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251-261 (2002)
    • (2002) Information Processing Letters , vol.83 , Issue.5 , pp. 251-261
    • Schnoebelen, P.1
  • 30
    • 85005984698 scopus 로고
    • Specifying timed state sequences in powerful decidable logics and timed automata
    • Langmaack, H, de Roever, W.-P, Vytopil, J, eds, FTRTFT 1994 and ProCoS 1994, Springer, Heidelberg
    • Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863. Springer, Heidelberg (1994)
    • (1994) LNCS , vol.863
    • Wilke, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.