메뉴 건너뛰기




Volumn 3921 LNCS, Issue , 2006, Pages 217-230

On metric temporal logic and faulty turing machines

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; REAL TIME SYSTEMS; TURING MACHINES;

EID: 33745788757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_15     Document Type: Conference Paper
Times cited : (80)

References (24)
  • 1
    • 0002811217 scopus 로고    scopus 로고
    • Undecidable verification problems with unreliable channels
    • P. Abdulla and B. Jonsson. Undecidable verification problems with unreliable channels. Inf. Comput., 130:71-90, 1996.
    • (1996) Inf. Comput. , vol.130 , pp. 71-90
    • Abdulla, P.1    Jonsson, B.2
  • 2
    • 26644455517 scopus 로고    scopus 로고
    • Decidability and complexity results for timed automata via channel machines
    • Proc. ICALP
    • P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In Proc. ICALP, volume 3580 of Springer LNCS, 2005.
    • (2005) Springer LNCS , vol.3580
    • Abdulla, P.A.1    Deneux, J.2    Ouaknine, J.3    Worrell, J.4
  • 3
    • 0028413052 scopus 로고
    • A theory of timed automata
    • R. Alur and D. Dill. A theory of timed automata. Theor. Comput. Sci., 126: 183-235, 1994.
    • (1994) Theor. Comput. Sci. , vol.126 , pp. 183-235
    • Alur, R.1    Dill, D.2
  • 4
    • 0029708178 scopus 로고    scopus 로고
    • The benefits of relaxing punctuality
    • R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. J. ACM, 43:116-146, 1996.
    • (1996) J. ACM , vol.43 , pp. 116-146
    • Alur, R.1    Feder, T.2    Henzinger, T.A.3
  • 5
    • 51549096502 scopus 로고
    • Logics and models of real time: A survey
    • Proc. RTTP
    • R. Alur and T. A. Henzinger. Logics and models of real time: A survey. In Proc. RTTP, volume 600 of Springer LNCS, 1992.
    • (1992) Springer LNCS , vol.600
    • Alur, R.1    Henzinger, T.A.2
  • 6
    • 43949167687 scopus 로고
    • Real-time logics: Complexity and expressiveness
    • R. Alur and T. A. Henzinger. Real-time logics: Complexity and expressiveness. Inf. Comput., 104:35-77, 1993.
    • (1993) Inf. Comput. , vol.104 , pp. 35-77
    • Alur, R.1    Henzinger, T.A.2
  • 7
    • 0028202370 scopus 로고
    • A really temporal logic
    • R. Alur and T. A. Henzinger. A really temporal logic. J. ACM, 41:181-204, 1994.
    • (1994) J. ACM , vol.41 , pp. 181-204
    • Alur, R.1    Henzinger, T.A.2
  • 8
    • 0020735797 scopus 로고
    • On communicating finite-state machines
    • D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323-342, 1983.
    • (1983) J. ACM , vol.30 , Issue.2 , pp. 323-342
    • Brand, D.1    Zafiropulo, P.2
  • 9
    • 13544268666 scopus 로고    scopus 로고
    • Unreliable channels are easier to verify than perfect channels
    • G. Cécé, A. Finkel, and S. P. Iyer. Unreliable channels are easier to verify than perfect channels. Inf. Comput., 124:20-31, 1996.
    • (1996) Inf. Comput. , vol.124 , pp. 20-31
    • Cécé, G.1    Finkel, A.2    Iyer, S.P.3
  • 10
    • 0034911369 scopus 로고    scopus 로고
    • Well-structured transition systems everywhere!
    • A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63-92, 2001.
    • (2001) Theor. Comput. Sci. , vol.256 , Issue.1-2 , pp. 63-92
    • Finkel, A.1    Schnoebelen, P.2
  • 12
    • 84945905717 scopus 로고    scopus 로고
    • It's about time: Real-time logics reviewed
    • Proc. CONCUR
    • T. A. Henzinger. It's about time: Real-time logics reviewed. In Proc. CONCUR, volume 1466 of Springer LNCS, 1998.
    • (1998) Springer LNCS , vol.1466
    • Henzinger, T.A.1
  • 13
    • 84957102718 scopus 로고
    • What good are digital clocks?
    • Proc. ICALP
    • T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. ICALP, volume 623 of Springer LNCS, 1992.
    • (1992) Springer LNCS , vol.623
    • Henzinger, T.A.1    Manna, Z.2    Pnueli, A.3
  • 15
    • 4644225156 scopus 로고    scopus 로고
    • Logics for real time: Decidability and complexity
    • Y. Hirshfeld and A. Rabinovich. 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.2
  • 16
    • 0001601021 scopus 로고
    • Specifying real-time properties with metric temporal logic
    • R. Koymans. 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
  • 17
  • 18
    • 24644477667 scopus 로고    scopus 로고
    • Alternating timed automata
    • Proc. FOSSACS
    • S. Lasota and I. Walukiewicz. Alternating timed automata. In Proc. FOSSACS, volume 3441 of Springer LNCS, 2005.
    • (2005) Springer LNCS , vol.3441
    • Lasota, S.1    Walukiewicz, I.2
  • 19
    • 26644461627 scopus 로고    scopus 로고
    • On the decidability of metric temporal logic
    • IEEE Press
    • J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In Proc. LICS. IEEE Press, 2005.
    • (2005) Proc. LICS
    • Ouaknine, J.1    Worrell, J.2
  • 21
    • 35048822458 scopus 로고    scopus 로고
    • State-clock logic: A decidable real-time logic
    • Proc. HART
    • J.-F. Raskin and P.-Y. Schobbens. State-clock logic: A decidable real-time logic. In Proc. HART, volume 1201 of Springer LNCS, 1997.
    • (1997) Springer LNCS , vol.1201
    • Raskin, J.-F.1    Schobbens, P.-Y.2
  • 23
    • 0037105927 scopus 로고    scopus 로고
    • Verifying lossy channel systems has nonprimitive recursive complexity
    • P. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett., 83(5):251-261, 2002.
    • (2002) Inf. Process. Lett. , vol.83 , Issue.5 , pp. 251-261
    • Schnoebelen, P.1
  • 24
    • 85005984698 scopus 로고
    • Specifying timed state sequences in powerful decidable logics and timed automata
    • Proc. FTRTFTS
    • T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proc. FTRTFTS, volume 863 of Springer LNCS, 1994.
    • (1994) Springer LNCS , vol.863
    • Wilke, T.1


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