activity
20122022
most citedMonadic Second-Order Logic with Path-Measure Quantifier is Undecidable

3 citations · 4 across the 4 of their papers we have counts for

collaborators

9 papers

cs.LO2022

Strategy Synthesis for Global Window PCTL

Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha +1

Given a Markov decision process (MDP) and a formula , the strategy synthesis problem asks if there exists a strategy s.t. the resulting Markov chain satisfies

cs.LO2020

Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes

Raphaël Berthon, Shibashis Guha, Jean-François Raskin

In this paper, we consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives. These objectives are omega-regular properties that need…

cs.FL2020

Alternating Tree Automata with Qualitative Semantics

Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot +7

We study alternating automata with qualitative semantics over infinite binary trees: alternation means that two opposing players construct a decoration of the input tree called a r…

cs.FL2019

Two-way Parikh Automata

Emmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi

Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have…

cs.LO20193 cited

Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable

Raphaël Berthon, Emmanuel Filiot, Shibashis Guha +5

We prove that the theory of Monadic Second-Order logic (MSO) of the infinite binary tree extended with qualitative path-measure quantifier is undecidable. This quantifier says that…

cs.GT2018

Expected Window Mean-Payoff

Benjamin Bordais, Shibashis Guha, Jean-François Raskin

In the window mean-payoff objective, given an infinite path, instead of considering a long run average, we consider the minimum payoff that can be ensured at every position of the…