Jean-François Raskin

308 papers A* 19A 13B 55C 5Misc 2Journal 145Unranked 61
YearRankTypeTitle / Venue / Authors
2026 J jnl
An Automata-Based Approach to Games with ω-Automatic Preferences.
CoRR
Véronique Bruyère, Emmanuel Filiot, Christophe Grandmont, Jean-François Raskin
2026 J jnl
Multi-Environment MDPs with Prior and Universal Semantics.
CoRR
Benjamin Bordais, Jean-François Raskin
2025 — conf
A Zone-Based Algorithm for Timed Parity Games.
FSTTCS
Gilles Geeraerts, Frédéric Herbreteau, Jean-François Raskin, Alexis Reynouard
2025 J jnl
A Zone-Based Algorithm for Timed Parity Games.
CoRR
Gilles Geeraerts, Frédéric Herbreteau, Jean-François Raskin, Alexis Reynouard
2025 B conf
Games with ω-Automatic Preference Relations.
MFCS
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2025 J jnl
Games with ω-Automatic Preference Relations.
CoRR
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2025 J jnl
LTL Reactive Synthesis with a Few Hints.
J. Autom. Reason.
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
2025 B conf
Learning Event-Recording Automata Passively.
ATVA
Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
2025 J jnl
Learning Event-recording Automata Passively.
CoRR
Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
2025 A conf
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents.
CSF
Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard
2025 B conf
The Non-Cooperative Rational Synthesis Problem for SPEs and ω-Regular Objectives.
CONCUR
Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard
2025 A* conf
The Value Problem for Multiple-Environment MDPs with Parity Objective.
ICALP
Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin, Ocan Sankur
2025 J jnl
The Value Problem for Multiple-Environment MDPs with Parity Objective.
CoRR
Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin, Ocan Sankur
2024 — conf
Algorithms for Robbins' Problem Using Markov Decision Processes.
Principles of Verification (2)
Léonard Brice, F. Thomas Bruss, Anirban Majumdar, Jean-François Raskin
2024 B conf
As Soon as Possible but Rationally.
CONCUR
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2024 J jnl
As Soon as Possible but Rationally.
CoRR
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2024 B conf
Greybox Learning of Languages Recognizable by Event-Recording Automata.
ATVA
Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
2024 J jnl
Greybox Learning of Languages Recognizable by Event-Recording Automata.
CoRR
Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
2024 J jnl
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents.
CoRR
Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard
2024 J jnl
Stackelberg-Pareto Synthesis.
ACM Trans. Comput. Log.
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
2024 — conf
SynthLearn: A Tool for Guided Reactive Synthesis.
Taming the Infinities of Concurrency
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
2024 Misc conf
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments.
SETTA
Jean-François Raskin, Yun Chen Tsai
2024 J jnl
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments.
CoRR
Jean-François Raskin, Yun Chen Tsai
2024 J jnl
The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives.
CoRR
Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard
2023 B ed.
34th International Conference on Concurrency Theory, CONCUR 2023, Antwerp, Belgium, September 18-23, 2023
CONCUR
Guillermo A. Pérez, Jean-François Raskin
2023 J jnl
Bi-Objective Lexicographic Optimization in Markov Decision Processes with Related Objectives.
CoRR
Damien Busatto-Gaston, Debraj Chakraborty, Anirban Majumdar, Sayan Mukherjee, Guillermo A. Pérez, Jean-François Raskin
2023 — conf
Bi-objective Lexicographic Optimization in Markov Decision Processes with Related Objectives.
ATVA (1)
Damien Busatto-Gaston, Debraj Chakraborty, Anirban Majumdar, Sayan Mukherjee, Guillermo A. Pérez, Jean-François Raskin
2023 A conf
Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods.
AAMAS
Debraj Chakraborty, Damien Busatto-Gaston, Jean-François Raskin, Guillermo A. Pérez
2023 J jnl
Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods.
CoRR
Debraj Chakraborty, Damien Busatto-Gaston, Jean-François Raskin, Guillermo A. Pérez
2023 — conf
LTL Reactive Synthesis with a Few Hints.
TACAS (2)
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
2023 J jnl
LTL Reactive Synthesis with a Few Hints.
CoRR
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
2023 B conf
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games.
MFCS
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2023 J jnl
Rational verification and checking for Nash and subgame-perfect equilibria in graph games.
CoRR
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2023 J jnl
Subgame-perfect Equilibria in Mean-payoff Games (journal version).
Log. Methods Comput. Sci.
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
2022 J jnl
Correction to: Reactive synthesis without regret.
Acta Informatica
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2022 J jnl
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata.
Int. J. Softw. Tools Technol. Transf.
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
2022 J jnl
Learning Probabilistic Temporal Safety Properties from Examples in Relational Domains.
CoRR
Gavin Rens, Wen-Chi Yang, Jean-François Raskin, Luc De Raedt
2022 J jnl
Lifted model checking for relational MDPs.
Mach. Learn.
Wen-Chi Yang, Jean-François Raskin, Luc De Raedt
2022 B conf
On the Complexity of SPEs in Parity Games.
CSL
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2022 B conf
Pareto-Rational Verification.
CONCUR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2022 J jnl
Pareto-Rational Verification.
CoRR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2022 — ed.
Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday
Principles of Systems Design
Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar
2022 J jnl
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020).
Inf. Comput.
Jean-François Raskin, Davide Bresolin
2022 J jnl
Stackelberg-Pareto Synthesis (Extended Version).
CoRR
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
2022 A* conf
Strategy Synthesis for Global Window PCTL.
ICALP
Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin
2022 J jnl
Strategy Synthesis for Global Window PCTL.
CoRR
Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin
2022 J jnl
Subgame-perfect Equilibria in Mean-payoff Games (journal version).
CoRR
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
2022 A* conf
The Complexity of SPEs in Mean-Payoff Games.
ICALP
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2022 J jnl
The Complexity of SPEs in Mean-payoff Games.
CoRR
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2021 C conf
Active Learning of Sequential Transducers with Side Information About the Domain.
DLT
Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez, Jean-François Raskin
2021 J jnl
Active Learning of Sequential Transducers with Side Information about the Domain.
CoRR
Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez, Jean-François Raskin
2021 J jnl
Constrained existence problem for weak subgame perfect equilibria with
Inf. Comput.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2021 B conf
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games.
CONCUR
Mrudula Balachander, Shibashis Guha, Jean-François Raskin
2021 J jnl
Lifted Model Checking for Relational MDPs.
CoRR
Wen-Chi Yang, Jean-François Raskin, Luc De Raedt
2021 J jnl
On the Complexity of SPEs in Parity Games.
CoRR
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
2021 J jnl
On the existence of weak subgame perfect equilibria.
Inf. Comput.
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2021 — conf
Online Learning of non-Markovian Reward Models.
ICAART (2)
Gavin Rens, Jean-François Raskin, Raphaël Reynouard, Giuseppe Marra
2021 — conf
Safe Learning for Near-Optimal Scheduling.
QEST
Damien Busatto-Gaston, Debraj Chakraborty, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin
2021 J jnl
Stackelberg-Pareto Synthesis (Full Version).
CoRR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2021 B conf
Stackelberg-Pareto Synthesis.
CONCUR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2021 B conf
Subgame-Perfect Equilibria in Mean-Payoff Games.
CONCUR
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2021 J jnl
Subgame-perfect Equilibria in Mean-payoff Games.
CoRR
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
2020 J jnl
A Pattern Logic for Automata with Outputs.
Int. J. Found. Comput. Sci.
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
2020 J jnl
Learning Non-Markovian Reward Models in MDPs.
CoRR
Gavin Rens, Jean-François Raskin
2020 A* conf
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes.
LICS
Raphaël Berthon, Shibashis Guha, Jean-François Raskin
2020 J jnl
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes.
CoRR
Raphaël Berthon, Shibashis Guha, Jean-François Raskin
2020 B conf
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs.
CONCUR
Damien Busatto-Gaston, Debraj Chakraborty, Jean-François Raskin
2020 J jnl
Monte Carlo Tree Search guided by Symbolic Advice for MDPs.
CoRR
Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin
2020 J jnl
Online Learning of Non-Markovian Reward Models.
CoRR
Gavin Rens, Jean-François Raskin, Raphaël Reynouad, Giuseppe Marra
2020 — ed.
Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2020, Brussels, Belgium, September 21-22, 2020.
GandALF
Jean-François Raskin, Davide Bresolin
2020 J jnl
Safe Learning for Near Optimal Scheduling.
CoRR
Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin
2020 J jnl
Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower.
CoRR
Mrudula Balachander, Shibashis Guha, Jean-François Raskin
2020 A* conf
The Adversarial Stackelberg Value in Quantitative Games.
ICALP
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2020 J jnl
The Adversarial Stackelberg Value in Quantitative Games.
CoRR
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2020 J jnl
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
Log. Methods Comput. Sci.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2020 B conf
Weighted Transducers for Robustness Verification.
CONCUR
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi
2019 — conf
A Decade of Featured Transition Systems.
From Software Engineering to Formal Methods and Tools, and Back
Maxime Cordy, Xavier Devroey, Axel Legay, Gilles Perrouin, Andreas Classen, Patrick Heymans, Pierre-Yves Schobbens, Jean-François Raskin
2019 J jnl
Decidable weighted expressions with Presburger combinators.
J. Comput. Syst. Sci.
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
2019 B conf
Energy Mean-Payoff Games.
CONCUR
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
2019 J jnl
Energy mean-payoff games.
CoRR
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
2019 — conf
Expected Window Mean-Payoff.
FSTTCS
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
2019 J jnl
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable.
CoRR
Raphaël Berthon, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Jean-François Raskin, Sasha Rubin
2019 — conf
Partial Solvers for Generalized Parity Games.
RP
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
2019 J jnl
Partial Solvers for Generalized Parity Games.
CoRR
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
2019 — ed.
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September 2019.
GandALF
Jérôme Leroux, Jean-François Raskin
2019 J jnl
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version).
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2019 B conf
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
CONCUR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2018 C conf
A Pattern Logic for Automata with Outputs.
DLT
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
2018 J jnl
A Pattern Logic for Automata with Outputs.
CoRR
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
2018 B conf
Beyond Admissibility: Dominance Between Chains of Strategies.
CSL
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard
2018 J jnl
Beyond admissibility: Dominance between chains of strategies.
CoRR
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard
2018 — conf
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives.
GandALF
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2018 J jnl
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives.
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2018 J jnl
Expected Window Mean-Payoff.
CoRR
Benjamin Bordais, Shibashis Guha, Jean-François Raskin
2018 B conf
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints.
CONCUR
Jan Kretínský, Guillermo A. Pérez, Jean-François Raskin
2018 J jnl
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints.
CoRR
Jan Kretínský, Guillermo A. Pérez, Jean-François Raskin
2018 J jnl
Looking at mean payoff through foggy windows.
Acta Informatica
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2018 J jnl
Mean-payoff games with partial observation.
Theor. Comput. Sci.
Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin
2018 J jnl
Minkowski Games.
ACM Trans. Comput. Log.
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2018 B conf
Parameterized complexity of games with monotonically ordered omega-regular objectives.
CONCUR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2018 A* conf
Rational Synthesis Under Imperfect Information.
LICS
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2018 — conf
Safe and Optimal Scheduling for Hard and Soft Tasks.
FSTTCS
Gilles Geeraerts, Shibashis Guha, Jean-François Raskin
2018 — ch.
Symbolic Model Checking in Non-Boolean Domains.
Handbook of Model Checking
Rupak Majumdar, Jean-François Raskin
2018 J jnl
Visibly pushdown transducers.
J. Comput. Syst. Sci.
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2017 B ed.
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, August 21-25, 2017
MFCS
Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin
2017 J jnl
Admissibility in Concurrent Games.
CoRR
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
2017 B conf
Admissibility in Games with Imperfect Information (Invited Talk).
CONCUR
Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur
2017 — conf
Admissible Strategies in Timed Games.
Models, Algorithms, Logics and Tools
Nicolas Basset, Jean-François Raskin, Ocan Sankur
2017 A* conf
Admissiblity in Concurrent Games.
ICALP
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
2017 J jnl
Assume-admissible synthesis.
Acta Informatica
Romain Brenguier, Jean-François Raskin, Ocan Sankur
2017 B conf
Decidable Weighted Expressions with Presburger Combinators.
FCT
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
2017 J jnl
Decidable Weighted Expressions with Presburger Combinators.
CoRR
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin
2017 J jnl
Doomsday equilibria for omega-regular games.
Inf. Comput.
Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin
2017 — conf
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
TACAS (1)
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
2017 J jnl
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
CoRR
Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert
2017 J jnl
Games with lexicographically ordered $ω$-regular objectives.
CoRR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2017 J jnl
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.
Inf. Comput.
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2017 A conf
Minkowski Games.
STACS
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2017 J jnl
On Delay and Regret Determinization of Max-Plus Automata.
CoRR
Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin
2017 A* conf
On delay and regret determinization of max-plus automata.
LICS
Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin
2017 B conf
On the Existence of Weak Subgame Perfect Equilibria.
FoSSaCS
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2017 A* conf
Optimizing Expectation with Guarantees in POMDPs.
AAAI
Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic
2017 J jnl
Percentile queries in multi-dimensional Markov decision processes.
Formal Methods Syst. Des.
Mickael Randour, Jean-François Raskin, Ocan Sankur
2017 J jnl
Reactive synthesis without regret.
Acta Informatica
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2017 J jnl
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
Acta Informatica
Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand
2017 — conf
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results.
SYNT@CAV
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
2017 J jnl
The first reactive synthesis competition (SYNTCOMP 2014).
Int. J. Softw. Tools Technol. Transf.
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
2017 A* conf
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes.
ICALP
Raphaël Berthon, Mickael Randour, Jean-François Raskin
2017 J jnl
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes.
CoRR
Raphaël Berthon, Mickael Randour, Jean-François Raskin
2016 — ch.
A Tutorial on Mean-payoff and Energy Games.
Dependable Software Systems Engineering
Jean-François Raskin
2016 — conf
Admissibility in Quantitative Graph Games.
FSTTCS
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2016 J jnl
Admissibility in Quantitative Graph Games.
CoRR
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2016 B conf
Minimizing Regret in Discounted-Sum Games.
CSL
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2016 J jnl
Minkowski games.
CoRR
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2016 C conf
Non-Zero Sum Games for Reactive Synthesis.
LATA
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2016 B conf
On the Complexity of Heterogeneous Multidimensional Games.
CONCUR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2016 J jnl
On the existence of weak subgame perfect equilibria.
CoRR
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2016 J jnl
Optimizing Expectation with Guarantees in POMDPs (Technical Report).
CoRR
Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic
2016 — conf
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
SYNT@CAV
Swen Jacobs, Roderick Bloem, Romain Brenguier, Ayrat Khalimov, Felix Klein, Robert Könighofer, Jens Kreber, Alexander Legg, Nina Narodytska, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker
2016 A* conf
The Complexity of Rational Synthesis.
ICALP
Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2016 A ed.
Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings
TACAS
Marsha Chechik, Jean-François Raskin
2015 B conf
Assume-Admissible Synthesis.
CONCUR
Romain Brenguier, Jean-François Raskin, Ocan Sankur
2015 J jnl
Assume-Admissible Synthesis.
CoRR
Romain Brenguier, Jean-François Raskin, Ocan Sankur
2015 — conf
Compositional Algorithms for Succinct Safety Games.
SYNT
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2015 B conf
Looking at Mean-Payoff Through Foggy Windows.
ATVA
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Looking at Mean-Payoff through Foggy Windows.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Looking at mean-payoff and total-payoff through windows.
Inf. Comput.
Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin
2015 J jnl
Minimizing Regret in Discounted-Sum Games.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 A* conf
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives.
LICS
Lorenzo Clemente, Jean-François Raskin
2015 J jnl
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives.
CoRR
Lorenzo Clemente, Jean-François Raskin
2015 J jnl
Non-Zero Sum Games for Reactive Synthesis.
CoRR
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2015 J jnl
On the Verification of Concurrent, Asynchronous Programs with Waiting Queues.
ACM Trans. Embed. Comput. Syst.
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
2015 J jnl
On the complexity of heterogeneous multidimensional quantitative games.
CoRR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2015 — conf
Pareto Curves of Multidimensional Mean-Payoff Games.
CAV (2)
Romain Brenguier, Jean-François Raskin
2015 — conf
Percentile Queries in Multi-dimensional Markov Decision Processes.
CAV (1)
Mickael Randour, Jean-François Raskin, Ocan Sankur
2015 J jnl
Quantitative Languages Defined by Functional Automata
Log. Methods Comput. Sci.
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2015 B conf
Reactive Synthesis Without Regret.
CONCUR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Reactive Synthesis Without Regret.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
The First Reactive Synthesis Competition (SYNTCOMP 2014).
CoRR
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
2015 — conf
The Second Reactive Synthesis Competition (SYNTCOMP 2015).
SYNT
Swen Jacobs, Roderick Bloem, Romain Brenguier, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker
2015 J jnl
The complexity of multi-mean-payoff and multi-energy games.
Inf. Comput.
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin
2015 J jnl
The equivalence problem for finite automata: technical perspective.
Commun. ACM
Thomas A. Henzinger, Jean-François Raskin
2015 B conf
Variations on the Stochastic Shortest Path Problem.
VMCAI
Mickael Randour, Jean-François Raskin, Ocan Sankur
2015 B conf
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CSL
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2015 J jnl
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CoRR
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2015 J jnl
ω-Petri Nets: Algorithms and Complexity.
Fundam. Informaticae
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
2014 — conf
AbsSynthe: abstract synthesis from succinct safety specifications.
SYNT
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2014 B ed.
Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings
ATVA
Franck Cassez, Jean-François Raskin
2014 B conf
Doomsday Equilibria for Omega-Regular Games.
VMCAI
Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin
2014 — conf
Energy and mean-payoff timed games.
HSCC
Romain Brenguier, Franck Cassez, Jean-François Raskin
2014 — conf
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs.
SR
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2014 — conf
Finite-Valued Weighted Automata.
FSTTCS
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2014 — conf
Mean-Payoff Games with Partial-Observation - (Extended Abstract).
RP
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2014 A conf
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
STACS
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2014 — conf
Multiple-Environment Markov Decision Processes.
FSTTCS
Jean-François Raskin, Ocan Sankur
2014 J jnl
Multiple-Environment Markov Decision Processes.
CoRR
Jean-François Raskin, Ocan Sankur
2014 J jnl
On regions and zones for event-clock automata.
Formal Methods Syst. Des.
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2014 J jnl
Percentile Queries in Multi-Dimensional Markov Decision Processes.
CoRR
Mickael Randour, Jean-François Raskin, Ocan Sankur
2014 — conf
Quantitative Games with Interval Objectives.
FSTTCS
Paul Hunter, Jean-François Raskin
2014 J jnl
Quantitative games with interval objectives.
CoRR
Paul Hunter, Jean-François Raskin
2014 J jnl
Secure Equilibria in Weighted Games.
CoRR
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2014 — conf
Secure equilibria in weighted games.
CSL-LICS
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2014 J jnl
Strategy synthesis for multi-dimensional quantitative objectives.
Acta Informatica
Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin
2014 J jnl
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
CoRR
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
2014 — conf
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes.
SYNT
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
2014 — conf
The complexity of admissibility in Omega-regular games.
CSL-LICS
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
2014 J jnl
Variations on the Stochastic Shortest Path Problem.
CoRR
Mickael Randour, Jean-François Raskin, Ocan Sankur
2013 J jnl
Doomsday Equilibria for Omega-Regular Games.
CoRR
Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin
2013 J jnl
Exploiting structure in LTL synthesis.
Int. J. Softw. Tools Technol. Transf.
Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2013 J jnl
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking.
IEEE Trans. Software Eng.
Andreas Classen, Maxime Cordy, Pierre-Yves Schobbens, Patrick Heymans, Axel Legay, Jean-François Raskin
2013 J jnl
Looking at Mean-Payoff and Total-Payoff through Windows
CoRR
Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin
2013 B conf
Looking at Mean-Payoff and Total-Payoff through Windows.
ATVA
Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin
2013 J jnl
Mean-payoff Games with Incomplete Information.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2013 J jnl
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
CoRR
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2013 — conf
Optimal Bounds for Multiweighted and Parametrised Energy Games.
Theories of Programming and Formal Methods
Line Juhl, Kim Guldstrand Larsen, Jean-François Raskin
2013 — conf
Queue-Dispatch Asynchronous Systems.
ACSD
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
2013 A conf
Synthesis from LTL Specifications with Mean-Payoff Objectives.
TACAS
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
2013 J jnl
The Complexity of Admissibility in Omega-Regular Games
CoRR
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
2013 B conf
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
ATVA
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2013 B conf
ω-Petri Nets.
Petri Nets
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
2013 J jnl
ω-Petri nets
CoRR
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
2012 A* conf
Acacia+, a Tool for LTL Synthesis.
CAV
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2012 J jnl
Controllers with Minimal Observation Power (Application to Timed Systems)
CoRR
Peter E. Bulychev, Franck Cassez, Alexandre David, Kim G. Larsen, Jean-François Raskin, Pierre-Alain Reynier
2012 B conf
Controllers with Minimal Observation Power (Application to Timed Systems).
ATVA
Peter E. Bulychev, Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier
2012 B conf
Quantitative Languages Defined by Functional Automata.
CONCUR
Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2012 J jnl
Queue-Dispatch Asynchronous Systems
CoRR
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
2012 B conf
Strategy Synthesis for Multi-Dimensional Quantitative Objectives.
CONCUR
Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin
2012 J jnl
Strategy Synthesis for Multi-dimensional Quantitative Objectives
CoRR
Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin
2012 J jnl
Synthesis from LTL Specifications with Mean-Payoff Objectives
CoRR
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
2012 J jnl
The Complexity of Multi-Mean-Payoff and Multi-Energy Games
CoRR
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin
2012 J jnl
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
CoRR
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011 B conf
Antichain-Based QBF Solving.
ATVA
Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin
2011 J jnl
Antichains and compositional algorithms for LTL synthesis.
Formal Methods Syst. Des.
Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2011 — conf
Event Clock Automata: From Theory to Practice.
FORMATS
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2011 J jnl
Event-Clock Automata: From Theory to Practice
CoRR
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2011 J jnl
Faster algorithms for mean-payoff games.
Formal Methods Syst. Des.
Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin
2011 — ch.
Games with imperfect information: theory and algorithms.
Lectures in Game Theory for Computer Scientists
Laurent Doyen, Jean-François Raskin
2011 J jnl
On Reachability for Hybrid Automata over Bounded Time
CoRR
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011 — conf
On Reachability for Hybrid Automata over Bounded Time.
ICALP (2)
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011 — conf
Reachability Problems for Hybrid Automata.
RP
Jean-François Raskin
2010 A conf
Antichain Algorithms for Finite Automata.
TACAS
Laurent Doyen, Jean-François Raskin
2010 B conf
Compositional Algorithms for LTL Synthesis.
ATVA
Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2010 B conf
Energy and Mean-Payoff Games with Imperfect Information.
CSL
Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk
2010 J jnl
Fixed point guided abstraction refinement for alternating automata.
Theor. Comput. Sci.
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
2010 J jnl
Generalized Mean-payoff and Energy Games
CoRR
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2010 — conf
Generalized Mean-payoff and Energy Games.
FSTTCS
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2010 J jnl
Iterated Regret Minimization in Game Graphs
CoRR
Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin
2010 B conf
Iterated Regret Minimization in Game Graphs.
MFCS
Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin
2010 B conf
Lattice-Valued Binary Decision Diagrams.
ATVA
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin
2010 — conf
Model checking lots of systems: efficient verification of temporal properties in software product lines.
ICSE (1)
Andreas Classen, Patrick Heymans, Pierre-Yves Schobbens, Axel Legay, Jean-François Raskin
2010 J jnl
On Functionality of Visibly Pushdown Transducers
CoRR
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2010 J jnl
On the Efficient Computation of the Minimal Coverability Set of Petri Nets.
Int. J. Found. Comput. Sci.
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2010 B conf
Properties of Visibly Pushdown Transducers.
MFCS
Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2010 Misc conf
Quantitative system validation in model driven design.
EMSOFT
Holger Hermanns, Kim Guldstrand Larsen, Jean-François Raskin, Jan Tretmans
2010 — conf
Safraless Procedures for Timed Specifications.
FORMATS
Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2009 A* conf
An Antichain Algorithm for LTL Realizability.
CAV
Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2009 J jnl
Antichains for the Automata-Based Approach to Model-Checking
Log. Methods Comput. Sci.
Laurent Doyen, Jean-François Raskin
2009 — conf
Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study.
HSCC
Franck Cassez, Jan Jakob Jessen, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier
2009 C conf
Fixpoint Guided Abstraction Refinement for Alternating Automata.
CIAA
Pierre Ganty, Nicolas Maquet, Jean-François Raskin
2009 J jnl
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.
Tech. Sci. Informatiques
Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2009 — conf
Realizability of Real-Time Logics.
FORMATS
Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert
2009 C ed.
TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings
TIME
Carsten Lutz, Jean-François Raskin
2008 B conf
Alaska.
ATVA
Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin
2008 A conf
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking.
TACAS
Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin
2008 J jnl
Durations and parametric model-checking in timed automata.
ACM Trans. Comput. Log.
Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
2008 J jnl
Equivalence of Labeled Markov Chains.
Int. J. Found. Comput. Sci.
Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2008 J jnl
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Fundam. Informaticae
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
2008 J jnl
Robust safety of timed automata.
Formal Methods Syst. Des.
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
2008 — conf
Visibly Pushdown Transducers.
ICALP (2)
Jean-François Raskin, Frédéric Servais
2007 J jnl
Algorithms for Omega-Regular Games with Imperfect Information
CoRR
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2007 J jnl
Algorithms for Omega-Regular Games with Imperfect Information.
Log. Methods Comput. Sci.
Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
2007 B conf
Fixpoint-Guided Abstraction Refinements.
SAS
Patrick Cousot, Pierre Ganty, Jean-François Raskin
2007 — ed.
Formal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings
FORMATS
Jean-François Raskin, P. S. Thiagarajan
2007 — conf
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
ICATPN
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
2007 A conf
Improved Algorithms for the Automata-Based Approach to Model-Checking.
TACAS
Laurent Doyen, Jean-François Raskin
2007 A* conf
Minimum-Time Reachability in Timed Games.
ICALP
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
2007 B conf
On the Efficient Computation of the Minimal Coverability Set for Petri Nets.
ATVA
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2007 J jnl
On the optimal reachability problem of weighted timed automata.
Formal Methods Syst. Des.
Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2007 J jnl
Real-Time Model-Checking: Parameters everywhere
CoRR
Véronique Bruyère, Jean-François Raskin
2007 J jnl
Real-Time Model-Checking: Parameters everywhere.
Log. Methods Comput. Sci.
Véronique Bruyère, Jean-François Raskin
2007 B conf
Timed Control with Observation Based and Stuttering Invariant Strategies.
ATVA
Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, Jean-François Raskin
2007 J jnl
Well-structured languages.
Acta Informatica
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2006 B conf
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.
VMCAI
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
2006 — conf
A Lattice Theory for Solving Games of Imperfect Information.
HSCC
Martin De Wulf, Laurent Doyen, Jean-François Raskin
2006 B conf
Algorithms for Omega-Regular Games with Imperfect Information
CSL
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2006 A* conf
Antichains: A New Algorithm for Checking Universality of Finite Automata.
CAV
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2006 J jnl
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS.
J. Comput. Syst. Sci.
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2006 J jnl
Model checking restricted sets of timed paths.
Theor. Comput. Sci.
Nicolas Markey, Jean-François Raskin
2006 J jnl
On model-checking timed automata with stopwatch observers.
Inf. Comput.
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2006 J jnl
On the
Theor. Comput. Sci.
Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2006 — conf
On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game.
Computers and Games
Sébastien Collette, Jean-François Raskin, Frédéric Servais
2005 J jnl
A classification of symbolic transition systems.
ACM Trans. Comput. Log.
Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin
2005 J jnl
Almost ASAP semantics: from timed models to timed implementations.
Formal Aspects Comput.
Martin De Wulf, Laurent Doyen, Jean-François Raskin
2005 — ch.
An Introduction to Hybrid Automata.
Handbook of Networked and Embedded Control Systems
Jean-François Raskin
2005 — conf
Automatic Rectangular Refinement of Affine Hybrid Systems.
FORMATS
Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
2005 A* conf
Expand, Enlarge and Check... Made Efficient.
CAV
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2005 — conf
On Optimal Timed Strategies.
FORMATS
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2005 B conf
Systematic Implementation of Real-Time Models.
FM
Martin De Wulf, Laurent Doyen, Jean-François Raskin
2004 — conf
Almost ASAP Semantics: From Timed Models to Timed Implementations.
HSCC
Martin De Wulf, Laurent Doyen, Jean-François Raskin
2004 J jnl
Covering sharing trees: a compact data structure for parameterized verification.
Int. J. Softw. Tools Technol. Transf.
Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin
2004 — conf
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.
FSTTCS
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2004 — conf
Games for Counting Abstractions.
AVoCS
Jean-François Raskin, Mathias Samuelides, Laurent Van Begin
2004 B conf
Model Checking Restricted Sets of Timed Paths.
CONCUR
Nicolas Markey, Jean-François Raskin
2004 — conf
Model-Checking for Weighted Timed Automata.
FORMATS/FTRTFT
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2004 — conf
On the omega-language Expressive Power of Extended Petri Nets.
EXPRESS
Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2004 — conf
Robustness and Implementability of Timed Automata.
FORMATS/FTRTFT
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
2003 J jnl
A Game-based Verification of Non-repudiation and Fair Exchange Protocols.
J. Comput. Secur.
Steve Kremer, Jean-François Raskin
2003 A conf
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
STACS
Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
2003 — conf
Petri Nets with Non-blocking Arcs are Difficult to Analyze.
INFINITY
Jean-François Raskin, Laurent Van Begin
2003 — conf
Real-Time Model-Checking: Parameters Everywhere.
FSTTCS
Véronique Bruyère, Jean-François Raskin
2002 — conf
A Comparison of Control Problems for Timed and Hybrid Systems.
HSCC
Franck Cassez, Thomas A. Henzinger, Jean-François Raskin
2002 J jnl
Axioms for real-time logics.
Theor. Comput. Sci.
Pierre-Yves Schobbens, Jean-François Raskin, Thomas A. Henzinger
2002 — conf
Game Analysis of Abuse-free Contract Signing.
CSFW
Steve Kremer, Jean-François Raskin
2002 — conf
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
INFINITY
Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin
2002 A conf
Towards the Automated Verification of Multithreaded Java Programs.
TACAS
Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin
2001 J jnl
A Classification of Symbolic Transition Systems
CoRR
Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin
2001 B conf
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols.
CONCUR
Steve Kremer, Jean-François Raskin
2001 A* conf
Attacking Symbolic State Explosion.
CAV
Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin
2000 B conf
Abstract Interpretation of Game Properties.
SAS
Thomas A. Henzinger, Rupak Majumdar, Freddy Y. C. Mang, Jean-François Raskin
2000 — conf
Robust Undecidability of Timed and Hybrid Systems.
HSCC
Thomas A. Henzinger, Jean-François Raskin
2000 A conf
Symbolic Representation of Upward-Closed Sets.
TACAS
Giorgio Delzanno, Jean-François Raskin
1999 — conf
Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees.
SMC@FLoC
Laurent Ferier, Jean-François Raskin, Pierre-Yves Schobbens
1999 J jnl
The Logic of "Initially" and "Next": Complete Axiomatization and Complexity.
Inf. Process. Lett.
Pierre-Yves Schobbens, Jean-François Raskin
1999 J jnl
The Logic of Event Clocks - Decidability, Complexity and Expressiveness.
J. Autom. Lang. Comb.
Jean-François Raskin, Pierre-Yves Schobbens
1998 B conf
Axioms for Real-Time Logics.
CONCUR
Jean-François Raskin, Pierre-Yves Schobbens, Thomas A. Henzinger
1998 A* conf
The Regular Real-Time Languages.
ICALP
Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens
1997 A conf
Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time.
TACAS
Jean-François Raskin, Pierre-Yves Schobbens
1997 — conf
State Clock Logic: A Decidable Real-Time Logic.
HART
Jean-François Raskin, Pierre-Yves Schobbens