default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Raskin
Person information
- affiliation: Université Libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c143]Léonard Brice, F. Thomas Bruss, Anirban Majumdar, Jean-François Raskin:
Algorithms for Robbins' Problem Using Markov Decision Processes. Principles of Verification (2) 2025: 18-45- 2024
- [j57]Véronique Bruyère
, Baptiste Fievet, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis. ACM Trans. Comput. Log. 25(2): 14:1-14:49 (2024) - [c142]Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin:
SynthLearn: A Tool for Guided Reactive Synthesis. Taming the Infinities of Concurrency 2024: 51-71 - [c141]Véronique Bruyère, Christophe Grandmont, Jean-François Raskin:
As Soon as Possible but Rationally. CONCUR 2024: 14:1-14:20 - [c140]Jean-François Raskin, Yun Chen Tsai:
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments. SETTA 2024: 3-21 - [i81]Véronique Bruyère, Christophe Grandmont, Jean-François Raskin:
As Soon as Possible but Rationally. CoRR abs/2403.00399 (2024) - [i80]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 abs/2405.18958 (2024) - [i79]Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin:
Greybox Learning of Languages Recognizable by Event-Recording Automata. CoRR abs/2408.12551 (2024) - [i78]Jean-François Raskin, Yun Chen Tsai:
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments. CoRR abs/2410.08599 (2024) - [i77]Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard:
The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives. CoRR abs/2412.08547 (2024) - 2023
- [j56]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) - [c139]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: 1354-1362 - [c138]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: 203-223 - [c137]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. MFCS 2023: 26:1-26:15 - [c136]Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin:
LTL Reactive Synthesis with a Few Hints. TACAS (2) 2023: 309-328 - [e9]Guillermo A. Pérez, Jean-François Raskin:
34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium. LIPIcs 279, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-299-0 [contents] - [i76]Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin:
LTL Reactive Synthesis with a Few Hints. CoRR abs/2301.10485 (2023) - [i75]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 abs/2301.12913 (2023) - [i74]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 abs/2305.09634 (2023) - [i73]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 abs/2308.07738 (2023) - 2022
- [j55]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Correction to: Reactive synthesis without regret. Acta Informatica 59(5): 671 (2022) - [j54]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): 104980 (2022) - [j53]Wen-Chi Yang, Jean-François Raskin, Luc De Raedt:
Lifted model checking for relational MDPs. Mach. Learn. 111(10): 3797-3838 (2022) - [j52]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): 635-659 (2022) - [c135]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Pareto-Rational Verification. CONCUR 2022: 33:1-33:20 - [c134]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
On the Complexity of SPEs in Parity Games. CSL 2022: 10:1-10:17 - [c133]Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin:
Strategy Synthesis for Global Window PCTL. ICALP 2022: 115:1-115:20 - [c132]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
The Complexity of SPEs in Mean-Payoff Games. ICALP 2022: 116:1-116:20 - [e8]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar:
Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 13660, Springer 2022, ISBN 978-3-031-22336-5 [contents] - [i72]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
The Complexity of SPEs in Mean-payoff Games. CoRR abs/2202.08499 (2022) - [i71]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Pareto-Rational Verification. CoRR abs/2202.13485 (2022) - [i70]Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis (Extended Version). CoRR abs/2203.01285 (2022) - [i69]Léonard Brice, Marie van den Bogaard, Jean-François Raskin:
Subgame-perfect Equilibria in Mean-payoff Games (journal version). CoRR abs/2203.08546 (2022) - [i68]Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin:
Strategy Synthesis for Global Window PCTL. CoRR abs/2204.14107 (2022) - [i67]Gavin Rens, Wen-Chi Yang, Jean-François Raskin, Luc De Raedt:
Learning Probabilistic Temporal Safety Properties from Examples in Relational Domains. CoRR abs/2211.03461 (2022) - 2021
- [j51]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: 104553 (2021) - [j50]Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin:
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives. Inf. Comput. 278: 104594 (2021) - [c131]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Subgame-Perfect Equilibria in Mean-Payoff Games. CONCUR 2021: 8:1-8:17 - [c130]Mrudula Balachander, Shibashis Guha, Jean-François Raskin:
Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. CONCUR 2021: 9:1-9:17 - [c129]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis. CONCUR 2021: 27:1-27:17 - [c128]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: 54-65 - [c127]Gavin Rens, Jean-François Raskin, Raphaël Reynouard, Giuseppe Marra:
Online Learning of non-Markovian Reward Models. ICAART (2) 2021: 74-86 - [c126]Damien Busatto-Gaston, Debraj Chakraborty, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin:
Safe Learning for Near-Optimal Scheduling. QEST 2021: 235-254 - [i66]Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Subgame-perfect Equilibria in Mean-payoff Games. CoRR abs/2101.10685 (2021) - [i65]Véronique Bruyère, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis (Full Version). CoRR abs/2102.08925 (2021) - [i64]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 abs/2104.11758 (2021) - [i63]Wen-Chi Yang, Jean-François Raskin, Luc De Raedt:
Lifted Model Checking for Relational MDPs. CoRR abs/2106.11735 (2021) - [i62]Léonard Brice, Marie van den Bogaard, Jean-François Raskin:
On the Complexity of SPEs in Parity Games. CoRR abs/2107.07458 (2021) - 2020
- [j49]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. Int. J. Found. Comput. Sci. 31(6): 711-748 (2020) - [j48]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) - [c125]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi:
Weighted Transducers for Robustness Verification. CONCUR 2020: 17:1-17:21 - [c124]Damien Busatto-Gaston, Debraj Chakraborty, Jean-François Raskin:
Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. CONCUR 2020: 40:1-40:24 - [c123]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. ICALP 2020: 127:1-127:18 - [c122]Raphaël Berthon, Shibashis Guha, Jean-François Raskin:
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. LICS 2020: 195-208 - [e7]Jean-François Raskin, Davide Bresolin:
Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2020, Brussels, Belgium, September 21-22, 2020. EPTCS 326, 2020 [contents] - [i61]Gavin Rens, Jean-François Raskin:
Learning Non-Markovian Reward Models in MDPs. CoRR abs/2001.09293 (2020) - [i60]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. CoRR abs/2004.12918 (2020) - [i59]Raphaël Berthon, Shibashis Guha, Jean-François Raskin:
Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. CoRR abs/2004.13789 (2020) - [i58]Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin:
Safe Learning for Near Optimal Scheduling. CoRR abs/2005.09253 (2020) - [i57]Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin:
Monte Carlo Tree Search guided by Symbolic Advice for MDPs. CoRR abs/2006.04712 (2020) - [i56]Mrudula Balachander, Shibashis Guha, Jean-François Raskin:
Stackelberg Mean-payoff Games with a Rationally Bounded Adversarial Follower. CoRR abs/2007.07209 (2020) - [i55]Gavin Rens, Jean-François Raskin, Raphaël Reynouad, Giuseppe Marra:
Online Learning of Non-Markovian Reward Models. CoRR abs/2009.12600 (2020)
2010 – 2019
- 2019
- [j47]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable weighted expressions with Presburger combinators. J. Comput. Syst. Sci. 106: 1-22 (2019) - [c121]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: 285-312 - [c120]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: 13:1-13:16 - [c119]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy Mean-Payoff Games. CONCUR 2019: 21:1-21:17 - [c118]Benjamin Bordais, Shibashis Guha, Jean-François Raskin:
Expected Window Mean-Payoff. FSTTCS 2019: 32:1-32:15 - [c117]Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines:
Partial Solvers for Generalized Parity Games. RP 2019: 63-78 - [e6]Jérôme Leroux, Jean-François Raskin:
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September 2019. EPTCS 305, 2019 [contents] - [i54]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 abs/1901.04349 (2019) - [i53]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 abs/1905.00784 (2019) - [i52]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy mean-payoff games. CoRR abs/1907.01359 (2019) - [i51]Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines:
Partial Solvers for Generalized Parity Games. CoRR abs/1907.06913 (2019) - 2018
- [j46]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at mean payoff through foggy windows. Acta Informatica 55(8): 627-647 (2018) - [j45]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Visibly pushdown transducers. J. Comput. Syst. Sci. 97: 147-181 (2018) - [j44]Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin:
Mean-payoff games with partial observation. Theor. Comput. Sci. 735: 82-110 (2018) - [j43]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. ACM Trans. Comput. Log. 19(3): 20:1-20:29 (2018) - [c116]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: 8:1-8:18 - [c115]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
Parameterized complexity of games with monotonically ordered omega-regular objectives. CONCUR 2018: 29:1-29:16 - [c114]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond Admissibility: Dominance Between Chains of Strategies. CSL 2018: 10:1-10:22 - [c113]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. DLT 2018: 304-317 - [c112]Gilles Geeraerts, Shibashis Guha, Jean-François Raskin:
Safe and Optimal Scheduling for Hard and Soft Tasks. FSTTCS 2018: 36:1-36:22 - [c111]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Rational Synthesis Under Imperfect Information. LICS 2018: 422-431 - [c110]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: 16-29 - [p4]Rupak Majumdar, Jean-François Raskin:
Symbolic Model Checking in Non-Boolean Domains. Handbook of Model Checking 2018: 1111-1147 - [i50]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 abs/1804.08924 (2018) - [i49]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond admissibility: Dominance between chains of strategies. CoRR abs/1805.11608 (2018) - [i48]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 abs/1806.05544 (2018) - [i47]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. CoRR abs/1810.03515 (2018) - [i46]Benjamin Bordais, Shibashis Guha, Jean-François Raskin:
Expected Window Mean-Payoff. CoRR abs/1812.09298 (2018) - 2017
- [j42]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive synthesis without regret. Acta Informatica 54(1): 3-39 (2017) - [j41]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-admissible synthesis. Acta Informatica 54(1): 41-83 (2017) - [j40]Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand:
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica 54(6): 545-587 (2017) - [j39]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile queries in multi-dimensional Markov decision processes. Formal Methods Syst. Des. 50(2-3): 207-248 (2017) - [j38]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254: 259-295 (2017) - [j37]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday equilibria for omega-regular games. Inf. Comput. 254: 296-315 (2017) - [j36]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): 367-390 (2017) - [c109]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs. AAAI 2017: 3725-3732 - [c108]Nicolas Basset, Jean-François Raskin, Ocan Sankur:
Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools 2017: 403-425 - [c107]Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur:
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR 2017: 2:1-2:23 - [c106]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable Weighted Expressions with Presburger Combinators. FCT 2017: 243-256 - [c105]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS 2017: 145-161 - [c104]Raphaël Berthon, Mickael Randour, Jean-François Raskin:
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. ICALP 2017: 121:1-121:15 - [c103]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissiblity in Concurrent Games. ICALP 2017: 123:1-123:14 - [c102]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: 1-12 - [c101]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. STACS 2017: 50:1-50:13 - [c100]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: 426-442 - [c99]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: 116-143 - [e5]Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin:
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. LIPIcs 83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-046-0 [contents] - [i45]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 abs/1701.02903 (2017) - [i44]Javier Esparza, Jan Kretínský, Jean-François Raskin, Salomon Sickert:
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. CoRR abs/1701.06103 (2017) - [i43]Raphaël Berthon, Mickael Randour, Jean-François Raskin:
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. CoRR abs/1702.05472 (2017) - [i42]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissibility in Concurrent Games. CoRR abs/1702.06439 (2017) - [i41]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable Weighted Expressions with Presburger Combinators. CoRR abs/1706.08855 (2017) - [i40]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
Games with lexicographically ordered $ω$-regular objectives. CoRR abs/1707.05968 (2017) - 2016
- [c98]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the Complexity of Heterogeneous Multidimensional Games. CONCUR 2016: 11:1-11:15 - [c97]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Minimizing Regret in Discounted-Sum Games. CSL 2016: 30:1-30:17 - [c96]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. FSTTCS 2016: 42:1-42:14 - [c95]Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Complexity of Rational Synthesis. ICALP 2016: 121:1-121:15 - [c94]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - [c93]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:
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SYNT@CAV 2016: 149-177 - [p3]Jean-François Raskin:
A Tutorial on Mean-payoff and Energy Games. Dependable Software Systems Engineering 2016: 179-201 - [e4]