Jean-Franois Raskin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
99
Venues
21
Active years
1997–2026
Best venue rank
A*
Where they publish
- BCONCUR22 papers
- BATVA13 papers
- A*ICALP12 papers
- ATACAS9 papers
- A*CAV8 papers
- BCSL8 papers
- BMFCS4 papers
- A*LICS4 papers
- ASTACS3 papers
- BVMCAI3 papers
- CDLT2 papers
- BSAS2 papers
- NationalSETTA1 paper
- BICAART1 paper
- A*AAAI1 paper
- BFCT1 paper
- BFOSSACS1 paper
- CLATA1 paper
- Journal PublishedEMSOFT1 paper
- A*ICSE1 paper
- BFM1 paper
Papers
99 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CAV | Synthesizing POMDP Policies: Sampling Meets Model-Checking via Learning. | Debraj Chakraborty, Anirban Majumdar, Prince Mathew, Sayan Mukherjee, Jean-Franois Raskin |
| 2026 | CONCUR | An Introduction to Multi-Environment Markov Decision Processes (Invited Talk). | Jean-Franois Raskin |
| 2026 | ICALP | Multi-Environment MDPs with Prior and Universal Semantics. | Benjamin Bordais, Jean-Franois Raskin |
| 2025 | ATVA | Learning Event-Recording Automata Passively. | Anirban Majumdar, Sayan Mukherjee, Jean-Franois Raskin |
| 2025 | CONCUR | The Non-Cooperative Rational Synthesis Problem for SPEs and ω-Regular Objectives. | Vronique Bruyre, Jean-Franois Raskin, Alexis Reynouard, Marie van den Bogaard |
| 2025 | ICALP | The Value Problem for Multiple-Environment MDPs with Parity Objective. | Krishnendu Chatterjee, Laurent Doyen, Jean-Franois Raskin, Ocan Sankur |
| 2025 | MFCS | Games with ω-Automatic Preference Relations. | Vronique Bruyre, Christophe Grandmont, Jean-Franois Raskin |
| 2024 | ATVA | Greybox Learning of Languages Recognizable by Event-Recording Automata. | Anirban Majumdar, Sayan Mukherjee, Jean-Franois Raskin |
| 2024 | CONCUR | As Soon as Possible but Rationally. | Vronique Bruyre, Christophe Grandmont, Jean-Franois Raskin |
| 2024 | SETTA | Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments. | Jean-Franois Raskin, Yun Chen Tsai |
| 2023 | ATVA | Bi-objective Lexicographic Optimization in Markov Decision Processes with Related Objectives. | Damien Busatto-Gaston, Debraj Chakraborty, Anirban Majumdar, Sayan Mukherjee, Guillermo A. Prez, Jean-Franois Raskin |
| 2023 | MFCS | Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. | Lonard Brice, Jean-Franois Raskin, Marie van den Bogaard |
| 2023 | TACAS | LTL Reactive Synthesis with a Few Hints. | Mrudula Balachander, Emmanuel Filiot, Jean-Franois Raskin |
| 2022 | CONCUR | Pareto-Rational Verification. | Vronique Bruyre, Jean-Franois Raskin, Clment Tamines |
| 2022 | CSL | On the Complexity of SPEs in Parity Games. | Lonard Brice, Jean-Franois Raskin, Marie van den Bogaard |
| 2022 | ICALP | Strategy Synthesis for Global Window PCTL. | Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-Franois Raskin |
| 2022 | ICALP | The Complexity of SPEs in Mean-Payoff Games. | Lonard Brice, Jean-Franois Raskin, Marie van den Bogaard |
| 2021 | CONCUR | Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. | Mrudula Balachander, Shibashis Guha, Jean-Franois Raskin |
| 2021 | CONCUR | Subgame-Perfect Equilibria in Mean-Payoff Games. | Lonard Brice, Jean-Franois Raskin, Marie van den Bogaard |
| 2021 | CONCUR | Stackelberg-Pareto Synthesis. | Vronique Bruyre, Jean-Franois Raskin, Clment Tamines |
| 2021 | DLT | Active Learning of Sequential Transducers with Side Information About the Domain. | Raphal Berthon, Adrien Boiret, Guillermo A. Prez, Jean-Franois Raskin |
| 2021 | ICAART | Online Learning of non-Markovian Reward Models. | Gavin Rens, Jean-Franois Raskin, Raphal Reynouard, Giuseppe Marra |
| 2020 | CONCUR | Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. | Damien Busatto-Gaston, Debraj Chakraborty, Jean-Franois Raskin |
| 2020 | CONCUR | Weighted Transducers for Robustness Verification. | Emmanuel Filiot, Nicolas Mazzocchi, Jean-Franois Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi |
| 2020 | ICALP | The Adversarial Stackelberg Value in Quantitative Games. | Emmanuel Filiot, Raffaella Gentilini, Jean-Franois Raskin |
| 2020 | LICS | Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. | Raphal Berthon, Shibashis Guha, Jean-Franois Raskin |
| 2019 | CONCUR | The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. | Thomas Brihaye, Vronique Bruyre, Aline Goeminne, Jean-Franois Raskin, Marie van den Bogaard |
| 2019 | CONCUR | Energy Mean-Payoff Games. | Vronique Bruyre, Quentin Hautem, Mickael Randour, Jean-Franois Raskin |
| 2018 | CONCUR | Parameterized complexity of games with monotonically ordered omega-regular objectives. | Vronique Bruyre, Quentin Hautem, Jean-Franois Raskin |
| 2018 | CONCUR | Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. | Jan Kretnsk, Guillermo A. Prez, Jean-Franois Raskin |
| 2018 | CSL | Beyond Admissibility: Dominance Between Chains of Strategies. | Nicolas Basset, Ismal Jecker, Arno Pauly, Jean-Franois Raskin, Marie van den Bogaard |
| 2018 | DLT | A Pattern Logic for Automata with Outputs. | Emmanuel Filiot, Nicolas Mazzocchi, Jean-Franois Raskin |
| 2018 | LICS | Rational Synthesis Under Imperfect Information. | Emmanuel Filiot, Raffaella Gentilini, Jean-Franois Raskin |
| 2017 | AAAI | Optimizing Expectation with Guarantees in POMDPs. | Krishnendu Chatterjee, Petr Novotn, Guillermo A. Prez, Jean-Franois Raskin, Dorde Zikelic |
| 2017 | CONCUR | Admissibility in Games with Imperfect Information (Invited Talk). | Romain Brenguier, Arno Pauly, Jean-Franois Raskin, Ocan Sankur |
| 2017 | FCT | Decidable Weighted Expressions with Presburger Combinators. | Emmanuel Filiot, Nicolas Mazzocchi, Jean-Franois Raskin |
| 2017 | FOSSACS | On the Existence of Weak Subgame Perfect Equilibria. | Vronique Bruyre, Stphane Le Roux, Arno Pauly, Jean-Franois Raskin |
| 2017 | ICALP | Admissiblity in Concurrent Games. | Nicolas Basset, Gilles Geeraerts, Jean-Franois Raskin, Ocan Sankur |
| 2017 | ICALP | Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. | Raphal Berthon, Mickael Randour, Jean-Franois Raskin |
| 2017 | LICS | On delay and regret determinization of max-plus automata. | Emmanuel Filiot, Ismal Jecker, Nathan Lhote, Guillermo A. Prez, Jean-Franois Raskin |
| 2017 | STACS | Minkowski Games. | Stphane Le Roux, Arno Pauly, Jean-Franois Raskin |
| 2017 | TACAS | From LTL and Limit-Deterministic Bchi Automata to Deterministic Parity Automata. | Javier Esparza, Jan Kretnsk, Jean-Franois Raskin, Salomon Sickert |
| 2016 | CONCUR | On the Complexity of Heterogeneous Multidimensional Games. | Vronique Bruyre, Quentin Hautem, Jean-Franois Raskin |
| 2016 | CSL | Minimizing Regret in Discounted-Sum Games. | Paul Hunter, Guillermo A. Prez, Jean-Franois Raskin |
| 2016 | ICALP | The Complexity of Rational Synthesis. | Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-Franois Raskin |
| 2016 | LATA | Non-Zero Sum Games for Reactive Synthesis. | Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Prez, Mickael Randour, Jean-Franois Raskin, Ocan Sankur, Mathieu Sassolas |
| 2015 | ATVA | Looking at Mean-Payoff Through Foggy Windows. | Paul Hunter, Guillermo A. Prez, Jean-Franois Raskin |
| 2015 | CAV | Pareto Curves of Multidimensional Mean-Payoff Games. | Romain Brenguier, Jean-Franois Raskin |
| 2015 | CAV | Percentile Queries in Multi-dimensional Markov Decision Processes. | Mickael Randour, Jean-Franois Raskin, Ocan Sankur |
| 2015 | CONCUR | Assume-Admissible Synthesis. | Romain Brenguier, Jean-Franois Raskin, Ocan Sankur |
| 2015 | CONCUR | Reactive Synthesis Without Regret. | Paul Hunter, Guillermo A. Prez, Jean-Franois Raskin |
| 2015 | CSL | Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. | Thomas Brihaye, Vronique Bruyre, Nomie Meunier, Jean-Franois Raskin |
| 2015 | LICS | Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. | Lorenzo Clemente, Jean-Franois Raskin |
| 2015 | VMCAI | Variations on the Stochastic Shortest Path Problem. | Mickael Randour, Jean-Franois Raskin, Ocan Sankur |
| 2014 | CSL | The complexity of admissibility in Omega-regular games. | Romain Brenguier, Jean-Franois Raskin, Mathieu Sassolas |
| 2014 | CSL | Secure equilibria in weighted games. | Vronique Bruyre, Nomie Meunier, Jean-Franois Raskin |
| 2014 | STACS | Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. | Vronique Bruyre, Emmanuel Filiot, Mickael Randour, Jean-Franois Raskin |
| 2014 | VMCAI | Doomsday Equilibria for Omega-Regular Games. | Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-Franois Raskin |
| 2013 | ATVA | Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Jol Ouaknine, Jean-Franois Raskin, James Worrell |
| 2013 | ATVA | Looking at Mean-Payoff and Total-Payoff through Windows. | Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-Franois Raskin |
| 2013 | TACAS | Synthesis from LTL Specifications with Mean-Payoff Objectives. | Aaron Bohy, Vronique Bruyre, Emmanuel Filiot, Jean-Franois Raskin |
| 2012 | ATVA | Controllers with Minimal Observation Power (Application to Timed Systems). | Peter E. Bulychev, Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Jean-Franois Raskin, Pierre-Alain Reynier |
| 2012 | CAV | Acacia+, a Tool for LTL Synthesis. | Aaron Bohy, Vronique Bruyre, Emmanuel Filiot, Naiyong Jin, Jean-Franois Raskin |
| 2012 | CONCUR | Strategy Synthesis for Multi-Dimensional Quantitative Objectives. | Krishnendu Chatterjee, Mickael Randour, Jean-Franois Raskin |
| 2012 | CONCUR | Quantitative Languages Defined by Functional Automata. | Emmanuel Filiot, Raffaella Gentilini, Jean-Franois Raskin |
| 2011 | ATVA | Antichain-Based QBF Solving. | Thomas Brihaye, Vronique Bruyre, Laurent Doyen, Marc Ducobu, Jean-Franois Raskin |
| 2011 | ICALP | On Reachability for Hybrid Automata over Bounded Time. | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Jol Ouaknine, Jean-Franois Raskin, James Worrell |
| 2010 | ATVA | Compositional Algorithms for LTL Synthesis. | Emmanuel Filiot, Naiyong Jin, Jean-Franois Raskin |
| 2010 | ATVA | Lattice-Valued Binary Decision Diagrams. | Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-Franois Raskin |
| 2010 | CSL | Energy and Mean-Payoff Games with Imperfect Information. | Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-Franois Raskin, Szymon Torunczyk |
| 2010 | EMSOFT | Quantitative system validation in model driven design. | Holger Hermanns, Kim Guldstrand Larsen, Jean-Franois Raskin, Jan Tretmans |
| 2010 | ICSE | Model checking lots of systems: efficient verification of temporal properties in software product lines. | Andreas Classen, Patrick Heymans, Pierre-Yves Schobbens, Axel Legay, Jean-Franois Raskin |
| 2010 | MFCS | Iterated Regret Minimization in Game Graphs. | Emmanuel Filiot, Tristan Le Gall, Jean-Franois Raskin |
| 2010 | MFCS | Properties of Visibly Pushdown Transducers. | Emmanuel Filiot, Jean-Franois Raskin, Pierre-Alain Reynier, Frdric Servais, Jean-Marc Talbot |
| 2010 | TACAS | Antichain Algorithms for Finite Automata. | Laurent Doyen, Jean-Franois Raskin |
| 2009 | CAV | An Antichain Algorithm for LTL Realizability. | Emmanuel Filiot, Naiyong Jin, Jean-Franois Raskin |
| 2008 | ATVA | Alaska. | Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-Franois Raskin |
| 2008 | ICALP | Visibly Pushdown Transducers. | Jean-Franois Raskin, Frdric Servais |
| 2008 | TACAS | Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. | Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-Franois Raskin |
| 2007 | ATVA | Timed Control with Observation Based and Stuttering Invariant Strategies. | Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, Jean-Franois Raskin |
| 2007 | ATVA | On the Efficient Computation of the Minimal Coverability Set for Petri Nets. | Gilles Geeraerts, Jean-Franois Raskin, Laurent Van Begin |
| 2007 | ICALP | Minimum-Time Reachability in Timed Games. | Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-Franois Raskin |
| 2007 | SAS | Fixpoint-Guided Abstraction Refinements. | Patrick Cousot, Pierre Ganty, Jean-Franois Raskin |
| 2007 | TACAS | Improved Algorithms for the Automata-Based Approach to Model-Checking. | Laurent Doyen, Jean-Franois Raskin |
| 2006 | CAV | Antichains: A New Algorithm for Checking Universality of Finite Automata. | Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jean-Franois Raskin |
| 2006 | CSL | Algorithms for Omega-Regular Games with Imperfect Information | Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-Franois Raskin |
| 2006 | VMCAI | A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. | Pierre Ganty, Jean-Franois Raskin, Laurent Van Begin |
| 2005 | CAV | Expand, Enlarge and Check... Made Efficient. | Gilles Geeraerts, Jean-Franois Raskin, Laurent Van Begin |
| 2005 | FM | Systematic Implementation of Real-Time Models. | Martin De Wulf, Laurent Doyen, Jean-Franois Raskin |
| 2004 | CONCUR | Model Checking Restricted Sets of Timed Paths. | Nicolas Markey, Jean-Franois Raskin |
| 2003 | STACS | Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. | Vronique Bruyre, Emmanuel Dall'Olio, Jean-Franois Raskin |
| 2002 | TACAS | Towards the Automated Verification of Multithreaded Java Programs. | Giorgio Delzanno, Jean-Franois Raskin, Laurent Van Begin |
| 2001 | CAV | Attacking Symbolic State Explosion. | Giorgio Delzanno, Jean-Franois Raskin, Laurent Van Begin |
| 2001 | CONCUR | A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. | Steve Kremer, Jean-Franois Raskin |
| 2000 | SAS | Abstract Interpretation of Game Properties. | Thomas A. Henzinger, Rupak Majumdar, Freddy Y. C. Mang, Jean-Franois Raskin |
| 2000 | TACAS | Symbolic Representation of Upward-Closed Sets. | Giorgio Delzanno, Jean-Franois Raskin |
| 1998 | CONCUR | Axioms for Real-Time Logics. | Jean-Franois Raskin, Pierre-Yves Schobbens, Thomas A. Henzinger |
| 1998 | ICALP | The Regular Real-Time Languages. | Thomas A. Henzinger, Jean-Franois Raskin, Pierre-Yves Schobbens |
| 1997 | TACAS | Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time. | Jean-Franois Raskin, Pierre-Yves Schobbens |