Add to ORKGAbstract. We introduce a general method for proving measurability of topologically complex sets by establishing a correspondence between the notion of game tree languages from automata theory and the σ-algebra of R-sets, introduced by A. Kolmogorov as a foundation for measure theory. We apply the method to answer positively to an open problem regarding the game interpretation of the probabilistic µ-calculus.
Simulation and bisimulation metrics for stochastic systems provide a quantitative generaliza-tion of...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...
International audienceWe consider the problem of computing the probability of regular languages of i...
AbstractWe define a probabilistic game automaton, a general model of a two-person game. We show how ...
The probabilistic (or quantitative) modal μ-calculus is a fixed-point logic designed for expressing ...
A general game player is a system that understands the rules of unknown games and learns to play the...
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that r...
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that r...
In this paper we introduce a class of measures on formal languages. These measures are based on the ...
This thesis presents a variety of models for probabilistic programming languages in the framework of...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
The game approaches are rather popular in many applications, where a collective of automata is used....
Automata, logic and games provide the mathematical theory that underpins the model checking of react...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
Simulation and bisimulation metrics for stochastic systems provide a quantitative generaliza-tion of...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...
International audienceWe consider the problem of computing the probability of regular languages of i...
AbstractWe define a probabilistic game automaton, a general model of a two-person game. We show how ...
The probabilistic (or quantitative) modal μ-calculus is a fixed-point logic designed for expressing ...
A general game player is a system that understands the rules of unknown games and learns to play the...
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that r...
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that r...
In this paper we introduce a class of measures on formal languages. These measures are based on the ...
This thesis presents a variety of models for probabilistic programming languages in the framework of...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
The game approaches are rather popular in many applications, where a collective of automata is used....
Automata, logic and games provide the mathematical theory that underpins the model checking of react...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
Simulation and bisimulation metrics for stochastic systems provide a quantitative generaliza-tion of...
We consider two-player games played over finite state spaces for an infinite number of rounds. At ea...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...