Google
Google Scholar
Semantic Scholar
MS Academic
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
- 2021
[j52]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)- 2020
- [j51]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) - [j50]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) - [c123]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, Ashutosh Trivedi:
Weighted Transducers for Robustness Verification. CONCUR 2020: 17:1-17:21 - [c122]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 - [c121]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Adversarial Stackelberg Value in Quantitative Games. ICALP 2020: 127:1-127:18 - [c120]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
- [j49]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable weighted expressions with Presburger combinators. J. Comput. Syst. Sci. 106: 1-22 (2019) - [c119]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 - [c118]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 - [c117]Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin:
Energy Mean-Payoff Games. CONCUR 2019: 21:1-21:17 - [c116]Benjamin Bordais, Shibashis Guha, Jean-François Raskin:
Expected Window Mean-Payoff. FSTTCS 2019: 32:1-32:15 - [c115]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
- [j48]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at mean payoff through foggy windows. Acta Informatica 55(8): 627-647 (2018) - [j47]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) - [j46]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) - [j45]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. ACM Trans. Comput. Log. 19(3): 20:1-20:29 (2018) - [c114]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 - [c113]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 - [c112]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 - [c111]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. DLT 2018: 304-317 - [c110]Gilles Geeraerts, Shibashis Guha, Jean-François Raskin:
Safe and Optimal Scheduling for Hard and Soft Tasks. FSTTCS 2018: 36:1-36:22 - [c109]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Rational Synthesis Under Imperfect Information. LICS 2018: 422-431 - [c108]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
- [j44]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive synthesis without regret. Acta Informatica 54(1): 3-39 (2017) - [j43]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-admissible synthesis. Acta Informatica 54(1): 41-83 (2017) - [j42]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) - [j41]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) - [j40]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) - [j39]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday equilibria for omega-regular games. Inf. Comput. 254: 296-315 (2017) - [j38]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) - [c107]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs. AAAI 2017: 3725-3732 - [c106]Nicolas Basset, Jean-François Raskin, Ocan Sankur:
Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools 2017: 403-425 - [c105]Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur:
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR 2017: 2:1-2:23 - [c104]Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
Decidable Weighted Expressions with Presburger Combinators. FCT 2017: 243-256 - [c103]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 - [c102]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 - [c101]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissiblity in Concurrent Games. ICALP 2017: 123:1-123:14 - [c100]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 - [c99]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. STACS 2017: 50:1-50:13 - [c98]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 - [c97]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
- [c96]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the Complexity of Heterogeneous Multidimensional Games. CONCUR 2016: 11:1-11:15 - [c95]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Minimizing Regret in Discounted-Sum Games. CSL 2016: 30:1-30:17 - [c94]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. FSTTCS 2016: 42:1-42:14 - [c93]Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
The Complexity of Rational Synthesis. ICALP 2016: 121:1-121:15 - [c92]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 - [c91]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]Marsha Chechik, Jean-François Raskin:
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. Lecture Notes in Computer Science 9636, Springer 2016, ISBN 978-3-662-49673-2 [contents] - [i39]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski games. CoRR abs/1609.07048 (2016) - [i38]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. CoRR abs/1611.08677 (2016) - [i37]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs (Technical Report). CoRR abs/1611.08696 (2016) - [i36]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the existence of weak subgame perfect equilibria. CoRR abs/1612.01402 (2016) - 2015
- [j37]Thomas A. Henzinger, Jean-François Raskin:
The equivalence problem for finite automata: technical perspective. Commun. ACM 58(2): 86 (2015) - [j36]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. Log. Methods Comput. Sci. 11(3) (2015) - [j35]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137(1): 29-60 (2015) - [j34]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin:
The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241: 177-196 (2015) - [j33]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242: 25-52 (2015) - [j32]Gilles Geeraerts, Alexander Heußner, Jean-François Raskin:
On the Verification of Concurrent, Asynchronous Programs with Waiting Queues. ACM Trans. Embed. Comput. Syst. 14(3): 58:1-58:26 (2015) - [c90]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at Mean-Payoff Through Foggy Windows. ATVA 2015: 429-445 - [c89]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile Queries in Multi-dimensional Markov Decision Processes. CAV (1) 2015: 123-139 - [c88]Romain Brenguier, Jean-François Raskin:
Pareto Curves of Multidimensional Mean-Payoff Games. CAV (2) 2015: 251-267 - [c87]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CONCUR 2015: 100-113 - [c86]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive Synthesis Without Regret. CONCUR 2015: 114-127 - [c85]Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CSL 2015: 504-518 - [c84]Lorenzo Clemente, Jean-François Raskin:
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. LICS 2015: 257-268 - [c83]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. VMCAI 2015: 1-18 - [c82]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:
The Second Reactive Synthesis Competition (SYNTCOMP 2015). SYNT 2015: 27-57 - [c81]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Compositional Algorithms for Succinct Safety Games. SYNT 2015: 98-111 - [i35]Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CoRR abs/1504.01557 (2015) - [i34]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive Synthesis Without Regret. CoRR abs/1504.01708 (2015) - [i33]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at Mean-Payoff through Foggy Windows. CoRR abs/1504.02947 (2015) - [i32]Lorenzo Clemente, Jean-François Raskin:
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives. CoRR abs/1504.08211 (2015) - [i31]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). CoRR abs/1506.08726 (2015) - [i30]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CoRR abs/1507.00623 (2015) - [i29]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Minimizing Regret in Discounted-Sum Games. CoRR abs/1511.00523 (2015) - [i28]Véronique Bruyère, Quentin Hautem, Jean-François Raskin:
On the complexity of heterogeneous multidimensional quantitative games. CoRR abs/1511.08334 (2015) - [i27]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. CoRR abs/1512.05568 (2015) - 2014
- [j31]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3-4): 129-163 (2014) - [j30]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
On regions and zones for event-clock automata. Formal Methods Syst. Des. 45(3): 330-380 (2014) - [c80]Romain Brenguier, Jean-François Raskin, Mathieu Sassolas:
The complexity of admissibility in Omega-regular games. CSL-LICS 2014: 23:1-23:10 - [c79]Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Secure equilibria in weighted games. CSL-LICS 2014: 26:1-26:26 - [c78]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Finite-Valued Weighted Automata. FSTTCS 2014: 133-145 - [c77]Paul Hunter, Jean-François Raskin:
Quantitative Games with Interval Objectives. FSTTCS 2014: 365-377 - [c76]Jean-François Raskin, Ocan Sankur:
Multiple-Environment Markov Decision Processes. FSTTCS 2014: 531-543 - [c75]Romain Brenguier, Franck Cassez, Jean-François Raskin:
Energy and mean-payoff timed games. HSCC 2014: 283-292 - [c74]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Mean-Payoff Games with Partial-Observation - (Extended Abstract). RP 2014: 163-175 - [c73]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. STACS 2014: 199-213 - [c72]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. VMCAI 2014: 78-97 - [c71]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. SR 2014: 1-8 - [c70]Aaron Bohy, Véronique Bruyère, Jean-François Raskin:
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes. SYNT 2014: 51-67 - [c69]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
AbsSynthe: abstract synthesis from succinct safety specifications. SYNT 2014: 100-116 - [e3]Franck Cassez, Jean-François Raskin:
Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings. Lecture Notes in Computer Science 8837, Springer 2014, ISBN 978-3-319-11935-9 [contents] - [i26]Aaron Bohy, Véronique Bruyère, Jean-François Raskin:
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. CoRR abs/1402.1076 (2014) - [i25]Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Secure Equilibria in Weighted Games. CoRR abs/1402.3962 (2014) - [i24]Paul Hunter, Jean-François Raskin:
Quantitative games with interval objectives. CoRR abs/1404.4856 (2014) - [i23]Jean-François Raskin, Ocan Sankur:
Multiple-Environment Markov Decision Processes. CoRR abs/1405.4733 (2014) - [i22]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile Queries in Multi-Dimensional Markov Decision Processes. CoRR abs/1410.4801 (2014) - [i21]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. CoRR abs/1411.0835 (2014) - 2013
- [j29]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Exploiting structure in LTL synthesis. Int. J. Softw. Tools Technol. Transf. 15(5-6): 541-561 (