A comparison of SMT-solvers for timed weighted interpreted systems

We compare four SMT-solvers for the same SMT-based bounded model checking algorithm for multi-agent systems modelled by timed weighted interpreted systems and for properties expressed in the existential fragment of epistemic weighted linear-time temporal logic (WELTLK). To this end, we use the timed weighted generic pipeline paradigm (TWGPP) and the timed weighted train controller system (TWTCS). We consider several properties of the problems that can be expressed in WELTLK, and we present the performance evaluation of the mentioned bounded model checking method using four different SMT-solvers: Z3, Yices, CVC4 and Mathsat, by means of the running time and the memory used.