Bounded game-theoretic semantics for modal mu-calculus

Hella, Lauri; Kuusisto, Antti; Rönnholm, Raine

doi:10.1016/j.ic.2022.104882

Cited by 1 publication

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is also worth mentioning that the work in the present article has already been made essential use of in constructing a canonical formula size game for the µ-calculus in [15]. The first short draft of the current submission appeared in 2017 as the arXiv manuscript [13]. It contained only the game-theoretic semantics presented below; the current article is the extended, full conference version of that short draft.…”

Section: Notes On Related Workmentioning

confidence: 99%

“…It contained only the game-theoretic semantics presented below; the current article is the extended, full conference version of that short draft. The extended preprint of the current article is also available as the arXiv manuscript [14], containing full technical details.…”

Section: Notes On Related Workmentioning

confidence: 99%

“…We present here a proof sketch highlighting the main ideas. For a rigorous, fully detailed proof, please see the appendix of the full arXiv preprint version [14] of the current submission.…”

Section: Bounded Compositional Semanticsmentioning

confidence: 99%

See 2 more Smart Citations

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

Hella¹,

Kuusisto²,

Rönnholm³

2020

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Notes On Related Workmentioning

confidence: 99%

Section: Notes On Related Workmentioning

confidence: 99%