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

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

collaborators
Showing cs.LOShow all

5 papers · 1 filter

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.LO2020

Strategy Logic with Imperfect Information

Raphaël Berthon, Bastien Maubert, Aniello Murano +2

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player…

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.LO2018

Strategy Logic with Imperfect Information

Raphaël Berthon, Bastien Maubert, Aniello Murano +2

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player…

cs.LO2018

Decidability results for ATL* with imperfect information and perfect recall

Raphaël Berthon, Bastien Maubert, Aniello Murano

Alternating-time Temporal Logic (ATL*) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATL*i ) is well known to have an undecidable m…