Raphaël Berthon

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Markov Decision Processes with Sure Parity and Multiple Reachability Objectives 2024 Raphaël Berthon
Joost-Pieter Katoen
Tobias Winkler
+ PDF Chat Natural Strategic Ability in Stochastic Multi-Agent Systems 2024 Raphaël Berthon
Joost-Pieter Katoen
Munyque Mittelmann
Aniello Murano
+ Natural Strategic Ability in Stochastic Multi-Agent Systems 2024 Raphaël Berthon
Joost-Pieter Katoen
Munyque Mittelmann
Aniello Murano
+ PDF Chat Strategy Logic with Imperfect Information 2021 Raphaël Berthon
Bastien Maubert
Aniello Murano
Sasha Rubin
Moshe Y. Vardi
+ PDF Chat Active Learning of Sequential Transducers with Side Information About the Domain 2021 Raphaël Berthon
Adrien Boiret
Guillermo A. Pérez
Jean-François Raskin
+ Active Learning of Sequential Transducers with Side Information about the Domain 2021 Raphaël Berthon
Adrien Boiret
Guillermo A. Pérez
Jean-François Raskin
+ PDF Chat Alternating Tree Automata with Qualitative Semantics 2020 Raphaël Berthon
Nathanaël Fijalkow
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Sophie Pinchinat
Sasha Rubin
Olivier Serre
+ PDF Chat Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes 2020 Raphaël Berthon
Shibashis Guha
Jean-François Raskin
+ Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes 2020 Raphaël Berthon
Shibashis Guha
Jean-François Raskin
+ Alternating Tree Automata with Qualitative Semantics 2020 Raphaël Berthon
Nathanaël Fijalkow
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Sophie Pinchinat
Sasha Rubin
Olivier Serre
+ Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes 2020 Raphaël Berthon
Shibashis Guha
Jean-François Raskin
+ Strategy Logic with Imperfect Information 2020 Raphaël Berthon
Bastien Maubert
Aniello Murano
Sasha Rubin
Moshe Y. Vardi
+ Alternating Tree Automata with Qualitative Semantics 2020 Raphaël Berthon
Nathanaël Fijalkow
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Sophie Pinchinat
Sasha Rubin
Olivier Serre
+ Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable. 2019 Raphaël Berthon
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Jean-François Raskin
Sasha Rubin
+ Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable 2019 Raphaël Berthon
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Jean-François Raskin
Sasha Rubin
+ Decidability results for ATL* with imperfect information and perfect recall 2018 Raphaël Berthon
Bastien Maubert
Aniello Murano
+ PDF Chat Strategy logic with imperfect information 2017 Raphaël Berthon
Bastien Maubert
Aniello Murano
Sasha Rubin
Moshe Y. Vardi
+ Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes 2017 Raphaël Berthon
Mickaël Randour
Jean-François Raskin
+ Quantified CTL with imperfect information 2016 Raphaël Berthon
Bastien Maubert
Aniello Murano
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Alternating Nonzero Automata 2018 Paulin Fournier
Hugo Gimbert
3
+ PDF Chat Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable 2011 Cătălin Dima
Ferucio Laurenţiu Ţiplea
2
+ PDF Chat Alternating-time temporal logic with finite-memory strategies 2013 Steen Vester
2
+ PDF Chat The fixed initial credit problem for partial-observation energy games is Ack-complete 2016 Guillermo A. Pérez
2
+ PDF Chat Emptiness of zero automata is decidable 2017 Mikołaj Bojańczyk
Hugo Gimbert
Edon Kelmendi
2
+ PDF Chat Doomsday equilibria for omega-regular games 2016 Krishnendu Chatterjee
Laurent Doyen
Emmanuel Filiot
Jean-François Raskin
2
+ Reasoning About Strategies: On the Model-Checking Problem 2011 Fabio Mogavero
Aniello Murano
Giuseppe Perelli
Moshe Y. Vardi
2
+ PDF Chat Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games 2016 Véronique Bruyère
Emmanuel Filiot
Mickaël Randour
Jean-François Raskin
2
+ PDF Chat Hierarchical information and the synthesis of distributed strategies 2017 Dietmar Berwanger
Anup Basil Mathew
Marie van den Bogaard
2
+ PDF Chat Emptiness of zero automata is decidable 2017 Mikołaj Bojańczyk
Hugo Gimbert
Edon Kelmendi
2
+ Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable. 2019 Raphaël Berthon
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Jean-François Raskin
Sasha Rubin
2
+ PDF Chat ATLsc with partial observation 2015 François Laroussinie
Nicolas Markey
Arnaud Sangnier
2
+ Universal games of incomplete information 1979 John H. Reif
2
+ PDF Chat A High-Level LTL Synthesis Format: TLSF v1.1 2016 Swen Jacobs
Felix Klein
Sebastian Schirmer
1
+ Parameter Synthesis for Markov Models. 2019 Sebastian Junges
Erika Ábrahám
Christian Hensel
Nils Jansen
Joost-Pieter Katoen
Tim Quatmann
Matthias Volk
1
+ Reasoning about Knowledge and Strategies under Hierarchical Information 2018 Bastien Maubert
Aniello Murano
1
+ Decidability results for ATL* with imperfect information and perfect recall 2018 Raphaël Berthon
Bastien Maubert
Aniello Murano
1
+ PDF Chat An Epistemic Strategy Logic 2018 Xiaowei Huang
Ron van der Meyden
1
+ Dealing with imperfect information in Strategy Logic 2019 Sophia Knight
Bastien Maubert
1
+ Combinations of Qualitative Winning for Stochastic Parity Games 2018 Krishnendu Chatterjee
Nir Piterman
1
+ Alternating Tree Automata with Qualitative Semantics 2020 Raphaël Berthon
Nathanaël Fijalkow
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Sophie Pinchinat
Sasha Rubin
Olivier Serre
1
+ Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes 2020 Raphaël Berthon
Shibashis Guha
Jean-François Raskin
1
+ PDF Chat Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes 2020 Raphaël Berthon
Shibashis Guha
Jean-François Raskin
1
+ PDF Chat Games on Graphs with a Public Signal Monitoring 2018 Patricia Bouyer
1
+ PDF Chat Grey-Box Learning of Register Automata 2020 Bharat Garhewal
Frits Vaandrager
Falk Howar
Timo Schrijvers
Toon Lenaerts
Rob Smits
1
+ PDF Chat Alternating Tree Automata with Qualitative Semantics 2020 Raphaël Berthon
Nathanaël Fijalkow
Emmanuel Filiot
Shibashis Guha
Bastien Maubert
Aniello Murano
Laureline Pinault
Sophie Pinchinat
Sasha Rubin
Olivier Serre
1
+ PDF Chat The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results 2017 Swen Jacobs
Nicolas Basset
Roderick Bloem
Romain Brenguier
Maximilien Colange
Peter Faymonville
Bernd Finkbeiner
Ayrat Khalimov
F. Klein
Thibaud Michaud
1
+ PDF Chat Natural Strategic Abilities in Voting Protocols 2021 Wojciech Jamroga
Damian Kurpiewski
Vadim Malvone
1
+ Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions 2022 Francesco Belardinelli
Wojciech Jamroga
Vadim Malvone
Munyque Mittelmann
Aniello Murano
Laurent Perrussel
1
+ Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable 2011 Cătălin Dima
Ferucio Laurenţiu Ţiplea
1
+ Partial-Observation Stochastic Games: How to Win when Belief Fails 2011 Krishnendu Chatterjee
Laurent Doyen
1
+ Strategic Abilities of Forgetful Agents in Stochastic Environments 2023 Francesco Belardinelli
Wojciech Jamroga
Munyque Mittelmann
Aniello Murano
1
+ PDF Chat Qualitative Analysis of Partially-Observable Markov Decision Processes 2010 Krishnendu Chatterjee
Laurent Doyen
Thomas A. Henzinger
1
+ PDF Chat Assume-admissible synthesis 2016 Romain Brenguier
Jean-François Raskin
Ocan Sankur
1
+ PDF Chat Pure Nash Equilibria in Concurrent Deterministic Games 2015 Patricia Bouyer
Romain Brenguier
Nicolas Markey
Michael Ummels
1
+ PDF Chat Qualitative Concurrent Stochastic Games with Imperfect Information 2009 Vincent Gripon
Olivier Serre
1
+ PDF Chat Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees 2010 Vince Bárány
Łukasz Kaiser
Alexander Rabinovich
1
+ PDF Chat Deciding the value 1 problem for probabilistic leaktight automata 2015 Nathanaël Fijalkow
Hugo Gimbert
Edon Kelmendi
Youssouf Oualhadj
1
+ PDF Chat Degrees of Lookahead in Regular Infinite Games 2012 Michael Holtmann
Łukasz Kaiser
Wolfgang Thomas
1
+ PDF Chat Reasoning about Knowledge and Strategies: Epistemic Strategy Logic 2014 Francesco Belardinelli
1
+ PDF Chat Algorithms for Omega-Regular Games with Imperfect Information 2007 Krishnendu Chatterjee
Laurent Doyen
Thomas A. Henzinger
Jean-François Raskin
1
+ On expressive power and class invariance 2009 Yanjing Wang
Francien Dechesne
1
+ PDF Chat Quantified CTL: Expressiveness and Complexity 2014 François Laroussinie
Nicolas Markey
1
+ PDF Chat A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs 2016 Krishnendu Chatterjee
Martin Chmelík
Jessica Davies
1
+ PDF Chat On the Regular Emptiness Problem of Subzero Automata 2016 Henryk Michalewski
Matteo Mio
Mikołaj Bojańczyk
1
+ MSO+nabla is undecidable 2019 Mikołaj Bojańczyk
Edon Kelmendi
Michał Skrzypczak
1