Jean-François Raskin

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 139

Top Venues

Publications

Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
As Soon as Possible but Rationally. CoRR (2024)
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis. ACM Trans. Comput. Log. 25 (2) (2024)
Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents. CoRR (2024)
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
As Soon as Possible but Rationally. CONCUR (2024)
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
SynthLearn: A Tool for Guided Reactive Synthesis. Taming the Infinities of Concurrency (2024)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. MFCS (2023)
Damien Busatto-Gaston, Debraj Chakraborty, Anirban Majumdar, Sayan Mukherjee, Guillermo A. Pérez, Jean-François Raskin
Bi-objective Lexicographic Optimization in Markov Decision Processes with Related Objectives. ATVA (1) (2023)
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
LTL Reactive Synthesis with a Few Hints. TACAS (2) (2023)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
Rational verification and checking for Nash and subgame-perfect equilibria in graph games. CoRR (2023)
Damien Busatto-Gaston, Debraj Chakraborty, Anirban Majumdar, Sayan Mukherjee, Guillermo A. Pérez, Jean-François Raskin
Bi-Objective Lexicographic Optimization in Markov Decision Processes with Related Objectives. CoRR (2023)
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
Subgame-perfect Equilibria in Mean-payoff Games (journal version). Log. Methods Comput. Sci. 19 (4) (2023)
Debraj Chakraborty, Damien Busatto-Gaston, Jean-François Raskin, Guillermo A. Pérez
Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods. AAMAS (2023)
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
LTL Reactive Synthesis with a Few Hints. CoRR (2023)
Debraj Chakraborty, Damien Busatto-Gaston, Jean-François Raskin, Guillermo A. Pérez
Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods. CoRR (2023)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
The Complexity of SPEs in Mean-payoff Games. CoRR (2022)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Pareto-Rational Verification. CoRR (2022)
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata. Int. J. Softw. Tools Technol. Transf. 24 (4) (2022)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
The Complexity of SPEs in Mean-Payoff Games. ICALP (2022)
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis (Extended Version). CoRR (2022)
Wen-Chi Yang, Jean-François Raskin, Luc De Raedt
Lifted model checking for relational MDPs. Mach. Learn. 111 (10) (2022)
Gavin Rens, Wen-Chi Yang, Jean-François Raskin, Luc De Raedt
Learning Probabilistic Temporal Safety Properties from Examples in Relational Domains. CoRR (2022)
Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin
Strategy Synthesis for Global Window PCTL. ICALP (2022)
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
Subgame-perfect Equilibria in Mean-payoff Games (journal version). CoRR (2022)
Jean-François Raskin, Davide Bresolin
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020). Inf. Comput. 289 (Part) (2022)
Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin
Strategy Synthesis for Global Window PCTL. CoRR (2022)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Pareto-Rational Verification. CONCUR (2022)
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Correction to: Reactive synthesis without regret. Acta Informatica 59 (5) (2022)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
On the Complexity of SPEs in Parity Games. CSL (2022)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
Subgame-Perfect Equilibria in Mean-Payoff Games. CONCUR (2021)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis. CONCUR (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. DLT (2021)
Damien Busatto-Gaston, Debraj Chakraborty, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin
Safe Learning for Near-Optimal Scheduling. QEST (2021)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
Subgame-perfect Equilibria in Mean-payoff Games. CoRR (2021)
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
On the Complexity of SPEs in Parity Games. CoRR (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. CoRR (2021)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the existence of weak subgame perfect equilibria. Inf. Comput. 276 (2021)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
-regular Boolean objectives. Inf. Comput. 278 (2021)
Gavin Rens, Jean-François Raskin, Raphaël Reynouard, Giuseppe Marra
Online Learning of non-Markovian Reward Models. ICAART (2) (2021)
Mrudula Balachander, Shibashis Guha, Jean-François Raskin
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. CONCUR (2021)
Wen-Chi Yang, Jean-François Raskin, Luc De Raedt
Lifted Model Checking for Relational MDPs. CoRR (2021)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis (Full Version). CoRR (2021)
Mrudula Balachander, Shibashis Guha, Jean-François Raskin
Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower. CoRR (2020)
Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin
Safe Learning for Near Optimal Scheduling. CoRR (2020)
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
The Adversarial Stackelberg Value in Quantitative Games. CoRR (2020)
Raphaël Berthon, Shibashis Guha, Jean-François Raskin
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. LICS (2020)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
A Pattern Logic for Automata with Outputs. Int. J. Found. Comput. Sci. 31 (6) (2020)
Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin
Monte Carlo Tree Search guided by Symbolic Advice for MDPs. CoRR (2020)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi
Weighted Transducers for Robustness Verification. CONCUR (2020)
Raphaël Berthon, Shibashis Guha, Jean-François Raskin
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. CoRR (2020)
Gavin Rens, Jean-François Raskin
Learning Non-Markovian Reward Models in MDPs. CoRR (2020)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Log. Methods Comput. Sci. 16 (4) (2020)
Gavin Rens, Jean-François Raskin, Raphaël Reynouad, Giuseppe Marra
Online Learning of Non-Markovian Reward Models. CoRR (2020)
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
The Adversarial Stackelberg Value in Quantitative Games. ICALP (2020)
Damien Busatto-Gaston, Debraj Chakraborty, Jean-François Raskin
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. CONCUR (2020)
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
Energy mean-payoff games. CoRR (2019)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
Decidable weighted expressions with Presburger combinators. J. Comput. Syst. Sci. 106 (2019)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). CoRR (2019)
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
Expected Window Mean-Payoff. FSTTCS (2019)
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
Energy Mean-Payoff Games. CONCUR (2019)
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
Partial Solvers for Generalized Parity Games. CoRR (2019)
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
Partial Solvers for Generalized Parity Games. RP (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. CoRR (2019)
Maxime Cordy, Xavier Devroey, Axel Legay, Gilles Perrouin, Andreas Classen, Patrick Heymans, Pierre-Yves Schobbens, Jean-François Raskin
A Decade of Featured Transition Systems. From Software Engineering to Formal Methods and Tools, and Back (2019)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. CONCUR (2019)
Jan Kretínský, Guillermo A. Pérez, Jean-François Raskin
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. CoRR (2018)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
A Pattern Logic for Automata with Outputs. DLT (2018)
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Looking at mean payoff through foggy windows. Acta Informatica 55 (8) (2018)
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
Parameterized complexity of games with monotonically ordered omega-regular objectives. CONCUR (2018)
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard
Beyond Admissibility: Dominance Between Chains of Strategies. CSL (2018)
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
Visibly pushdown transducers. J. Comput. Syst. Sci. 97 (2018)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives. GandALF (2018)
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard
Beyond admissibility: Dominance between chains of strategies. CoRR (2018)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
A Pattern Logic for Automata with Outputs. CoRR (2018)
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
Rational Synthesis Under Imperfect Information. LICS (2018)
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
Minkowski Games. ACM Trans. Comput. Log. 19 (3) (2018)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. CoRR (2018)
Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin
Mean-payoff games with partial observation. Theor. Comput. Sci. 735 (2018)
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
Expected Window Mean-Payoff. CoRR (2018)
Gilles Geeraerts, Shibashis Guha, Jean-François Raskin
Safe and Optimal Scheduling for Hard and Soft Tasks. FSTTCS (2018)
Jan Kretínský, Guillermo A. Pérez, Jean-François Raskin
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. CONCUR (2018)
Mickael Randour, Jean-François Raskin, Ocan Sankur
Percentile queries in multi-dimensional Markov decision processes. Formal Methods Syst. Des. 50 (2-3) (2017)
Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic
Optimizing Expectation with Guarantees in POMDPs. AAAI (2017)
Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin
On delay and regret determinization of max-plus automata. LICS (2017)
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. TACAS (1) (2017)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
Decidable Weighted Expressions with Presburger Combinators. FCT (2017)
Romain Brenguier, Jean-François Raskin, Ocan Sankur
Assume-admissible synthesis. Acta Informatica 54 (1) (2017)
Raphaël Berthon, Mickael Randour, Jean-François Raskin
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. CoRR (2017)
Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR (2017)
Raphaël Berthon, Mickael Randour, Jean-François Raskin
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. ICALP (2017)
Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin
On Delay and Regret Determinization of Max-Plus Automata. CoRR (2017)
Nicolas Basset, Jean-François Raskin, Ocan Sankur
Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools (2017)
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
Decidable Weighted Expressions with Presburger Combinators. CoRR (2017)
Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin
Doomsday equilibria for omega-regular games. Inf. Comput. 254 (2017)
Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker
The first reactive synthesis competition (SYNTCOMP 2014). Int. J. Softw. Tools Technol. Transf. 19 (3) (2017)
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
Admissibility in Concurrent Games. CoRR (2017)
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
Admissiblity in Concurrent Games. ICALP (2017)
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
Minkowski Games. STACS (2017)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS (2017)
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Reactive synthesis without regret. Acta Informatica 54 (1) (2017)
Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur, Leander Tentrup
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. SYNT@CAV (2017)

Jean-François Raskin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean-François Raskin