Abstract
We define the SMT-based bounded model checking (BMC) method for weighted interpreted systems and for the existential fragment of the weighted epistemic computation tree logic. We implemented the new BMC algorithm and compared it with the SAT-based BMC method for the same systems and the same property language on several benchmarks for multi-agent systems.
Partly supported by National Science Centre under the grant No. 2014/15/N/ST6/05079.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clark, B., Sebastiani, R., Sanjit, S., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, chapter 26, pp. 825–885. IOS Press (2009)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press (1999)
Jones, A.V., Lomuscio, A.: Distributed BDD-based BMC for the verification of multi-agent systems. In: Proc. AAMAS 2010, pp. 675–682. IFAAMAS (2010)
Mȩski, A., Penczek, W., Szreter, M., Woźna-Szcześniak, B., Zbrzezny, A.: BDD- versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. Autonomous Agents and Multi-Agent Systems 28(4), 558–604 (2014)
de Moura, L., Bjørner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)
Woźna-Szcześniak, B.: SAT-based bounded model checking for weighted deontic interpreted systems. In: Reis, L.P., Correia, L., Cascalho, J. (eds.) EPIA 2013. LNCS, vol. 8154, pp. 444–455. Springer, Heidelberg (2013)
Woźna-Szcześniak, B., Zbrzezny, A.M., Zbrzezny, A.: SAT-based bounded model checking for weighted interpreted systems and weighted linear temporal logic. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds.) PRIMA 2013. LNCS, vol. 8291, pp. 355–371. Springer, Heidelberg (2013)
Woźna-Szcześniak, B., Szcześniak, I., Zbrzezny, A.M., Zbrzezny, A.: Bounded model checking for weighted interpreted systems and for flat weighted epistemic computation tree logic. In: Dam, H.K., Pitt, J., Xu, Y., Governatori, G., Ito, T. (eds.) PRIMA 2014. LNCS, vol. 8861, pp. 107–115. Springer, Heidelberg (2014)
Zbrzezny, A.: Improving the translation from ECTL to SAT. Fundamenta Informaticae 85(1–4), 513–531 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zbrzezny, A.M., Woźna-Szcześniak, B., Zbrzezny, A. (2015). SMT-Based Bounded Model Checking for Weighted Epistemic ECTL. In: Pereira, F., Machado, P., Costa, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 2015. Lecture Notes in Computer Science(), vol 9273. Springer, Cham. https://doi.org/10.1007/978-3-319-23485-4_65
Download citation
DOI: https://doi.org/10.1007/978-3-319-23485-4_65
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23484-7
Online ISBN: 978-3-319-23485-4
eBook Packages: Computer ScienceComputer Science (R0)