메뉴 건너뛰기




Volumn 4260 LNCS, Issue , 2006, Pages 757-775

SALT - Structured assertion language for temporal logic

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; FORMAL LOGIC; PROGRAM COMPILERS; REAL TIME SYSTEMS; SEMANTICS; SYNTACTICS;

EID: 33845265297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901433_41     Document Type: Article
Times cited : (34)

References (25)
  • 12
    • 84891330880 scopus 로고    scopus 로고
    • IEEE 1850 PSL: The next generation
    • [FMW05]
    • [FMW05] Harry Foster, Erisch Marschner, and Yaron Wolfsthal. IEEE 1850 PSL: The next generation. In DVCon, 2005.
    • (2005) DVCon
    • Foster, H.1    Marschner, E.2    Wolfsthal, Y.3
  • 13
    • 35248850820 scopus 로고    scopus 로고
    • Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata
    • [Fri03]. In Oscar H. Ibarra and Zhe Dang, editors, Implementation and Application of Automata. Eighth International Conference (CIAA), Santa Barbara, CA, USA
    • [Fri03] Garsten Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In Oscar H. Ibarra and Zhe Dang, editors, Implementation and Application of Automata. Eighth International Conference (CIAA), volume 2759 of Lecture Notes in Computer Science, pages 35-48, Santa Barbara, CA, USA, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2759 , pp. 35-48
    • Fritz, G.1
  • 20
    • 21144457914 scopus 로고    scopus 로고
    • Temporal logic with past is exponentially more succinct, concurrency column
    • [Mar03]
    • [Mar03] Nicolas Markey. Temporal logic with past is exponentially more succinct, concurrency column. Bulletin of the EATCS, 79:122-128, 2003.
    • (2003) Bulletin of the EATCS , vol.79 , pp. 122-128
    • Markey, N.1
  • 24
    • 35048822458 scopus 로고    scopus 로고
    • State clock logic: A decidable real-time logic
    • [RS97]. In Oded Maler, editor, HART, Springer
    • [RS97] Jean-François Raskin and Pierre-Yves Schobbens. State clock logic: A decidable real-time logic. In Oded Maler, editor, HART, volume 1201 of Lecture Notes in Computer Science, pages 33-47. Springer, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1201 , pp. 33-47
    • Raskin, J.-F.1    Schobbens, P.-Y.2
  • 25
    • 26844554917 scopus 로고    scopus 로고
    • From PSL to LTL: A formal validation in HOL
    • [TS05], Lecture Notes in Computer Science, Oxford, UK, Springer
    • [TS05] T. Tuerk and K. Schneider. From PSL to LTL: A formal validation in HOL. In Theorem Proving in Higher Order Logic (TPHOL), Lecture Notes in Computer Science, Oxford, UK, 2005. Springer.
    • (2005) Theorem Proving in Higher Order Logic (TPHOL)
    • Tuerk, T.1    Schneider, K.2


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