SAT-Based Bounded Model Checking for Weighted Deontic Interpreted Systems

被引:0
|
作者
Wozna-Szczesniak, Bozena [1 ]
机构
[1] Jan Dlugosz Univ, IMCS, PL-42200 Czestochowa, Poland
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we present a SAT-based Bounded Model Checking (BMC) method for weighted deontic interpreted systems (i.e., Kripke structures where transitions carry a weight, which is an arbitrary natural number) and properties expressed in the existential fragment of a weighted temporal logic augmented to include knowledge and deontic components (WECTLKD). In particular, since in BMC both the system model and the checked property are translated into a Boolean formula to be analysed by a SAT-solver, we introduce a new Boolean encoding of the WECTLKD formulae that is particularly optimized for managing quantitative weighted temporal operators, knowledge operators, and deontic operators, which are typically found in properties of complex multiagent systems in models of which we assume the possibility that agents may not behave as they are supposed to, and that acting (coordination, negotiation, cooperation, etc.) of agents may cost. We illustrate how the weighted deontic interpreted systems can be applied to the analysis of a variant of the standard bit transmission problem in which an agent may fail to do something it is supposed to do.
引用
收藏
页码:444 / 455
页数:12
相关论文
共 50 条
  • [1] SAT-based Bounded Model Checking forWeighted Deontic Interpreted Systems
    Wozna-Szczesniak, Bozena
    FUNDAMENTA INFORMATICAE, 2016, 143 (1-2) : 173 - 205
  • [2] Bounded Model Checking for Deontic Interpreted Systems
    Wozna, Bozena
    Lomuscio, Alessio
    Penczek, Wojciech
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 126 : 93 - 114
  • [3] Efficient distributed SAT and SAT-based distributed Bounded Model Checking
    Malay K. Ganai
    Aarti Gupta
    Zijiang Yang
    Pranav Ashar
    International Journal on Software Tools for Technology Transfer, 2006, 8 (4-5) : 387 - 396
  • [4] Efficient distributed SAT and SAT-based distributed bounded model checking
    Ganai, MK
    Gupta, A
    Yang, ZJ
    Ashar, P
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2003, 2860 : 334 - 347
  • [5] SAT-based bounded model checking for SE-LTL
    Zhou Conghua
    Ju Shiguang
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 582 - +
  • [6] Evaluation of SAT-based bounded model checking of ACTL properties
    Xu, Yanyan
    Chen, Wei
    Xu, Liang
    Zhang, Wenhui
    TASE 2007: FIRST JOINT IEEE/IFIP SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2007, : 339 - +
  • [7] Efficient SAT-based bounded model checking for software verification
    Ivancic, Franio
    Yang, Zijiang
    Ganai, Malay K.
    Gupta, Aarti
    Ashar, Pranav
    THEORETICAL COMPUTER SCIENCE, 2008, 404 (03) : 256 - 274
  • [8] Learning from BDDs in SAT-based bounded model checking
    Gupta, A
    Ganai, M
    Chao, W
    Yang, ZJ
    Ashar, P
    40TH DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2003, 2003, : 824 - 829
  • [9] Incremental deductive & inductive reasoning for SAT-based Bounded Model Checking
    Zhang, L
    Prasad, MR
    Hsiao, MS
    ICCAD-2004: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2004, : 502 - 509
  • [10] SMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL
    Zbrzezny, Agnieszka M.
    Wozna-Szczesniak, Bozena
    Zbrzezny, Andrzej
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 1671 - 1672