Fixpoint Games on Continuous Lattices

by   Paolo Baldan, et al.

Many analysis and verifications tasks, such as static program analyses and model-checking for temporal logics reduce to the solution of systems of equations over suitable lattices. Inspired by recent work on lattice-theoretic progress measures, we develop a game-theoretical approach to the solution of systems of monotone equations over lattices, where for each single equation either the least or greatest solution is taken. A simple parity game, referred to as fixpoint game, is defined that provides a correct and complete characterisation of the solution of equation systems over continuous lattices, a quite general class of lattices widely used in semantics. For powerset lattices the fixpoint game is intimately connected with classical parity games for μ-calculus model-checking, whose solution can exploit as a key tool Jurdziński's small progress measures. We show how the notion of progress measure can be naturally generalised to fixpoint games over continuous lattices and we prove the existence of small progress measures. Our results lead to a constructive formulation of progress measures as (least) fixpoints. We refine this characterisation by introducing the notion of selection that allows one to constrain the plays in the parity game, enabling an effective (and possibly efficient) solution of the game, and thus of the associated verification problem. We also propose a logic for specifying the moves of the existential player that can be used to systematically derive simplified equations for efficiently computing progress measures. We discuss potential applications to the model-checking of latticed μ-calculi and to the solution of fixpoint equations systems over the reals.


page 1

page 2

page 3

page 4


Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations

Systems of fixpoint equations over complete lattices, consisting of (mix...

Simple Fixpoint Iteration To Solve Parity Games

A naive way to solve the model-checking problem of the mu-calculus uses ...

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants

We introduce a new game-theoretic semantics (GTS) for the modal mu-calcu...

From Quasi-Dominions to Progress Measures

In this paper we revisit the approaches to the solution of parity games ...

Oink: an Implementation and Evaluation of Modern Parity Game Solvers

Parity games have important practical applications in formal verificatio...

A Compositional Approach to Parity Games

In this paper, we introduce open parity games, which is a compositional ...

Computing Nested Fixpoints in Quasipolynomial Time

It is well known that the winning region of a parity game with n nodes a...

Please sign up or login with your details

Forgot password? Click here to reset