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
- 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)- [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) 2024: 18-45 - [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]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
- [j35]Thomas A. Henzinger, Jean-François Raskin:
The equivalence problem for finite automata: technical perspective. Commun. ACM 58(2): 86 (2015) - [j34]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. Log. Methods Comput. Sci. 11(3) (2015) - [j33]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137(1): 29-60 (2015) - [j32]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) - [j31]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) - [j30]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) - [c92]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at Mean-Payoff Through Foggy Windows. ATVA 2015: 429-445 - [c91]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile Queries in Multi-dimensional Markov Decision Processes. CAV (1) 2015: 123-139 - [c90]Romain Brenguier, Jean-François Raskin:
Pareto Curves of Multidimensional Mean-Payoff Games. CAV (2) 2015: 251-267 - [c89]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CONCUR 2015: 100-113 - [c88]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive Synthesis Without Regret. CONCUR 2015: 114-127 - [c87]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 - [c86]Lorenzo Clemente, Jean-François Raskin:
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. LICS 2015: 257-268 - [c85]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. VMCAI 2015: 1-18 - [c84]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 - [c83]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
- [j29]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3-4): 129-163 (2014) - [j28]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) - [c82]Romain Brenguier, Jean-François Raskin, Mathieu Sassolas:
The complexity of admissibility in Omega-regular games. CSL-LICS 2014: 23:1-23:10 - [c81]Véronique Bruyère, Noémie Meunier, Jean-François Raskin:
Secure equilibria in weighted games. CSL-LICS 2014: 26:1-26:26 - [c80]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Finite-Valued Weighted Automata. FSTTCS 2014: 133-145 - [c79]Paul Hunter, Jean-François Raskin:
Quantitative Games with Interval Objectives. FSTTCS 2014: 365-377 - [c78]Jean-François Raskin, Ocan Sankur:
Multiple-Environment Markov Decision Processes. FSTTCS 2014: 531-543 - [c77]Romain Brenguier, Franck Cassez, Jean-François Raskin:
Energy and mean-payoff timed games. HSCC 2014: 283-292 - [c76]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Mean-Payoff Games with Partial-Observation - (Extended Abstract). RP 2014: 163-175 - [c75]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 - [c74]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. VMCAI 2014: 78-97 - [c73]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 - [c72]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 - [c71]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
- [j27]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Exploiting structure in LTL synthesis. Int. J. Softw. Tools Technol. Transf. 15(5-6): 541-561 (2013) - [j26]Andreas Classen, Maxime Cordy, Pierre-Yves Schobbens, Patrick Heymans, Axel Legay, Jean-François Raskin:
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking. IEEE Trans. Software Eng. 39(8): 1069-1089 (2013) - [c70]Gilles Geeraerts, Alexander Heußner, Jean-François Raskin:
Queue-Dispatch Asynchronous Systems. ACSD 2013: 150-159 - [c69]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets. Petri Nets 2013: 49-69 - [c68]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. ATVA 2013: 55-70 - [c67]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. ATVA 2013: 118-132 - [c66]Line Juhl, Kim Guldstrand Larsen, Jean-François Raskin:
Optimal Bounds for Multiweighted and Parametrised Energy Games. Theories of Programming and Formal Methods 2013: 244-255 - [c65]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin:
Synthesis from LTL Specifications with Mean-Payoff Objectives. TACAS 2013: 169-184 - [i20]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri nets. CoRR abs/1301.6572 (2013) - [i19]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013) - [i18]Romain Brenguier, Jean-François Raskin, Mathieu Sassolas:
The Complexity of Admissibility in Omega-Regular Games. CoRR abs/1304.1682 (2013) - [i17]Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. CoRR abs/1309.5439 (2013) - [i16]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Mean-payoff Games with Incomplete Information. CoRR abs/1309.5462 (2013) - [i15]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. CoRR abs/1311.3238 (2013) - 2012
- [c64]Peter E. Bulychev, Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier:
Controllers with Minimal Observation Power (Application to Timed Systems). ATVA 2012: 223-237 - [c63]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Acacia+, a Tool for LTL Synthesis. CAV 2012: 652-657 - [c62]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-Dimensional Quantitative Objectives. CONCUR 2012: 115-131 - [c61]Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin:
Quantitative Languages Defined by Functional Automata. CONCUR 2012: 132-146 - [i14]Gilles Geeraerts, Alexander Heußner, Jean-François Raskin:
Queue-Dispatch Asynchronous Systems. CoRR abs/1201.4871 (2012) - [i13]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-dimensional Quantitative Objectives. CoRR abs/1201.5073 (2012) - [i12]Peter E. Bulychev, Franck Cassez, Alexandre David, Kim G. Larsen, Jean-François Raskin, Pierre-Alain Reynier:
Controllers with Minimal Observation Power (Application to Timed Systems). CoRR abs/1207.1276 (2012) - [i11]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin:
The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012) - [i10]Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin:
Synthesis from LTL Specifications with Mean-Payoff Objectives. CoRR abs/1210.3539 (2012) - [i9]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012) - 2011
- [j25]Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin:
Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2): 97-118 (2011) - [j24]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Antichains and compositional algorithms for LTL synthesis. Formal Methods Syst. Des. 39(3): 261-296 (2011) - [c60]Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin:
Antichain-Based QBF Solving. ATVA 2011: 183-197 - [c59]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Event Clock Automata: From Theory to Practice. FORMATS 2011: 209-224 - [c58]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427 - [c57]Jean-François Raskin:
Reachability Problems for Hybrid Automata. RP 2011: 28-30 - [p2]Laurent Doyen, Jean-François Raskin:
Games with imperfect information: theory and algorithms. Lectures in Game Theory for Computer Scientists 2011: 185-212 - [i8]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
On Reachability for Hybrid Automata over Bounded Time. CoRR abs/1104.5335 (2011) - [i7]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Event-Clock Automata: From Theory to Practice. CoRR abs/1107.4138 (2011) - 2010
- [j23]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the Efficient Computation of the Minimal Coverability Set of Petri Nets. Int. J. Found. Comput. Sci. 21(2): 135-165 (2010) - [j22]Pierre Ganty, Nicolas Maquet, Jean-François Raskin:
Fixed point guided abstraction refinement for alternating automata. Theor. Comput. Sci. 411(38-39): 3444-3459 (2010) - [c56]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Compositional Algorithms for LTL Synthesis. ATVA 2010: 112-127 - [c55]Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin:
Lattice-Valued Binary Decision Diagrams. ATVA 2010: 158-172 - [c54]Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk:
Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274 - [c53]Holger Hermanns, Kim Guldstrand Larsen, Jean-François Raskin, Jan Tretmans:
Quantitative system validation in model driven design. EMSOFT 2010: 301-302 - [c52]Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Safraless Procedures for Timed Specifications. FORMATS 2010: 2-22 - [c51]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Generalized Mean-payoff and Energy Games. FSTTCS 2010: 505-516 - [c50]Andreas Classen, Patrick Heymans, Pierre-Yves Schobbens, Axel Legay, Jean-François Raskin:
Model checking lots of systems: efficient verification of temporal properties in software product lines. ICSE (1) 2010: 335-344 - [c49]Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin:
Iterated Regret Minimization in Game Graphs. MFCS 2010: 342-354 - [c48]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Properties of Visibly Pushdown Transducers. MFCS 2010: 355-367 - [c47]Laurent Doyen, Jean-François Raskin:
Antichain Algorithms for Finite Automata. TACAS 2010: 2-22 - [i6]Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
On Functionality of Visibly Pushdown Transducers. CoRR abs/1002.1443 (2010) - [i5]Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin:
Iterated Regret Minimization in Game Graphs. CoRR abs/1002.1456 (2010) - [i4]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Generalized Mean-payoff and Energy Games. CoRR abs/1007.1669 (2010)
2000 – 2009
- 2009
- [j21]Laurent Doyen, Jean-François Raskin:
Antichains for the Automata-Based Approach to Model-Checking. Log. Methods Comput. Sci. 5(1) (2009) - [j20]Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. Tech. Sci. Informatiques 28(9): 1107-1142 (2009) - [c46]Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
An Antichain Algorithm for LTL Realizability. CAV 2009: 263-277 - [c45]Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert:
Realizability of Real-Time Logics. FORMATS 2009: 133-148 - [c44]Franck Cassez, Jan Jakob Jessen, Kim Guldstrand Larsen, Jean-François Raskin, Pierre-Alain Reynier:
Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study. HSCC 2009: 90-104 - [c43]Pierre Ganty, Nicolas Maquet, Jean-François Raskin:
Fixpoint Guided Abstraction Refinement for Alternating Automata. CIAA 2009: 155-164 - [e2]Carsten Lutz, Jean-François Raskin:
TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings. IEEE Computer Society 2009, ISBN 978-0-7695-3727-6 [contents] - 2008
- [j19]Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin:
Robust safety of timed automata. Formal Methods Syst. Des. 33(1-3): 45-84 (2008) - [j18]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. Fundam. Informaticae 88(3): 275-305 (2008) - [j17]Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Equivalence of Labeled Markov Chains. Int. J. Found. Comput. Sci. 19(3): 549-563 (2008) - [j16]Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin:
Durations and parametric model-checking in timed automata. ACM Trans. Comput. Log. 9(2): 12:1-12:23 (2008) - [c42]Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin:
Alaska. ATVA 2008: 240-245 - [c41]Jean-François Raskin, Frédéric Servais:
Visibly Pushdown Transducers. ICALP (2) 2008: 386-397 - [c40]Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin:
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. TACAS 2008: 63-77 - 2007
- [j15]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Well-structured languages. Acta Informatica 44(3-4): 249-288 (2007) - [j14]Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On the optimal reachability problem of weighted timed automata. Formal Methods Syst. Des. 31(2): 135-175 (2007) - [j13]Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters everywhere. Log. Methods Comput. Sci. 3(1) (2007) - [j12]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Algorithms for Omega-Regular Games with Imperfect Information. Log. Methods Comput. Sci. 3(3) (2007) - [c39]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143 - [c38]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the Efficient Computation of the Minimal Coverability Set for Petri Nets. ATVA 2007: 98-113 - [c37]Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, Jean-François Raskin:
Timed Control with Observation Based and Stuttering Invariant Strategies. ATVA 2007: 192-206 - [c36]Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin:
Minimum-Time Reachability in Timed Games. ICALP 2007: 825-837 - [c35]Patrick Cousot, Pierre Ganty, Jean-François Raskin:
Fixpoint-Guided Abstraction Refinements. SAS 2007: 333-348 - [c34]Laurent Doyen, Jean-François Raskin:
Improved Algorithms for the Automata-Based Approach to Model-Checking. TACAS 2007: 451-465 - [e1]Jean-François Raskin, P. S. Thiagarajan:
Formal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings. Lecture Notes in Computer Science 4763, Springer 2007, ISBN 978-3-540-75453-4 [contents] - [i3]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information. CoRR abs/0706.2619 (2007) - [i2]Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters everywhere. CoRR abs/cs/0701138 (2007) - 2006
- [j11]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On model-checking timed automata with stopwatch observers. Inf. Comput. 204(3): 408-433 (2006) - [j10]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1): 180-203 (2006) - [j9]Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language expressive power of extended Petri nets. Theor. Comput. Sci. 356(3): 374-386 (2006) - [j8]Nicolas Markey, Jean-François Raskin:
Model checking restricted sets of timed paths. Theor. Comput. Sci. 358(2-3): 273-292 (2006) - [c33]Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Antichains: A New Algorithm for Checking Universality of Finite Automata. CAV 2006: 17-30 - [c32]Sébastien Collette, Jean-François Raskin, Frédéric Servais:
On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game. Computers and Games 2006: 220-233 - [c31]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information, . CSL 2006: 287-302 - [c30]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
A Lattice Theory for Solving Games of Imperfect Information. HSCC 2006: 153-168 - [c29]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64 - 2005
- [j7]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
Almost ASAP semantics: from timed models to timed implementations. Formal Aspects Comput. 17(3): 319-341 (2005) - [j6]Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin:
A classification of symbolic transition systems. ACM Trans. Comput. Log. 6(1): 1-32 (2005) - [c28]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check... Made Efficient. CAV 2005: 394-407 - [c27]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
Systematic Implementation of Real-Time Models. FM 2005: 139-156 - [c26]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On Optimal Timed Strategies. FORMATS 2005: 49-64 - [c25]Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Automatic Rectangular Refinement of Affine Hybrid Systems. FORMATS 2005: 144-161 - [p1]Jean-François Raskin:
An Introduction to Hybrid Automata. Handbook of Networked and Embedded Control Systems 2005: 491-518 - 2004
- [j5]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin:
Covering sharing trees: a compact data structure for parameterized verification. Int. J. Softw. Tools Technol. Transf. 5(2-3): 268-297 (2004) - [c24]Nicolas Markey, Jean-François Raskin:
Model Checking Restricted Sets of Timed Paths. CONCUR 2004: 432-447 - [c23]Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin:
Robustness and Implementability of Timed Automata. FORMATS/FTRTFT 2004: 118-133 - [c22]Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
Model-Checking for Weighted Timed Automata. FORMATS/FTRTFT 2004: 277-292 - [c21]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. FSTTCS 2004: 287-298 - [c20]Martin De Wulf, Laurent Doyen, Jean-François Raskin:
Almost ASAP Semantics: From Timed Models to Timed Implementations. HSCC 2004: 296-310 - [c19]Jean-François Raskin, Mathias Samuelides, Laurent Van Begin:
Games for Counting Abstractions. AVoCS 2004: 69-85 - [c18]Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language Expressive Power of Extended Petri Nets. EXPRESS 2004: 87-101 - 2003
- [j4]Steve Kremer, Jean-François Raskin:
A Game-based Verification of Non-repudiation and Fair Exchange Protocols. J. Comput. Secur. 11(3): 399-430 (2003) - [c17]Véronique Bruyère, Jean-François Raskin:
Real-Time Model-Checking: Parameters Everywhere. FSTTCS 2003: 100-111 - [c16]Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin:
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. STACS 2003: 687-698 - [c15]Jean-François Raskin, Laurent Van Begin:
Petri Nets with Non-blocking Arcs are Difficult to Analyze. INFINITY 2003: 35-55 - 2002
- [j3]Pierre-Yves Schobbens, Jean-François Raskin, Thomas A. Henzinger:
Axioms for real-time logics. Theor. Comput. Sci. 274(1-2): 151-182 (2002) - [c14]Steve Kremer, Jean-François Raskin:
Game Analysis of Abuse-free Contract Signing. CSFW 2002: 206- - [c13]Franck Cassez, Thomas A. Henzinger, Jean-François Raskin:
A Comparison of Control Problems for Timed and Hybrid Systems. HSCC 2002: 134-148 - [c12]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin:
Towards the Automated Verification of Multithreaded Java Programs. TACAS 2002: 173-187 - [c11]Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin:
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. INFINITY 2002: 85-106 - 2001
- [c10]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin:
Attacking Symbolic State Explosion. CAV 2001: 298-310 - [c9]Steve Kremer, Jean-François Raskin:
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. CONCUR 2001: 551-565 - [i1]Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin:
A Classification of Symbolic Transition Systems. CoRR cs.LO/0101013 (2001) - 2000
- [c8]Thomas A. Henzinger, Jean-François Raskin:
Robust Undecidability of Timed and Hybrid Systems. HSCC 2000: 145-159 - [c7]Thomas A. Henzinger, Rupak Majumdar, Freddy Y. C. Mang, Jean-François Raskin:
Abstract Interpretation of Game Properties. SAS 2000: 220-239 - [c6]Giorgio Delzanno, Jean-François Raskin:
Symbolic Representation of Upward-Closed Sets. TACAS 2000: 426-440
1990 – 1999
- 1999
- [j2]Pierre-Yves Schobbens, Jean-François Raskin:
The Logic of "Initially" and "Next": Complete Axiomatization and Complexity. Inf. Process. Lett. 69(5): 221-225 (1999) - [j1]Jean-François Raskin, Pierre-Yves Schobbens:
The Logic of Event Clocks - Decidability, Complexity and Expressiveness. J. Autom. Lang. Comb. 4(3): 247-282 (1999) - [c5]Laurent Ferier, Jean-François Raskin, Pierre-Yves Schobbens:
Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees. SMC@FLoC 1999: 108-126 - 1998
- [c4]Jean-François Raskin, Pierre-Yves Schobbens, Thomas A. Henzinger:
Axioms for Real-Time Logics. CONCUR 1998: 219-236 - [c3]Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens:
The Regular Real-Time Languages. ICALP 1998: 580-591 - 1997
- [c2]Jean-François Raskin, Pierre-Yves Schobbens:
State Clock Logic: A Decidable Real-Time Logic. HART 1997: 33-47 - [c1]Jean-François Raskin, Pierre-Yves Schobbens:
Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time. TACAS 1997: 165-182
Coauthor Index
[j57] [c141] [i81] [i77] [c135] [i71] [i70] [j51] [j50] [c129] [i65] [j48] [c120] [c119] [c117] [i53] [i52] [i51] [c115] [c110] [i48] [j40] [j38] [c105] [i40] [c98] [i36] [c87] [i35] [i28] [c81] [c75] [c73] [c72] [i26] [i25] [c65] [i17] [c63] [i10] [c60] [j16] [j14] [j13] [i2] [j11] [c26] [c22] [c17] [c16]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-28 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
