On the omega-language Expressive Power of Extended Petri Nets. - Alain Finkel; Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (EXPRESS, 2004)

Expand, Enlarge and Check... Made Efficient. - Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (CAV, 2005)

Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. - Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (J. Comput. Syst. Sci., 2006)

On the omega-language expressive power of extended Petri nets. - Alain Finkel; Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (Theor. Comput. Sci., 2006)

Well-structured languages. - Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (Acta Informatica, 2007)

Realizability of Real-Time Logics. - Laurent Doyen 001; Gilles Geeraerts; Jean-François Raskin; Julien Reichert (FORMATS, 2009)

Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. - Pierre Ganty; Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (Tech. Sci. Informatiques, 2009)

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

Safraless Procedures for Timed Specifications. - Barbara Di Giampaolo; Gilles Geeraerts; Jean-François Raskin; Nathalie Sznajder (FORMATS, 2010)

On the Efficient Computation of the Minimal Coverability Set of Petri Nets. - Gilles Geeraerts; Jean-François Raskin; Laurent Van Begin (Int. J. Found. Comput. Sci., 2010)

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

On Reachability for Hybrid Automata over Bounded Time. - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (ICALP (2), 2011)

A faster exact multiprocessor schedulability test for sporadic tasks. - Markus Lindström; Gilles Geeraerts; Joël Goossens (RTNS, 2011)

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (CoRR, 2012)

Queue-Dispatch Asynchronous Systems. - Gilles Geeraerts; Alexander Heußner; Jean-François Raskin (ACSD, 2013)

ω-Petri Nets. - Gilles Geeraerts; Alexander Heußner; M. Praveen; Jean-François Raskin (Petri Nets, 2013)

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (ATVA, 2013)

On MITL and Alternating Timed Automata. - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts (FORMATS, 2013)

Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. - Gilles Geeraerts; Joël Goossens; Markus Lindström (Real Time Syst., 2013)

Adding Negative Prices to Priced Timed Games. - Thomas Brihaye; Gilles Geeraerts; Shankara Narayanan Krishna; Lakshmi Manasa; Benjamin Monmege; Ashutosh Trivedi 001 (CONCUR, 2014)

On MITL and Alternating Timed Automata over Infinite Words. - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts (FORMATS, 2014)

Synthesising Succinct Strategies in Safety and Reachability Games. - Gilles Geeraerts; Joël Goossens; Amélie Stainer (RP, 2014)

Synthesising Succinct Strategies in Safety Games. - Gilles Geeraerts; Joël Goossens; Amélie Stainer (CoRR, 2014)

On regions and zones for event-clock automata. - Gilles Geeraerts; Jean-François Raskin; Nathalie Sznajder (Formal Methods Syst. Des., 2014)

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (CONCUR, 2015)

Simple Priced Timed Games are not That Simple. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (FSTTCS, 2015)

Quantitative Games under Failures. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege; Guillermo A. Pérez 001; Gabriel Renault (FSTTCS, 2015)

ω-Petri Nets: Algorithms and Complexity. - Gilles Geeraerts; Alexander Heußner; M. Praveen; Jean-François Raskin (Fundam. Informaticae, 2015)

On the Verification of Concurrent, Asynchronous Programs with Waiting Queues. - Gilles Geeraerts; Alexander Heußner; Jean-François Raskin (ACM Trans. Embed. Comput. Syst., 2015)

Real-Time Synthesis is Hard! - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege; Nathalie Sznajder (FORMATS, 2016)

Efficient Energy Distribution in a Smart Grid using Multi-Player Games. - Thomas Brihaye; Amit Kumar Dhar; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Cassting/SynCoP, 2016)

A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. - Gilles Geeraerts; Joël Goossens; Thi-Van-Anh Nguyen (ACSD, 2017)

MightyL: A Compositional Translation from MITL to Timed Automata. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege (CAV (1), 2017)

Admissiblity in Concurrent Games. - Nicolas Basset; Gilles Geeraerts; Jean-François Raskin; Ocan Sankur (ICALP, 2017)

Timed-Automata-Based Verification of MITL over Signals. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege (TIME, 2017)

Models and Algorithms for Chronology. - Gilles Geeraerts; Eythan Levy; Frédéric Pluquet (TIME, 2017)

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Acta Informatica, 2017)

Admissibility in Concurrent Games. - Nicolas Basset; Gilles Geeraerts; Jean-François Raskin; Ocan Sankur (CoRR, 2017)

Dynamics and Coalitions in Sequential Games. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Stéphane Le Roux 001 (GandALF, 2017)

Safe and Optimal Scheduling for Hard and Soft Tasks. - Gilles Geeraerts; Shibashis Guha; Jean-François Raskin (FSTTCS, 2018)

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Arthur Milchior; Benjamin Monmege (ICECCS, 2018)

Synthesising succinct strategies in safety games with an application to real-time scheduling. - Gilles Geeraerts; Joël Goossens; Thi-Van-Anh Nguyen; Amélie Stainer (Theor. Comput. Sci., 2018)

Dynamics on Games: Simulation-Based Techniques and Applications to Routing. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Benjamin Monmege; Bruno Quoitin (FSTTCS, 2019)

Safe Learning for Near Optimal Scheduling. - Gilles Geeraerts; Shibashis Guha; Guillermo A. Pérez 001; Jean-François Raskin (CoRR, 2020)

Monte Carlo Tree Search guided by Symbolic Advice for MDPs. - Damien Busatto-Gaston; Debraj Chakraborty 002; Gilles Geeraerts; Jean-François Raskin (CoRR, 2020)

One-Clock Priced Timed Games with Arbitrary Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (CoRR, 2020)

On the termination of dynamics in sequential games. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Stéphane Le Roux 001 (Inf. Comput., 2020)

One-Clock Priced Timed Games with Negative Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (Log. Methods Comput. Sci., 2022)

Exact schedulability test for sporadic mixed-criticality real-time systems using antichains and oracles. - Simon Picard; Antonio Paolillo; Gilles Geeraerts; Joël Goossens (RTNS, 2024)