메뉴 건너뛰기




Volumn 11, Issue , 2004, Pages 133-139

On-the-fly automata construction for dynamic linear time temporal logic

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; FORMAL LOGIC; MAPPING; MULTI AGENT SYSTEMS;

EID: 5644243255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/time.2004.1314430     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 1
    • 35048902648 scopus 로고    scopus 로고
    • Improved automata generation for linear temporal logic
    • Springer LNCS vol. July
    • M. Daniele, F. Giunchiglia and M.Y. Vardi. Improved automata generation for linear temporal logic. In Proc. 11th CAV, Springer LNCS vol. 1633, pp. 249-260, July 1999.
    • (1999) Proc. 11th CAV , vol.1633 , pp. 249-260
    • Daniele, M.1    Giunchiglia, F.2    Vardi, M.Y.3
  • 3
    • 2942636432 scopus 로고    scopus 로고
    • Reasoning about actions in dynamic linear time temporal logic
    • L.Giordano, A.Martelli, and C.Schwind. Reasoning about actions in dynamic linear time temporal logic. Logic Journal of the IGPL, 9(2):289-303, 2001.
    • (2001) Logic Journal of the IGPL , vol.9 , Issue.2 , pp. 289-303
    • Giordano, L.1    Martelli, A.2    Schwind, C.3
  • 4
    • 7444250642 scopus 로고    scopus 로고
    • Specifying and verifying systems of communicating agents in a temporal action logic
    • Pisa, Springer LNCS vol. September
    • L. Giordano, A. Martelli, and C. Schwind. Specifying and Verifying Systems of Communicating Agents in a Temporal Action Logic. In Proc. AI*IA'03, Pisa, Springer LNCS vol. 2829, pp. 262-274, September 2003.
    • (2003) Proc. AI*IA'03 , vol.2829 , pp. 262-274
    • Giordano, L.1    Martelli, A.2    Schwind, C.3
  • 5
    • 5644278259 scopus 로고    scopus 로고
    • A product version of dynamic linear time temporal logic
    • J.G. Henriksen and P.S. Thiagarajan. A Product Version of Dynamic Linear Time Temporal Logic. In CONCUR'97, 1997.
    • (1997) CONCUR'97
    • Henriksen, J.G.1    Thiagarajan, P.S.2
  • 7
    • 84949673542 scopus 로고    scopus 로고
    • Translating regular expressions into small ε-free nondeterministic finite automata
    • Springer LNCS vol
    • J. Hromkovic, S. Seibert and T. Wilke. Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata. In Proc. STACS'97, Springer LNCS vol. 1200, pp. 55-66, 1997.
    • (1997) Proc. STACS'97 , vol.1200 , pp. 55-66
    • Hromkovic, J.1    Seibert, S.2    Wilke, T.3
  • 8
    • 84944388557 scopus 로고    scopus 로고
    • Efficient Büchi automata from LTL formulae
    • Springer LNCS vol
    • F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Proc. 12th CAV, Springer LNCS vol. 1855, pp. 247-263, 2000.
    • (2000) Proc. 12th CAV , vol.1855 , pp. 247-263
    • Somenzi, F.1    Bloem, R.2
  • 9
    • 0001909357 scopus 로고
    • Reasoning about infinite computations
    • M. Vardi and P. Wolper. Reasoning about infinite computations. In Information and Computation 115, 1-37 (1994).
    • (1994) Information and Computation , vol.115 , Issue.1-37
    • Vardi, M.1    Wolper, P.2
  • 10
    • 0020496645 scopus 로고
    • Temporal logic can be more expressive
    • P. Wolper. Temporal logic can be more expressive. In Information and Control 56, 72-99 (1983).
    • (1983) Information and Control , vol.56 , pp. 72-99
    • Wolper, P.1
  • 11
    • 84944313340 scopus 로고    scopus 로고
    • Constructing automata from temporal logic formulas: A tutorial
    • Springer LNCS vol. July
    • P. Wolper. Constructing Automata from Temporal Logic Formulas: A Tutorial. In Proc. FMPA 2000, Springer LNCS vol. 2090, pp. 261-277, July 2000.
    • (2000) Proc. FMPA 2000 , vol.2090 , pp. 261-277
    • Wolper, P.1


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