메뉴 건너뛰기




Volumn 4, Issue 1, 2006, Pages 39-49

Model checking propositional dynamic logic with all extras

Author keywords

Complexity; Model checking; Propositional Dynamic Logic

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

EID: 27944432650     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.08.002     Document Type: Article
Times cited : (68)

References (32)
  • 4
    • 0018454915 scopus 로고
    • Propositional dynamic logic of regular programs
    • M.J. Fischer, and R.E. Ladner Propositional dynamic logic of regular programs J. Comput. System Sci. 18 2 1979 194 211
    • (1979) J. Comput. System Sci. , vol.18 , Issue.2 , pp. 194-211
    • Fischer, M.J.1    Ladner, R.E.2
  • 5
    • 0022704337 scopus 로고
    • Automata-theoretic techniques for modal logic of programs
    • M.Y. Vardi, and P. Wolper Automata-theoretic techniques for modal logic of programs J. Comput. System Sci. 32 1986 183 221
    • (1986) J. Comput. System Sci. , vol.32 , pp. 183-221
    • Vardi, M.Y.1    Wolper, P.2
  • 7
    • 0034506715 scopus 로고    scopus 로고
    • A dynamic logic for acting, sensing, and planning
    • L. Spalazzi, and P. Traverso A dynamic logic for acting, sensing, and planning J. Logic Comput. 10 6 2000 787 821
    • (2000) J. Logic Comput. , vol.10 , Issue.6 , pp. 787-821
    • Spalazzi, L.1    Traverso, P.2
  • 13
    • 0002115005 scopus 로고
    • Recurring dominoes: Making the highly undecidable highly understandable
    • D. Harel Recurring dominoes: Making the highly undecidable highly understandable Ann. Discrete Math. 24 1985 51 72
    • (1985) Ann. Discrete Math. , vol.24 , pp. 51-72
    • Harel, D.1
  • 14
    • 0001218913 scopus 로고
    • Propositional dynamic logic of nonregular programs
    • D. Harel, A. Pnueli, and J. Stavi Propositional dynamic logic of nonregular programs J. Comput. System Sci. 26 2 1983 222 243
    • (1983) J. Comput. System Sci. , vol.26 , Issue.2 , pp. 222-243
    • Harel, D.1    Pnueli, A.2    Stavi, J.3
  • 16
    • 0000690591 scopus 로고
    • Propositional dynamic logic of looping and converse is elementarily decidable
    • R.S. Streett Propositional dynamic logic of looping and converse is elementarily decidable Inform. Control 54 1/2 1982 121 141
    • (1982) Inform. Control , vol.54 , Issue.12 , pp. 121-141
    • Streett, R.S.1
  • 17
    • 84947711462 scopus 로고
    • The taming of converse: Reasoning about two-way computations
    • Proc. Workshop on Logic of Programs, Brooklyn, NY, R. Parikh Springer Berlin
    • M.Y. Vardi The taming of converse: Reasoning about two-way computations R. Parikh Proc. Workshop on Logic of Programs, Brooklyn, NY Lecture Notes in Comput. Sci. vol. 193 1985 Springer Berlin 413 424
    • (1985) Lecture Notes in Comput. Sci. , vol.193 , pp. 413-424
    • Vardi, M.Y.1
  • 18
    • 85009899542 scopus 로고
    • Nondeterministic propositional dynamic logic with intersection is decidable
    • Proc. 5th Symp. on Computation Theory, Zaborów, Poland, A. Skowron Springer Berlin
    • S. Danecki Nondeterministic propositional dynamic logic with intersection is decidable A. Skowron Proc. 5th Symp. on Computation Theory, Zaborów, Poland Lecture Notes in Comput. Sci. vol. 208 1984 Springer Berlin 34 53
    • (1984) Lecture Notes in Comput. Sci. , vol.208 , pp. 34-53
    • Danecki, S.1
  • 19
    • 26944469474 scopus 로고    scopus 로고
    • A lower complexity bound for propositional dynamic logic with intersection
    • R.A. Schmidt I. Pratt-Hartmann M. Reynolds H. Wansing King's College Publications
    • M. Lange A lower complexity bound for propositional dynamic logic with intersection R.A. Schmidt I. Pratt-Hartmann M. Reynolds H. Wansing Advances in Modal Logic vol. 5 2005 King's College Publications
    • (2005) Advances in Modal Logic , vol.5
    • Lange, M.1
  • 20
    • 27944485229 scopus 로고    scopus 로고
    • Model checking for contextual reasoning in NLG
    • P. Blackburn, M. Kohlhase (Eds.)
    • K. Striegnitz, Model checking for contextual reasoning in NLG, in: P. Blackburn, M. Kohlhase (Eds.), Proc. of Inference in Computational Semantics, ICoS-3, 2001, pp. 101-115
    • (2001) Proc. of Inference in Computational Semantics, ICoS-3 , pp. 101-115
    • Striegnitz, K.1
  • 22
    • 84893544909 scopus 로고    scopus 로고
    • Model checking knowledge and time
    • Proc. 9th Int. SPIN Workshop on Model Checking of Software, SPIN'02, D. Bosnacki S. Leue Springer Berlin
    • W. van der Hoek, and M. Wooldridge Model checking knowledge and time D. Bosnacki S. Leue Proc. 9th Int. SPIN Workshop on Model Checking of Software, SPIN'02 Lecture Notes in Comput. Sci. vol. 2318 2002 Springer Berlin 95 111
    • (2002) Lecture Notes in Comput. Sci. , vol.2318 , pp. 95-111
    • Van Der Hoek, W.1    Wooldridge, M.2
  • 23
    • 0037560142 scopus 로고    scopus 로고
    • Verifying epistemic properties of multi-agent systems via bounded model checking
    • W. Penczek, and A. Lomuscio Verifying epistemic properties of multi-agent systems via bounded model checking Fundamenta Informatica 55 2 2003 167 185
    • (2003) Fundamenta Informatica , vol.55 , Issue.2 , pp. 167-185
    • Penczek, W.1    Lomuscio, A.2
  • 25
    • 34250487811 scopus 로고
    • Gaussian elimination is not optimal
    • V. Strassen Gaussian elimination is not optimal Numer. Math. 13 1969 354 356
    • (1969) Numer. Math. , vol.13 , pp. 354-356
    • Strassen, V.1
  • 26
    • 84945708259 scopus 로고
    • A theorem on boolean matrices
    • S. Warshall A theorem on boolean matrices J. ACM 9 1 1962 11 12
    • (1962) J. ACM , vol.9 , Issue.1 , pp. 11-12
    • Warshall, S.1
  • 27
    • 84972541021 scopus 로고
    • A lattice-theoretical fixpoint theorem and its application
    • A. Tarski A lattice-theoretical fixpoint theorem and its application Pacific J. Math. 5 1955 285 309
    • (1955) Pacific J. Math. , vol.5 , pp. 285-309
    • Tarski, A.1
  • 29
    • 84945707998 scopus 로고
    • A new normal form theorem for context-free phrase structure grammars
    • S.A. Greibach A new normal form theorem for context-free phrase structure grammars J. ACM 12 1 1965 42 52
    • (1965) J. ACM , vol.12 , Issue.1 , pp. 42-52
    • Greibach, S.A.1
  • 30
    • 0027115181 scopus 로고
    • A characterization of exponential-time languages by alternating context-free grammars
    • O.H. Ibarra, T. Jiang, and H. Wang A characterization of exponential-time languages by alternating context-free grammars TCS 99 2 1992 301 315
    • (1992) TCS , vol.99 , Issue.2 , pp. 301-315
    • Ibarra, O.H.1    Jiang, T.2    Wang, H.3
  • 31
  • 32
    • 0030181632 scopus 로고    scopus 로고
    • The complexity of PDL with interleaving
    • A.J. Mayer, and L.J. Stockmeyer The complexity of PDL with interleaving TCS 161 1-2 1996 109 122
    • (1996) TCS , vol.161 , Issue.1-2 , pp. 109-122
    • Mayer, A.J.1    Stockmeyer, L.J.2


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