메뉴 건너뛰기




Volumn 11, Issue 1, 2005, Pages 69-89

Fully symbolic unbounded model checking for alternating-time temporal logic

Author keywords

Alternating time Temporal Logic; Multi agent systems; SAT based verification; Symbolic model checking; Unbounded model checking

Indexed keywords

ALTERNATING-TIME TEMPORAL LOGIC; SAT-BASED VERFICATION; SYMBOLIC MODEL CHECKING; UNBOUNDED MODEL CHECKING;

EID: 21144451159     PISSN: 13872532     EISSN: 15737454     Source Type: Journal    
DOI: 10.1007/s10458-005-0944-9     Document Type: Article
Times cited : (24)

References (28)
  • 3
    • 84949185739 scopus 로고    scopus 로고
    • Alternating-time temporal logic
    • Proceeding of the International Symposium 'Compositionality: The Significant Difference' (COMPOS'97), Springer-Verlag
    • R. Alur, T. A. Henzinger, and O. Kupferman, "Alternating-time temporal logic", in Proceeding of the International Symposium 'Compositionality: The Significant Difference' (COMPOS'97), Springer-Verlag, vol. 1536 of LNCS, pp. 23-60, 1998.
    • (1998) LNCS , vol.1536 , pp. 23-60
    • Alur, R.1    Henzinger, T.A.2    Kupferman, O.3
  • 4
    • 0042908709 scopus 로고    scopus 로고
    • Alternating-time temporal logic
    • R. Alur, T. A. Henzinger, and O. Kupferman, "Alternating-time temporal logic", J. ACM, vol. 49, no. 5, pp. 672-713, 2002.
    • (2002) J. ACM , vol.49 , Issue.5 , pp. 672-713
    • Alur, R.1    Henzinger, T.A.2    Kupferman, O.3
  • 5
    • 0022706656 scopus 로고
    • Automatic verification of finite stale concurrent systems using temporal logic specifications: A practical approach
    • E. M. Clarke, E. A. Emerson, and A. P. Sistla, "Automatic verification of finite stale concurrent systems using temporal logic specifications: A practical approach", ACM Trans. Program. Lang. Sys., vol. 8, no. 2, pp. 244-263, 1986.
    • (1986) ACM Trans. Program. Lang. Sys. , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 7
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem proving", J. ACM, vol. 5, no, 7, pp. 394-397, 1962.
    • (1962) J. ACM , vol.5 , Issue.7 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 8
    • 21144453887 scopus 로고    scopus 로고
    • Comparing semantics of logics for multi-agent systems
    • V. Goranko and W. Jamroga, "Comparing semantics of logics for multi-agent systems", Synthese/Knowl, Ration. Act., vol. 139, no. 2, pp. 241-280, 2004.
    • (2004) Synthese/Knowl, Ration. Act. , vol.139 , Issue.2 , pp. 241-280
    • Goranko, V.1    Jamroga, W.2
  • 10
    • 4544284829 scopus 로고    scopus 로고
    • Agents that know how to play
    • W. Jamroga and W. van der Hoek, "Agents that know how to play", Fundamenta Informaticae, vol. 63, no. 2-3, pp. 185-219, 2004.
    • (2004) Fundamenta Informaticae , vol.63 , Issue.2-3 , pp. 185-219
    • Jamroga, W.1    Van Der Hoek, W.2
  • 11
    • 26444618229 scopus 로고    scopus 로고
    • Verifying multiagent systems via unbounded model checking
    • M. G. Hinchey, J. L. Rash, W. Truszkowski, and C. Rouff, (eds.), Proceeding of the 3rd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS'04), Springer
    • M. Kacprzak, A. Lomuscio, T. Łasica, W. Penczek, and M. Szreter, "Verifying multiagent systems via unbounded model checking", in M. G. Hinchey, J. L. Rash, W. Truszkowski, and C. Rouff, (eds.), Proceeding of the 3rd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS'04), Springer, vol. 3228 of LNCS, pp. 189-212, 2005.
    • (2005) LNCS , vol.3228 , pp. 189-212
    • Kacprzak, M.1    Lomuscio, A.2    Łasica, T.3    Penczek, W.4    Szreter, M.5
  • 12
    • 4544247406 scopus 로고    scopus 로고
    • Unbounded model checking for knowledge and time
    • ICS PAS, Ordona 21, 01-237 Warsaw, December
    • M. Kacprzak, A. Lomuscio, and W. Penczek, "Unbounded model checking for knowledge and time", Technical Report 966, ICS PAS, Ordona 21, 01-237 Warsaw, December 2003.
    • (2003) Technical Report , vol.966
    • Kacprzak, M.1    Lomuscio, A.2    Penczek, W.3
  • 14
    • 21144435146 scopus 로고    scopus 로고
    • A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
    • M. Kacprzak and W. Penczek, "A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic", Synthese, pp. 203-227, vol. 142, 2004.
    • (2004) Synthese , vol.142 , pp. 203-227
    • Kacprzak, M.1    Penczek, W.2
  • 16
    • 7044238426 scopus 로고    scopus 로고
    • Bounded model checking for interpreted systems: Preliminary experimental results
    • Proceeding 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 Proceeding of the 2nd NASA Workshop on Formal Approaches to Agent-Based Systems (FAABS'02), volume 2699 of LNAI, Springer-Verlag, pp. 115-125, 2003.
    • (2003) LNAI , vol.2699 , pp. 115-125
    • Lomuscio, A.1    Łasica, T.2    Penczek, W.3
  • 17
    • 70350777567 scopus 로고    scopus 로고
    • Applying SAT methods in unbounded symbolic model checking
    • Proceeding of the 14th International Conference on Computer Aided Verification (CAV'02), Springer-Verlag
    • K. L. McMillan, "Applying SAT methods in unbounded symbolic model checking", in Proceeding of the 14th International Conference on Computer Aided Verification (CAV'02), volume 2404 of LNCS, Springer-Verlag, pp. 250-264, 2002.
    • (2002) LNCS , vol.2404 , pp. 250-264
    • McMillan, K.L.1
  • 18
    • 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, vol. 55, no. 2, pp. 167-185, 2003.
    • (2003) Fundamenta Informaticae , vol.55 , Issue.2 , pp. 167-185
    • Penczek, W.1    Lomuscio, A.2
  • 20
    • 18744403444 scopus 로고    scopus 로고
    • A tool for specification and verification of epistemic properties of interpreted systems
    • Proceeding of the International Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'03), Elsevier
    • F. Raimondi and A. Lomuscio, "A tool for specification and verification of epistemic properties of interpreted systems", In Proceeding of the International Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'03), vol. 85(2) of ENTCS, Elsevier, 2003.
    • (2003) ENTCS , vol.85 , Issue.2
    • Raimondi, F.1    Lomuscio, A.2
  • 21
    • 84972541021 scopus 로고
    • A lattice-theoretical fixpoint theorem and its applications
    • A. Tarski, "A lattice-theoretical fixpoint theorem and its applications", Pac. J. Math., vol. 5, pp. 285-309, 1955.
    • (1955) Pac. J. Math. , vol.5 , pp. 285-309
    • Tarski, A.1
  • 22
    • 84893544909 scopus 로고    scopus 로고
    • Model checking knowledge and time
    • Proceeding of the 9th Internation SPIN Workshop (SPIN'02), Springer-Verlag
    • W. van der Hoek and M. Wooldridge, "Model checking knowledge and time", In Proceeding of the 9th Internation SPIN Workshop (SPIN'02), volume 2318 of LNCS, Springer-Verlag, pp. 95-111, 2002.
    • (2002) LNCS , vol.2318 , pp. 95-111
    • Van Der Hoek, W.1    Wooldridge, M.2
  • 24
    • 4544383448 scopus 로고    scopus 로고
    • Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
    • W. van der Hoek and M. Wooldridge, "Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications", Stud. Logica, vol. 75, no. 1, pp. 125-157, 2003.
    • (2003) Stud. Logica , vol.75 , Issue.1 , pp. 125-157
    • Van Der Hoek, W.1    Wooldridge, M.2
  • 25
    • 0042261185 scopus 로고    scopus 로고
    • Model checking cooperation, knowledge, and time - A case study
    • W. van der Hoek and M. Wooldridge, "Model checking cooperation, knowledge, and time - a case study", Res. Econ., vol. 57, no. 3, pp. 235-265, 2003.
    • (2003) Res. Econ. , vol.57 , Issue.3 , pp. 235-265
    • Van Der Hoek, W.1    Wooldridge, M.2
  • 26
    • 84958768940 scopus 로고    scopus 로고
    • Model checking knowledge and time in systems with perfect recall
    • Proceeding of the 19th Conference 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 Proceeding of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'99), vol. 1738 of LNCS, Springer-Verlag, pp. 432-445, 1999.
    • (1999) LNCS , vol.1738 , pp. 432-445
    • Van Der Meyden, R.1    Shilov, H.2
  • 27


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