메뉴 건너뛰기




Volumn 299, Issue 1-3, 2003, Pages 413-438

Presburger liveness verification of discrete timed automata

Author keywords

Liveness; Model checking; Temporal logic; Timed automata

Indexed keywords

COMPUTABILITY AND DECIDABILITY; PROBLEM SOLVING; REAL TIME SYSTEMS;

EID: 0037453353     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00485-1     Document Type: Article
Times cited : (13)

References (26)
  • 1
    • 84957072296 scopus 로고    scopus 로고
    • Timed automata
    • CAV'99, Berlin: Springer
    • Alur R. Timed automata. CAV'99. Lecture Notes in Computer Science. Vol. 1633:1999;8-22 Springer, Berlin.
    • (1999) Lecture Notes in Computer Science , vol.1633 , pp. 8-22
    • Alur, R.1
  • 3
    • 0028413052 scopus 로고
    • A theory of timed automata
    • Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126(2):1994;183-236.
    • (1994) Theoret. Comput. Sci. , vol.126 , Issue.2 , pp. 183-236
    • Alur, R.1    Dill, D.2
  • 4
    • 0029708178 scopus 로고    scopus 로고
    • The benefits of relaxing punctuality
    • Alur R., Feder T., Henzinger T.A. The benefits of relaxing punctuality. J. ACM. 43(1):1996;116-146.
    • (1996) J. ACM , vol.43 , Issue.1 , pp. 116-146
    • Alur, R.1    Feder, T.2    Henzinger, T.A.3
  • 5
    • 43949167687 scopus 로고
    • Real-time logics: Complexity and expressiveness
    • Alur R., Henzinger T.A. Real-time logics. complexity and expressiveness Inform. Comput. 104(1):1993;35-77.
    • (1993) Inform. Comput. , vol.104 , Issue.1 , pp. 35-77
    • Alur, R.1    Henzinger, T.A.2
  • 6
    • 0028202370 scopus 로고
    • A really temporal logic
    • Alur R., Henzinger T.A. A really temporal logic. J. ACM. 41(1):1994;181-204.
    • (1994) J. ACM , vol.41 , Issue.1 , pp. 181-204
    • Alur, R.1    Henzinger, T.A.2
  • 7
    • 0031376266 scopus 로고    scopus 로고
    • On-the-fly symbolic model-checking for real-time systems
    • Silver Spring, MD: IEEE Computer Society Press
    • Bouajjani A., Tripakis S., Yovine S. On-the-fly symbolic model-checking for real-time systems. Proc. 18th Real Time Systems Symposium (RTSS'97). 1997;25-35 IEEE Computer Society Press, Silver Spring, MD.
    • (1997) Proc. 18th Real Time Systems Symposium (RTSS'97) , pp. 25-35
    • Bouajjani, A.1    Tripakis, S.2    Yovine, S.3
  • 9
    • 0001050087 scopus 로고    scopus 로고
    • Flatness is not a weakness
    • CSL'00, Berlin: Springer
    • Comon H., Cortier V. Flatness is not a weakness. CSL'00. Lecture Notes in Computer Science. Vol. 1862:2000;262-276 Springer, Berlin.
    • (2000) Lecture Notes in Computer Science , vol.1862 , pp. 262-276
    • Comon, H.1    Cortier, V.2
  • 10
    • 84888234004 scopus 로고    scopus 로고
    • Timed automata and the theory of real numbers
    • CONCUR'99, Berlin: Springer
    • Comon H., Jurski Y. Timed automata and the theory of real numbers. CONCUR'99. Lecture Notes in Computer Science. Vol. 1664:1999;242-257 Springer, Berlin.
    • (1999) Lecture Notes in Computer Science , vol.1664 , pp. 242-257
    • Comon, H.1    Jurski, Y.2
  • 11
    • 84958754258 scopus 로고    scopus 로고
    • Binary reachability analysis of pushdown timed automata with dense clocks
    • CAV'01, Berlin: Springer
    • Dang Z. Binary reachability analysis of pushdown timed automata with dense clocks. CAV'01. Lecture Notes in Computer Science. Vol. 2102:2001;506-517 Springer, Berlin.
    • (2001) Lecture Notes in Computer Science , vol.2102 , pp. 506-517
    • Dang, Z.1
  • 12
    • 84944408189 scopus 로고    scopus 로고
    • Binary reachability analysis of discrete pushdown timed automata
    • CAV'00, Berlin: Springer
    • Dang Z., Ibarra O.H., Bultan T., Kemmerer R.A., Su J. Binary reachability analysis of discrete pushdown timed automata. CAV'00. Lecture Notes in Computer Science. Vol. 1855:2000;69-84 Springer, Berlin.
    • (2000) Lecture Notes in Computer Science , vol.1855 , pp. 69-84
    • Dang, Z.1    Ibarra, O.H.2    Bultan, T.3    Kemmerer, R.A.4    Su, J.5
  • 13
    • 0003179891 scopus 로고    scopus 로고
    • On Presburger liveness of discrete timed automata
    • STACS'01, Berlin: Springer
    • Dang Z., San Pietro P., Kemmerer R.A. On Presburger liveness of discrete timed automata. STACS'01. Lecture Notes in Computer Science. Vol. 2010:2001;132-143 Springer, Berlin.
    • (2001) Lecture Notes in Computer Science , vol.2010 , pp. 132-143
    • Dang, Z.1    San Pietro, P.2    Kemmerer, R.A.3
  • 15
    • 84872460286 scopus 로고
    • The generalized railroad crossing: A case study in formal verification of real-time systems
    • Silver Spring, MD: IEEE Computer Society Press
    • Heitmeyer C., Lynch N. The generalized railroad crossing. a case study in formal verification of real-time systems Proc. 15th Real-time Systems Symposium (RTSS'94). 1994;120-131 IEEE Computer Society Press, Silver Spring, MD.
    • (1994) Proc. 15th Real-time Systems Symposium (RTSS'94) , pp. 120-131
    • Heitmeyer, C.1    Lynch, N.2
  • 18
    • 0041664310 scopus 로고
    • HyTech: The Cornell hybrid technology tool
    • Hybrid Systems II, Berlin: Springer
    • Henzinger T.A. Pei-Hsin Ho, HyTech: the Cornell hybrid technology tool. Hybrid Systems II. Lecture Notes in Computer Science. Vol. 999:1995;265-294 Springer, Berlin.
    • (1995) Lecture Notes in Computer Science , vol.999 , pp. 265-294
    • Henzinger, T.A.1    Ho, P.-H.2
  • 19
    • 84976713661 scopus 로고
    • Reversal-bounded multicounter machines and their decision problems
    • Ibarra O.H. Reversal-bounded multicounter machines and their decision problems. J. ACM. 25(1):1978;116-133.
    • (1978) J. ACM , vol.25 , Issue.1 , pp. 116-133
    • Ibarra, O.H.1
  • 22
    • 35048822458 scopus 로고    scopus 로고
    • State clock logic: A decidable real-time logic
    • HART'97, Berlin: Springer
    • Raskin J., Schobben P. State clock logic. a decidable real-time logic HART'97. Lecture Notes in Computer Science. Vol. 1201:1997;33-47 Springer, Berlin.
    • (1997) Lecture Notes in Computer Science , vol.1201 , pp. 33-47
    • Raskin, J.1    Schobben, P.2
  • 23
    • 85012920204 scopus 로고
    • The complexity of almost linear Diophantine problems
    • Weispfenning V. The complexity of almost linear Diophantine problems. J. Symb. Comp. 10(5):1990;395-403.
    • (1990) J. Symb. Comp. , vol.10 , Issue.5 , pp. 395-403
    • Weispfenning, V.1
  • 24
    • 85005984698 scopus 로고
    • Specifying timed state sequences in powerful decidable logics and timed automata
    • Springer, Berlin
    • T. Wilke, Specifying timed state sequences in powerful decidable logics and timed automata, Lecture Notes in Computer Science, Vol. 863, Springer, Berlin, 1994, pp. 694-715.
    • (1994) Lecture Notes in Computer Science , vol.863 , pp. 694-715
    • Wilke, T.1
  • 25
    • 84896693998 scopus 로고    scopus 로고
    • Kronos: A verification tool for real-time systems
    • Yovine S. Kronos. a verification tool for real-time systems Internat. J. Software Tools Technol. Transfer. 1(1-2):1997;123-133.
    • (1997) Internat. J. Software Tools Technol. Transfer , vol.1 , Issue.1-2 , pp. 123-133
    • Yovine, S.1
  • 26
    • 84958967825 scopus 로고    scopus 로고
    • Model checking timed automata
    • Embedded Systems, Berlin: Springer
    • Yovine S. Model checking timed automata. Embedded Systems. Lecture Notes in Computer Science. Vol. 1494:1998;114-152 Springer, Berlin.
    • (1998) Lecture Notes in Computer Science , vol.1494 , pp. 114-152
    • Yovine, S.1


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