activity
20072026
most citedAlgorithms for Omega-Regular Games with Imperfect Information

171 citations · 497 across the 31 of their papers we have counts for

collaborators
Showing cs.LOShow all

22 papers · 1 filter

cs.LO2025

The Value Problem for Multiple-Environment MDPs with Parity Objective

Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin +1

We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition…

cs.LO2023

Synthesising Full-Information Protocols

Dietmar Berwanger, Laurent Doyen, Thomas Soullard

We lay out a model of games with imperfect information that features explicit communication actions, by which the entire observation history of a player is revealed to another play…

cs.LO2022

Bounds for Synchronizing Markov Decision Processes

Laurent Doyen, Marie van den Bogaard

We consider Markov decision processes with synchronizing objectives, which require that a probability mass of accumulates in a designated set of target states, either once, a…

cs.LO2021★ 1 cited

Stochastic Processes with Expected Stopping Time

Krishnendu Chatterjee, Laurent Doyen

Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic beh…

cs.LO2016★ 2 cited

Computation Tree Logic for Synchronization Properties

Krishnendu Chatterjee, Laurent Doyen

We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths…

cs.LO2016★ 1 cited

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives

Krishnendu Chatterjee, Laurent Doyen

Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information…