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

by   Lauri Hella, et al.

We introduce a new game-theoretic semantics (GTS) for the modal mu-calculus. Our so-called bounded GTS replaces parity games with alternative evaluation games where only finite paths arise; infinite paths are not needed even when the considered transition system is infinite. The novel games offer alternative approaches to various constructions in the framework of the mu-calculus. For example, they have already been successfully used as a basis for an approach leading to a natural formula size game for the logic. While our main focus is introducing the new GTS, we also consider some applications to demonstrate its uses. For example, we consider a natural model transformation procedure that reduces model checking games to checking a single, fixed formula in the constructed models, and we also use the GTS to identify new alternative variants of the mu-calculus with PTime model checking.



page 1

page 2

page 3

page 4


Featured Games

Feature-based SPL analysis and family-based model checking have seen rap...

Simple Fixpoint Iteration To Solve Parity Games

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

Formula size games for modal logic and μ-calculus

We propose a new version of formula size game for modal logic. The game ...

Fixpoint Games on Continuous Lattices

Many analysis and verifications tasks, such as static program analyses a...

Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games

ω-regular energy games, which are weighted two-player turn-based games w...

Scalar and Vectorial mu-calculus with Atoms

We study an extension of modal mu-calculus to sets with atoms and we stu...

Computing Nested Fixpoints in Quasipolynomial Time

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

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.