Automated verification of discrete-state systems has been a hot topic in computer science for

over 35 years. The idea found its way into AI and multi-agent systems in late 1990’s, and techniques for verification of such systems have been in constant development since then. Model checking of temporal, epistemic, and strategic properties is one of the most prominent and most successful approaches here.

In this tutorial, we present a brief introduction to the topic, and mention relevant properties that one might like to verify this way. Then, we describe some very recent results on incomplete model checking algorithms and model reductions, which can potentially lead to practical solutions for the notoriously hard problem. In the last part of the tutorial, we present the experimental tool for verification of strategic ability, being developed by our research group at the Polish Academy of Sciences. In particular, we show how the tool can be used to verify simplified versions of two interesting use cases: multi-agent learning and secure voting in an election. 

The tutorial is addressed to all researchers in AI. It will be accessible to the general audience; no special knowledge is required. The concepts being presented are pretty involved mathematically, but we will present them by means of simple examples, and avoid exposition of the detailed mathematical machinery.