In open systems verification, to formally check for reliability, one needs an appropriate
formalism to model the interaction between agents and express the correctness of the …

Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

Abstract Model checking has come of age. A number of techniques are increasingly used in
industrial setting to verify hardware and software systems, both against models and concrete …

Strategy Logic (SL) has recently come to the fore as a useful specification language to
reason about multi-agent systems. Its one-goal fragment, or SL [1G], is of particular interest …

Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a
useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent …

Abstract We introduce Strategy Logic with Knowledge, a novel formalism to reason about
knowledge and strategic ability in memoryless multi-agent systems with incomplete …

In this paper we study techniques for reasoning about game-like concurrent systems, where
the components of the system act rationally and strategically in pursuit of logically-specified …

This paper presents a range of expressiveness and complexity results for the specification,
computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent …

Parity games are infinite-duration two-player turn-based games that provide powerful formal-
method techniques for the automatic synthesis and verification of distributed and reactive …

In this paper, we introduce a new method of the satisfiability (SAT) checking for Simple-Goal
Strategy Logic (SL [SG]), using symbolic Boolean model encoding and the SAT Modulo …