메뉴 건너뛰기




Volumn 171, Issue 16-17, 2007, Pages 1011-1038

Bounded model checking for knowledge and real time

Author keywords

Interpreted systems; Model checking; Real time systems; Temporal epistemic logics

Indexed keywords

ALGORITHMS; MULTI AGENT SYSTEMS; REAL TIME SYSTEMS;

EID: 35448944801     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2007.05.005     Document Type: Article
Times cited : (37)

References (33)
  • 2
    • 85031771187 scopus 로고
    • Automata for modelling real-time systems
    • Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP'90), Springer-Verlag
    • Alur R., and Dill D. Automata for modelling real-time systems. Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP'90). LNCS vol. 443 (1990), Springer-Verlag 322-335
    • (1990) LNCS , vol.443 , pp. 322-335
    • Alur, R.1    Dill, D.2
  • 3
    • 85120521193 scopus 로고    scopus 로고
    • Bounded model checking for timed systems
    • Proceedings of the 22nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'02), Springer-Verlag
    • Audemard G., Cimatti A., Kornilowicz A., and Sebastiani R. Bounded model checking for timed systems. Proceedings of the 22nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'02). LNCS vol. 2529 (2002), Springer-Verlag 243-259
    • (2002) LNCS , vol.2529 , pp. 243-259
    • Audemard, G.1    Cimatti, A.2    Kornilowicz, A.3    Sebastiani, R.4
  • 4
    • 85165538431 scopus 로고    scopus 로고
    • A. Biere, A. Cimatti, E. Clarke, M. Fujita, Y. Zhu, Symbolic model checking using SAT procedures instead of BDDs, in: Proceedings of the ACM/IEEE Design Automation Conference (DAC'99), 1999, pp. 317-320
  • 7
    • 0031222881 scopus 로고    scopus 로고
    • Application of a logic of knowledge to motion planning under uncertainty
    • Brafman R.I., Latombe J.C., Moses Y., and Shoham Y. Application of a logic of knowledge to motion planning under uncertainty. Journal of the ACM 44 5 (1997) 633-668
    • (1997) Journal of the ACM , vol.44 , Issue.5 , pp. 633-668
    • Brafman, R.I.1    Latombe, J.C.2    Moses, Y.3    Shoham, Y.4
  • 10
    • 0026843290 scopus 로고
    • What can machines know? On the properties of knowledge in distributed systems
    • Fagin R., Halpern J.Y., and Vardi M.Y. What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM 32 2 (1992) 328-376
    • (1992) Journal of the ACM , vol.32 , Issue.2 , pp. 328-376
    • Fagin, R.1    Halpern, J.Y.2    Vardi, M.Y.3
  • 11
    • 33747046805 scopus 로고    scopus 로고
    • MCK: Model checking the logic of knowledge
    • Proceedings of 16th International Conference on Computer Aided Verification (CAV'04), Springer-Verlag
    • Gammie P., and van der Meyden R. MCK: Model checking the logic of knowledge. Proceedings of 16th International Conference on Computer Aided Verification (CAV'04). LNCS vol. 3114 (2004), Springer-Verlag 479-483
    • (2004) LNCS , vol.3114 , pp. 479-483
    • Gammie, P.1    van der Meyden, R.2
  • 12
    • 3142662048 scopus 로고    scopus 로고
    • Complete axiomatisations for reasoning about knowledge and time
    • Halpern J., van der Meyden R., and Vardi M.Y. Complete axiomatisations for reasoning about knowledge and time. SIAM Journal on Computing 33 3 (2003) 674-703
    • (2003) SIAM Journal on Computing , vol.33 , Issue.3 , pp. 674-703
    • Halpern, J.1    van der Meyden, R.2    Vardi, M.Y.3
  • 13
    • 0026853865 scopus 로고
    • A guide to completeness complexity for modal logics of knowledge and belief
    • Halpern J., and Moses Y. A guide to completeness complexity for modal logics of knowledge and belief. Artificial Intelligence 54 (1992) 319-379
    • (1992) Artificial Intelligence , vol.54 , pp. 319-379
    • Halpern, J.1    Moses, Y.2
  • 14
    • 35448978115 scopus 로고    scopus 로고
    • W. van der Hoek, M. Wooldridge, Model checking knowledge and time, in: SPIN 2002-Proceedings of the Ninth International SPIN Workshop on Model Checking of Software, Grenoble, France, April 2002
  • 15
    • 4544383448 scopus 로고    scopus 로고
    • Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
    • van der Hoek W., and Wooldridge M. Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica 75 1 (2003) 125-157
    • (2003) Studia Logica , vol.75 , Issue.1 , pp. 125-157
    • van der Hoek, W.1    Wooldridge, M.2
  • 18
    • 7044238426 scopus 로고    scopus 로고
    • Bounded model checking for interpreted systems: preliminary experimental results
    • Proceedings of FAABS II. Hinchey M. (Ed), Springer-Verlag
    • Lomuscio A., Łasica T., and Penczek W. Bounded model checking for interpreted systems: preliminary experimental results. In: Hinchey M. (Ed). Proceedings of FAABS II. LNCS vol. 2699 (2003), Springer-Verlag
    • (2003) LNCS , vol.2699
    • Lomuscio, A.1    Łasica, T.2    Penczek, W.3
  • 19
    • 0038812256 scopus 로고    scopus 로고
    • Deontic interpreted systems
    • Lomuscio A., and Sergot M. Deontic interpreted systems. Studia Logica 75 1 (2003) 63-92
    • (2003) Studia Logica , vol.75 , Issue.1 , pp. 63-92
    • Lomuscio, A.1    Sergot, M.2
  • 20
    • 0037797779 scopus 로고    scopus 로고
    • Complete axiomatizations for reasoning about knowledge and branching time
    • van der Meyden R., and Wong K. Complete axiomatizations for reasoning about knowledge and branching time. Studia Logica 75 1 (2003) 93-123
    • (2003) Studia Logica , vol.75 , Issue.1 , pp. 93-123
    • van der Meyden, R.1    Wong, K.2
  • 22
    • 33646179393 scopus 로고    scopus 로고
    • Verics 2004: A model checker for real time and multi-agent systems
    • Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P'04), Humboldt University
    • Nabialek W., Niewiadomski A., Penczek W., Pólrola A., and Szreter M. Verics 2004: A model checker for real time and multi-agent systems. Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P'04). Informatik-Berichte vol. 170 (2004), Humboldt University 88-99
    • (2004) Informatik-Berichte , vol.170 , pp. 88-99
    • Nabialek, W.1    Niewiadomski, A.2    Penczek, W.3    Pólrola, A.4    Szreter, M.5
  • 23
    • 0037560142 scopus 로고    scopus 로고
    • Verifying epistemic properties of multi-agent systems via bounded model checking
    • Penczek W., and Lomuscio A. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae 55 2 (2003) 167-185
    • (2003) Fundamenta Informaticae , vol.55 , Issue.2 , pp. 167-185
    • Penczek, W.1    Lomuscio, A.2
  • 24
    • 0036600797 scopus 로고    scopus 로고
    • Bounded model checking for the universal fragment of CTL
    • Penczek W., Woźna B., and Zbrzezny A. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae 51 1-2 (2002) 135-156
    • (2002) Fundamenta Informaticae , vol.51 , Issue.1-2 , pp. 135-156
    • Penczek, W.1    Woźna, B.2    Zbrzezny, A.3
  • 25
    • 84974720053 scopus 로고    scopus 로고
    • Towards bounded model checking for the universal fragment of TCTL
    • Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT'02), Springer-Verlag
    • Penczek W., Woźna B., and Zbrzezny A. Towards bounded model checking for the universal fragment of TCTL. Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT'02). LNCS vol. 2469 (2002), Springer-Verlag 265-288
    • (2002) LNCS , vol.2469 , pp. 265-288
    • Penczek, W.1    Woźna, B.2    Zbrzezny, A.3
  • 26
    • 34247126144 scopus 로고    scopus 로고
    • F. Raimondi, A. Lomuscio, Automatic verification of multi-agent systems by model checking via OBDDs, Journal of Applied Logic (2007) (Special issue on Logic-based agent verification), submitted for publication
  • 27
    • 0035135204 scopus 로고    scopus 로고
    • Analysis of timed systems using time-abstracting bisimulations
    • Tripakis S., and Yovine S. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design 18 1 (2001) 25-68
    • (2001) Formal Methods in System Design , vol.18 , Issue.1 , pp. 25-68
    • Tripakis, S.1    Yovine, S.2
  • 28
    • 84958768940 scopus 로고    scopus 로고
    • Model checking knowledge and time in systems with perfect recall
    • Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'99), Springer-Verlag
    • van der Meyden R., and Shilov H. Model checking knowledge and time in systems with perfect recall. Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'99). LNCS vol. 1738 (1999), Springer-Verlag 432-445
    • (1999) LNCS , vol.1738 , pp. 432-445
    • van der Meyden, R.1    Shilov, H.2
  • 31
    • 26844565954 scopus 로고    scopus 로고
    • A logic for knowledge, correctness, and real time
    • Proceedings of the 5th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA'04), Springer-Verlag
    • Woźna B., and Lomuscio A. A logic for knowledge, correctness, and real time. Proceedings of the 5th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA'04). LNAI vol. 3487 (2005), Springer-Verlag 1-15
    • (2005) LNAI , vol.3487 , pp. 1-15
    • Woźna, B.1    Lomuscio, A.2
  • 32
    • 14044266255 scopus 로고    scopus 로고
    • Bounded model checking for deontic interpreted systems
    • Proc. of the 2nd Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'04), Elsevier
    • Woźna B., Lomuscio A., and Penczek W. Bounded model checking for deontic interpreted systems. Proc. of the 2nd Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'04). ENTCS vol. 126 (2004), Elsevier 93-114
    • (2004) ENTCS , vol.126 , pp. 93-114
    • Woźna, B.1    Lomuscio, A.2    Penczek, W.3
  • 33
    • 2942702093 scopus 로고    scopus 로고
    • Improvements in SAT-based reachability analysis for timed automata
    • Zbrzezny A. Improvements in SAT-based reachability analysis for timed automata. Fundamenta Informaticae 60 1-4 (2004) 417-434
    • (2004) Fundamenta Informaticae , vol.60 , Issue.1-4 , pp. 417-434
    • Zbrzezny, A.1


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