Jean-François Raskin

Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin: Synthesis from LTL Specifications with Mean-Payoff Objectives. TACAS 2013: 169-184

Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin: ω-Petri nets. CoRR abs/1301.6572 (2013)

Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin: Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013)

Romain Brenguier, Jean-François Raskin, Mathieu Sassolas: The Complexity of Admissibility in Omega-Regular Games. CoRR abs/1304.1682 (2013)

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

Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin: Acacia+, a Tool for LTL Synthesis. CAV 2012: 652-657

Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin: Strategy Synthesis for Multi-Dimensional Quantitative Objectives. CONCUR 2012: 115-131

Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin: Quantitative Languages Defined by Functional Automata. CONCUR 2012: 132-146

Gilles Geeraerts, Alexander Heußner, Jean-François Raskin: Queue-Dispatch Asynchronous Systems. CoRR abs/1201.4871 (2012)

Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin: Strategy Synthesis for Multi-dimensional Quantitative Objectives. CoRR abs/1201.5073 (2012)

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)

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)

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)

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)

Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin: Faster algorithms for mean-payoff games. Formal Methods in System Design 38(2): 97-118 (2011)

Emmanuel Filiot, Naiyong Jin, Jean-François Raskin: Antichains and compositional algorithms for LTL synthesis. Formal Methods in System Design 39(3): 261-296 (2011)

Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin: Antichain-Based QBF Solving. ATVA 2011: 183-197

Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder: Event Clock Automata: From Theory to Practice. FORMATS 2011: 209-224

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

Jean-François Raskin: Reachability Problems for Hybrid Automata. RP 2011: 28-30

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)

Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder: Event-Clock Automata: From Theory to Practice. CoRR abs/1107.4138 (2011)

Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin: Quantitative Languages Defined by Functional Automata. CoRR abs/1111.0862 (2011)

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)

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)

Emmanuel Filiot, Naiyong Jin, Jean-François Raskin: Compositional Algorithms for LTL Synthesis. ATVA 2010: 112-127

Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin: Lattice-Valued Binary Decision Diagrams. ATVA 2010: 158-172

Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, Szymon Torunczyk: Energy and Mean-Payoff Games with Imperfect Information. CSL 2010: 260-274

Holger Hermanns, Kim Guldstrand Larsen, Jean-François Raskin, Jan Tretmans: Quantitative system validation in model driven design. EMSOFT 2010: 301-302

Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder: Safraless Procedures for Timed Specifications. FORMATS 2010: 2-22

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Generalized Mean-payoff and Energy Games. FSTTCS 2010: 505-516

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

Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin: Iterated Regret Minimization in Game Graphs. MFCS 2010: 342-354

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

Laurent Doyen, Jean-François Raskin: Antichain Algorithms for Finite Automata. TACAS 2010: 2-22

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)

Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin: Iterated Regret Minimization in Game Graphs. CoRR abs/1002.1456 (2010)

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Generalized Mean-payoff and Energy Games. CoRR abs/1007.1669 (2010)

Laurent Doyen, Jean-François Raskin: Antichains for the Automata-Based Approach to Model-Checking. Logical Methods in Computer Science 5(1) (2009)

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. Technique et Science Informatiques 28(9): 1107-1142 (2009)

Emmanuel Filiot, Naiyong Jin, Jean-François Raskin: An Antichain Algorithm for LTL Realizability. CAV 2009: 263-277

Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert: Realizability of Real-Time Logics. FORMATS 2009: 133-148

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

Pierre Ganty, Nicolas Maquet, Jean-François Raskin: Fixpoint Guided Abstraction Refinement for Alternating Automata. CIAA 2009: 155-164

Carsten Lutz, Jean-François Raskin (Eds.): 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

Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin: Robust safety of timed automata. Formal Methods in System Design 33(1-3): 45-84 (2008)

Pierre Ganty, Jean-François Raskin, Laurent Van Begin: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. Fundam. Inform. 88(3): 275-305 (2008)

Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Equivalence of Labeled Markov Chains. Int. J. Found. Comput. Sci. 19(3): 549-563 (2008)

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) (2008)

Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin: Alaska. ATVA 2008: 240-245

Jean-François Raskin, Frédéric Servais: Visibly Pushdown Transducers. ICALP (2) 2008: 386-397

Martin De Wulf, Laurent Doyen, Nicolas Maquet, Jean-François Raskin: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. TACAS 2008: 63-77

Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Well-structured languages. Acta Inf. 44(3-4): 249-288 (2007)

Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin: On the optimal reachability problem of weighted timed automata. Formal Methods in System Design 31(2): 135-175 (2007)

Véronique Bruyère, Jean-François Raskin: Real-Time Model-Checking: Parameters everywhere. Logical Methods in Computer Science 3(1) (2007)

Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Algorithms for Omega-Regular Games with Imperfect Information. Logical Methods in Computer Science 3(3) (2007)

Pierre Ganty, Jean-François Raskin, Laurent Van Begin: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143

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

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

Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin: Minimum-Time Reachability in Timed Games. ICALP 2007: 825-837

Patrick Cousot, Pierre Ganty, Jean-François Raskin: Fixpoint-Guided Abstraction Refinements. SAS 2007: 333-348

Laurent Doyen, Jean-François Raskin: Improved Algorithms for the Automata-Based Approach to Model-Checking. TACAS 2007: 451-465

Jean-François Raskin, P. S. Thiagarajan (Eds.): 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

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Algorithms for Omega-Regular Games with Imperfect Information. CoRR abs/0706.2619 (2007)

Véronique Bruyère, Jean-François Raskin: Real-Time Model-Checking: Parameters everywhere. CoRR abs/cs/0701138 (2007)

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)

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)

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)

Nicolas Markey, Jean-François Raskin: Model checking restricted sets of timed paths. Theor. Comput. Sci. 358(2-3): 273-292 (2006)

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

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

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Algorithms for Omega-Regular Games with Imperfect Information^, . CSL 2006: 287-302

Martin De Wulf, Laurent Doyen, Jean-François Raskin: A Lattice Theory for Solving Games of Imperfect Information. HSCC 2006: 153-168

Pierre Ganty, Jean-François Raskin, Laurent Van Begin: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64

Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: On the omega-language Expressive Power of Extended Petri Nets. Electr. Notes Theor. Comput. Sci. 128(2): 87-101 (2005)

Jean-François Raskin, Mathias Samuelides, Laurent Van Begin: Games for Counting Abstractions. Electr. Notes Theor. Comput. Sci. 128(6): 69-85 (2005)

Martin De Wulf, Laurent Doyen, Jean-François Raskin: Almost ASAP semantics: from timed models to timed implementations. Formal Asp. Comput. 17(3): 319-341 (2005)

Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin: A classification of symbolic transition systems. ACM Trans. Comput. Log. 6(1): 1-32 (2005)

Jean-François Raskin: An Introduction to Hybrid Automata. Handbook of Networked and Embedded Control Systems 2005: 491-518

Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Expand, Enlarge and Check... Made Efficient. CAV 2005: 394-407

Martin De Wulf, Laurent Doyen, Jean-François Raskin: Systematic Implementation of Real-Time Models. FM 2005: 139-156

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin: On Optimal Timed Strategies. FORMATS 2005: 49-64

Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Automatic Rectangular Refinement of Affine Hybrid Systems. FORMATS 2005: 144-161

Jean-François Raskin, Laurent Van Begin: Petri Nets with Non-blocking Arcs are Difficult to Analyze. Electr. Notes Theor. Comput. Sci. 98: 35-55 (2004)

Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin: Covering sharing trees: a compact data structure for parameterized verification. STTT 5(2-3): 268-297 (2004)

Nicolas Markey, Jean-François Raskin: Model Checking Restricted Sets of Timed Paths. CONCUR 2004: 432-447

Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin: Robustness and Implementability of Timed Automata. FORMATS/FTRTFT 2004: 118-133

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin: Model-Checking for Weighted Timed Automata. FORMATS/FTRTFT 2004: 277-292

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

Martin De Wulf, Laurent Doyen, Jean-François Raskin: Almost ASAP Semantics: From Timed Models to Timed Implementations. HSCC 2004: 296-310

Steve Kremer, Jean-François Raskin: A Game-based Verification of Non-repudiation and Fair Exchange Protocols. Journal of Computer Security 11(3): 399-430 (2003)

Véronique Bruyère, Jean-François Raskin: Real-Time Model-Checking: Parameters Everywhere. FSTTCS 2003: 100-111

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

Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin: Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. Electr. Notes Theor. Comput. Sci. 68(6): 85-106 (2002)

Pierre-Yves Schobbens, Jean-François Raskin, Thomas A. Henzinger: Axioms for real-time logics. Theor. Comput. Sci. 274(1-2): 151-182 (2002)

Steve Kremer, Jean-François Raskin: Game Analysis of Abuse-free Contract Signing. CSFW 2002: 206-

Franck Cassez, Thomas A. Henzinger, Jean-François Raskin: A Comparison of Control Problems for Timed and Hybrid Systems. HSCC 2002: 134-148

Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin: Towards the Automated Verification of Multithreaded Java Programs. TACAS 2002: 173-187

Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin: Attacking Symbolic State Explosion. CAV 2001: 298-310

Steve Kremer, Jean-François Raskin: A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. CONCUR 2001: 551-565

Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin: A Classification of Symbolic Transition Systems. CoRR cs.LO/0101013 (2001)

Thomas A. Henzinger, Jean-François Raskin: Robust Undecidability of Timed and Hybrid Systems. HSCC 2000: 145-159

Thomas A. Henzinger, Rupak Majumdar, Freddy Y. C. Mang, Jean-François Raskin: Abstract Interpretation of Game Properties. SAS 2000: 220-239

Giorgio Delzanno, Jean-François Raskin: Symbolic Representation of Upward-Closed Sets. TACAS 2000: 426-440

Laurent Ferier, Jean-François Raskin, Pierre-Yves Schobbens: Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees. Electr. Notes Theor. Comput. Sci. 23(2): 108-126 (1999)

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)

Jean-François Raskin, Pierre-Yves Schobbens: The Logic of Event Clocks - Decidability, Complexity and Expressiveness. Journal of Automata, Languages and Combinatorics 4(3): 247-286 (1999)

Jean-François Raskin, Pierre-Yves Schobbens, Thomas A. Henzinger: Axioms for Real-Time Logics. CONCUR 1998: 219-236

Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens: The Regular Real-Time Languages. ICALP 1998: 580-591

Jean-François Raskin, Pierre-Yves Schobbens: State Clock Logic: A Decidable Real-Time Logic. HART 1997: 33-47

Jean-François Raskin, Pierre-Yves Schobbens: Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time. TACAS 1997: 165-182