On-The-Fly Solving for Symbolic Parity Games

Abstract

Parity games can be used to represent many different kinds of decision problems. In practice, tools that use parity games often rely on a specification in a higher-order logic from which the actual game can be obtained by means of an exploration. For many of these decision problems we are only interested in the solution for a designated vertex in the game. We formalise how to use on-the-fly solving techniques during the exploration process, and show that this can help to decide the winner of such a designated vertex in an incomplete game. Furthermore, we define partial solving techniques for incomplete parity games and show how these can be made resilient to work directly on the incomplete game, rather than on a set of safe vertices. We implement our techniques for symbolic parity games and study their effectiveness in practice, showing that speed-ups of several orders of magnitude are feasible and overhead (if unavoidable) is typically low.

Modelling the Raft Distributed Consensus Protocol in mCRL2

“…We will explain the meaning of the formulas as we proceed. All main properties hold true for all configurations of Table 1; verification of each property takes roughly 2-3 times that of generating the state space using the symbolic technique described in [10]. We additionally verify a number of simple liveness properties that demonstrate that the main properties we verify do not hold true vacuously.…”

Formally Modelling the Rijkswaterstaat Tunnel Control Systems in a Constrained Industrial Environment

“…In push styles state spaces will become much bigger [7]. Although we feel that the Dezyne toolset could do a better job in state space generation, we do not expect this to be available for quite some years to come, especially because the way Dezyne generates a full state space does not employ symbolic techniques or parallelism [6,14].…”