메뉴 건너뛰기




Volumn 4144 LNCS, Issue , 2006, Pages 263-277

Allen linear (interval) temporal logic - Translation to LTL and monitor synthesis

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; PROGRAM TRANSLATORS; SEQUENTIAL MACHINES;

EID: 33749822024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_25     Document Type: Conference Paper
Times cited : (34)

References (12)
  • 1
    • 0021466185 scopus 로고
    • Towards a general theory of actions and time
    • J. Allen. Towards a general theory of actions and time. Artificial Intelligence, 23(2):123-154, 1984.
    • (1984) Artificial Intelligence , vol.23 , Issue.2 , pp. 123-154
    • Allen, J.1
  • 2
    • 0043027541 scopus 로고    scopus 로고
    • Reasoning about actions and planning in LTL action theories
    • D. Calvanese, G. De Giacomo, and M. Y. Vardi. Reasoning about actions and planning in LTL action theories. In KR, pages 593-602, 2002.
    • (2002) KR , pp. 593-602
    • Calvanese, D.1    De Giacomo, G.2    Vardi, M.Y.3
  • 3
    • 26444539487 scopus 로고    scopus 로고
    • Efficient monitoring of omega-languages
    • CAV'05 Springer, July
    • M, D'Amorim and G. Roşu. Efficient monitoring of omega-languages. In CAV'05, volume 3576 of LNCS, pages 364-378. Springer, July 2005.
    • (2005) LNCS , vol.3576 , pp. 364-378
    • D'Amorim, M.1    Roşu, G.2
  • 4
    • 0001811026 scopus 로고
    • Managing efficiently temporal relations through indexed spanning trees
    • M. Ghallab and A.M. Alaoui. Managing efficiently temporal relations through indexed spanning trees. In IJCAI, pages 1297-1303, 1989.
    • (1989) IJCAI , pp. 1297-1303
    • Ghallab, M.1    Alaoui, A.M.2
  • 5
    • 4243200419 scopus 로고    scopus 로고
    • Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
    • A.A. Krokhin, P. Jeavons, and P. Jonsson. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. J. ACM, 50(5):591-640, 2003.
    • (2003) J. ACM , vol.50 , Issue.5 , pp. 591-640
    • Krokhin, A.A.1    Jeavons, P.2    Jonsson, P.3
  • 9
    • 33749826685 scopus 로고    scopus 로고
    • Allen linear (interval) temporal logic - Translation to LTL and monitor synthesis
    • University of Illinois at Urbana-Champaign, January
    • G. Roşu and S, Bensalem. Allen linear (interval) temporal logic - translation to LTL and monitor synthesis. Technical Report UIUCDCS-R-2006-2681, University of Illinois at Urbana-Champaign, January 2006.
    • (2006) Technical Report , vol.UIUCDCS-R-2006-2681
    • Roşu, G.1    Bensalem, S.2
  • 10
    • 17444417374 scopus 로고    scopus 로고
    • Rewriting-based techniques for runtime verification
    • G. Roşu and K. Havelund. Rewriting-based techniques for runtime verification, J. of Automated Software Engineering, 12(2):151-197, 2005.
    • (2005) J. of Automated Software Engineering , vol.12 , Issue.2 , pp. 151-197
    • Roşu, G.1    Havelund, K.2
  • 11
    • 0022092438 scopus 로고
    • The complexity of propositional linear temporal logics
    • A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. J. ACM, 32(3):733-749, 1985.
    • (1985) J. ACM , vol.32 , Issue.3 , pp. 733-749
    • Sistla, A.P.1    Clarke, E.M.2


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