Abstract: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 logi… Show more
“…That is, label symbols C must be written in the form C(t) where t is a kExp-term. 5 We denote this logic by T [kExp]. Note that in this logic, the use of constructs Ix is trivially limited to the kExp case because in fact all looping is Let k ≥ 1.…”
Section: Note That Functions Inmentioning
confidence: 99%
“…The paper [3] has similar motivations, but investigates the more involved case of ATL + . The article [5] concentrates on the µ-calculus. The clockings are part of the semantics and help control the semantic game.…”
Section: Introductionmentioning
confidence: 99%
“…There exist several works that make use of clockings in the literature. Much of the work in [2] and [3] and [5], including the background motivations for those studies, relates to investigating the properities of T with clockings. The paper [2] provides a game-theoretic semantics for ATL with clock values declared on the fly.…”
We investigate the expressive power of a Turing-complete logic based on gametheoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of model classes.
“…That is, label symbols C must be written in the form C(t) where t is a kExp-term. 5 We denote this logic by T [kExp]. Note that in this logic, the use of constructs Ix is trivially limited to the kExp case because in fact all looping is Let k ≥ 1.…”
Section: Note That Functions Inmentioning
confidence: 99%
“…The paper [3] has similar motivations, but investigates the more involved case of ATL + . The article [5] concentrates on the µ-calculus. The clockings are part of the semantics and help control the semantic game.…”
Section: Introductionmentioning
confidence: 99%
“…There exist several works that make use of clockings in the literature. Much of the work in [2] and [3] and [5], including the background motivations for those studies, relates to investigating the properities of T with clockings. The paper [2] provides a game-theoretic semantics for ATL with clock values declared on the fly.…”
We investigate the expressive power of a Turing-complete logic based on gametheoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of model classes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.