We investigate the verification of Multi-Agent Systems against strategic properties expressed
in Alternating-time Temporal Logic under the assumptions of imperfect information and …

We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect
information, for which no commonly accepted semantics has been proposed yet. Rather …

This chapter is about model checking and its complexity in some of the main temporal and
strategic logics, eg LTL, CTL, and ATL. We discuss several variants of ATL (perfect vs …

We present an experimental tool for verification of strategic abilities under imperfect
information, as well as strategy synthesis. The problem is well known to be hard, both …

In game theory, as well as in the semantics of game logics, a strategy can be represented by
any function from states of the game to the agent's actions. That makes sense from the …

Abstract Model checking of strategic ability under imperfect information is known to be hard.
The complexity results range from NP-completeness to undecidability, depending on the …

In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL*
under imperfect information. Specifically, we present novel decidability and complexity …

We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL)
and Strategic TCTL (STCTL), respectively. For each of the above logics we give a …

S elene is a recently proposed voting protocol that provides reasonable protection against
coercion. In this paper, we make the first step towards a formalization of selected features of …

Formal methods for strategic reasoning play a fundamental role in Multi-Agent System
(MAS) design and verification [3, 16, 56, 67, 71, 77, 79]. This success story originated from …