We define and investigate a novel notion of expressiveness for temporal logics that is based on game theoretic equilibria of multi-agent systems. We use
iterated Boolean games
as our abstract model of multi-agent systems [Gutierrez et al. 2013, 2015a]. In such a game, each agent
has a goal
, represented using (a fragment of)
Linear Temporal Logic (
)
. The goal
captures agent
’s preferences, in the sense that the models of
represent system behaviours that would satisfy
. Each player controls a subset of Boolean variables
, and at each round in the game, player
is at liberty to choose values for variables
in any way that she sees fit. Play continues for an infinite sequence of rounds, and so as players act they collectively trace out a model for
, which for every player will either satisfy or fail to satisfy their goal. Players are assumed to act strategically, taking into account the goals of other players, in an attempt to bring about computations satisfying their goal. In this setting, we apply the standard game-theoretic concept of (pure) Nash equilibria. The (possibly empty) set of Nash equilibria of an iterated Boolean game can be understood as inducing a set of computations, each computation representing one way the system could evolve if players chose strategies that together constitute a Nash equilibrium. Such a set of equilibrium computations expresses a temporal property—which may or may not be expressible within a particular
fragment. The new notion of expressiveness that we formally define and investigate is then as follows:
What temporal properties are characterised by the Nash equilibria of games in which agent goals are expressed in specific fragments of
? We formally define and investigate this notion of expressiveness for a range of
fragments. For example, a very natural question is the following:
Suppose we have an iterated Boolean game in which every goal is represented using a particular fragment
of
: is it then always the case that the equilibria of the game can be characterised within
?
We show that this is not true in general.
Automatic verification of concurrent stochastic systems