메뉴 건너뛰기




Volumn 63, Issue 2-3, 2004, Pages 221-240

From bounded to unbounded model checking for temporal epistemic logic

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MULTI AGENT SYSTEMS; PROBLEM SOLVING;

EID: 24044475901     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (26)

References (19)
  • 5
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-397, 1962.
    • (1962) Journal of the ACM , vol.5 , Issue.7 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 6
    • 84949208566 scopus 로고
    • Characterizing correctness properties of parallel programs using fixpoints
    • Proc. of the 7th Int. Colloquium on Automata, Languages and Programming (ICALP'80). Springer-Verlag
    • E. A. Emerson and E. M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. of the 7th Int. Colloquium on Automata, Languages and Programming (ICALP'80), volume 85 of LNCS, pages 169-181. Springer-Verlag, 1980.
    • (1980) LNCS , vol.85 , pp. 169-181
    • Emerson, E.A.1    Clarke, E.M.2
  • 7
    • 0020226119 scopus 로고
    • Using branching-time temporal logic to synthesize synchronization skeletons
    • E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.
    • (1982) Science of Computer Programming , vol.2 , Issue.3 , pp. 241-266
    • Emerson, E.A.1    Clarke, E.M.2
  • 9
    • 7044238426 scopus 로고    scopus 로고
    • Bounded model checking for interpreted systems: Preliminary experimental results
    • Proc. of the 2nd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS'02). Springer-Verlag
    • A. Lomuscio, T. Łasica, and W. Penczek. Bounded model checking for interpreted systems: Preliminary experimental results. In Proc. of the 2nd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS'02), volume 2699 of LNAI, pages 115-125. Springer-Verlag, 2003.
    • (2003) LNAI , vol.2699 , pp. 115-125
    • Lomuscio, A.1    ŁAsica, T.2    Penczek, W.3
  • 12
    • 70350777567 scopus 로고    scopus 로고
    • Applying SAT methods in unbounded symbolic model checking
    • Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02). Springer-Verlag
    • K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250-264. Springer-Verlag, 2002.
    • (2002) LNCS , vol.2404 , pp. 250-264
    • McMillan, K.L.1
  • 13
    • 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 Informaticae, 55(2): 167-185, 2003.
    • (2003) Fundamenta Informaticae , vol.55 , Issue.2 , pp. 167-185
    • Penczek, W.1    Lomuscio, A.2
  • 14
    • 0036600797 scopus 로고    scopus 로고
    • Bounded model checking for the universal fragment of CTL
    • W. Penczek, B. Woźna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51(1-2): 135-156, 2002.
    • (2002) Fundamenta Informaticae , vol.51 , Issue.1-2 , pp. 135-156
    • Penczek, W.1    Woźna, B.2    Zbrzezny, A.3
  • 15
    • 84972541021 scopus 로고
    • A lattice-theoretical fixpoint theorem and its applications
    • A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
    • (1955) Pacific Journal of Mathematics , vol.5 , pp. 285-309
    • Tarski, A.1
  • 16
    • 84893544909 scopus 로고    scopus 로고
    • Model checking knowledge and time
    • Proc. of the 9th Int. SPIN Workshop (SPIN'02). Springer-Verlag
    • W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In Proc. of the 9th Int. SPIN Workshop (SPIN'02), volume 2318 at LNCS, pages 95-111. Springer-Verlag, 2002.
    • (2002) LNCS , vol.2318 , pp. 95-111
    • Van Der Hoek, W.1    Wooldridge, M.2
  • 18
    • 84958768940 scopus 로고    scopus 로고
    • Model checking knowledge and time in systems with perfect recall
    • Proc. of the 19th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'99). Springer-Verlag
    • R. van der Meyden and H. Shilov. Model checking knowledge and time in systems with perfect recall. In Proc. of the 19th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'99), volume 1738 of LNCS, pages 432-445. Springer-Verlag, 1999.
    • (1999) LNCS , vol.1738 , pp. 432-445
    • Van Der Meyden, R.1    Shilov, H.2


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