메뉴 건너뛰기




Volumn 126, Issue , 2005, Pages 93-114

Bounded model checking for deontic interpreted systems

Author keywords

Bounded model checking; Epistemic logic

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; FORMAL LOGIC; MULTI AGENT SYSTEMS; NETWORK PROTOCOLS; QUERY LANGUAGES; SEMANTICS; SOFTWARE ENGINEERING;

EID: 14044266255     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.11.015     Document Type: Conference Paper
Times cited : (19)

References (17)
  • 1
    • 21144432500 scopus 로고    scopus 로고
    • Experimental analysis of different techniques for bounded model checking
    • Proc. of TACAS'03. Springer-Verlag
    • N. Amla, R. Kurshan, K. McMillan, and R. Medel Experimental analysis of different techniques for bounded model checking Proc. of TACAS'03 LNCS volume 2619 2003 Springer-Verlag 34 48
    • (2003) LNCS , vol.2619 , pp. 34-48
    • Amla, N.1    Kurshan, R.2    McMillan, K.3    Medel, R.4
  • 5
    • 84958760528 scopus 로고    scopus 로고
    • Benefits of bounded model checking at an industrial setting
    • Proc. of CAV'01. Springer-Verlag
    • F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Vardi Benefits of bounded model checking at an industrial setting Proc. of CAV'01 LNCS volume 2102 2001 Springer-Verlag 436 453
    • (2001) LNCS , vol.2102 , pp. 436-453
    • Copty, F.1    Fix, L.2    Fraer, R.3    Giunchiglia, E.4    Kamhi, G.5    Tacchella, A.6    Vardi, M.7
  • 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 1982 241 266
    • (1982) Science of Computer Programming , vol.2 , Issue.3 , pp. 241-266
    • Emerson, E.A.1    Clarke, E.M.2
  • 9
    • 0026891645 scopus 로고
    • A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols
    • J.Y. Halpern, and L.D. Zuck A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols Journal of the ACM 39 3 1992 449 478
    • (1992) Journal of the ACM , vol.39 , Issue.3 , pp. 449-478
    • Halpern, J.Y.1    Zuck, L.D.2
  • 10
    • 10944258530 scopus 로고    scopus 로고
    • Violation, error recovery, and enforcement in the bit transmission problem
    • Proceedings of DEON'02, London, May 2002
    • A. Lomuscio, and M. Sergot Violation, error recovery, and enforcement in the bit transmission problem Proceedings of DEON'02, London, May 2002 Journal of Applied Logic 2 2004 93 116 Elsevier
    • (2004) Journal of Applied Logic , vol.2 , pp. 93-116
    • Lomuscio, A.1    Sergot, M.2
  • 12
    • 0010314258 scopus 로고
    • The SMV system
    • Carnegie-Mellon University, February
    • K. McMillan. The SMV system. Technical Report CMU-CS-92-131, Carnegie-Mellon University, February 1992
    • (1992) Technical Report , vol.CMU-CS-92-131
    • McMillan, K.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 2003 167 185
    • (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 2002 135 156
    • (2002) Fundamenta Informaticae , vol.51 , Issue.1-2 , pp. 135-156
    • Penczek, W.1    Woźna, B.2    Zbrzezny, A.3


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