Auton Agent Multi-Agent Syst (2014) 28:558–604 DOI 10.1007/s10458-013-9232-2 BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance Artur M¸ eski · Wojciech Penczek · Maciej Szreter · Bo˙ zena Wo´ zna-Szcze´ sniak · Andrzej Zbrzezny Published online: 31 August 2013 © The Author(s) 2013. This article is published with open access at Springerlink.com Abstract The paper deals with symbolic approaches to bounded model checking (BMC) for the existential fragment of linear temporal logic extended with the epistemic compo- nent (ELTLK), interpreted over interleaved interpreted systems. Two translations of BMC for ELTLK to SAT and to operations on BDDs are presented. The translations have been implemented, tested, and compared with each other as well as with another tool on several benchmarks for MAS. Our experimental results reveal advantages and disadvantages of SAT- versus BDD-based BMC for ELTLK. Keywords Bounded model checking · Binary decision diagrams · Propositional satisfiability problem (SAT) · Interpreted systems · Interleaved interpreted systems · Epistemic linear temporal logic A. M¸ eski · W. Penczek · M. Szreter Institute of Computer Science, PAS, Jana Kazimierza 5, 01-237 Warszawa, Poland e-mail: mszreter@ipipan.waw.pl B. Wo´ zna-Szcze´ sniak (B ) · A. Zbrzezny Jan Dlugosz University, IMCS, Armii Krajowej 13/15, 42-200 Czestochowa, Poland e-mail: bwozna@gmail.com A. Zbrzezny e-mail: a.zbrzezny@ajd.czest.pl W. Penczek University of Natural Sciences and Humanities, II, Sienkiewicza 51, 08-110 Siedlce, Poland e-mail: penczek@ipipan.waw.pl A. M¸ eski University of Lód´ z, FMCS, Banacha 22, 90-238 Lodz, Poland e-mail: meski@ipipan.waw.pl 123