Gilles Geeraerts

According to our database, Gilles Geeraerts authored at least 48 papers between 2004 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2022

One-Clock Priced Timed Games with Negative Weights.

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege

Log. Methods Comput. Sci., 2022

2020

On the termination of dynamics in sequential games.

Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux

Inf. Comput., 2020

One-Clock Priced Timed Games with Arbitrary Weights.

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege

CoRR, 2020

Monte Carlo Tree Search guided by Symbolic Advice for MDPs.

Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin

CoRR, 2020

Safe Learning for Near Optimal Scheduling.

Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin

CoRR, 2020

2019

Dynamics on Games: Simulation-Based Techniques and Applications to Routing.

Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

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

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis.

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege

Proceedings of the 23rd International Conference on Engineering of Complex Computer Systems, 2018

Safe and Optimal Scheduling for Hard and Soft Tasks.

Gilles Geeraerts, Shibashis Guha, Jean-François Raskin

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Dynamics and Coalitions in Sequential Games.

Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Admissibility in Concurrent Games.

Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur

CoRR, 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

Models and Algorithms for Chronology.

Gilles Geeraerts, Eythan Levy, Frédéric Pluquet

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Timed-Automata-Based Verification of MITL over Signals.

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Admissiblity in Concurrent Games.

Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

MightyL: A Compositional Translation from MITL to Timed Automata.

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks.

Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen

Proceedings of the 17th International Conference on Application of Concurrency to System Design, 2017

2016

Efficient Energy Distribution in a Smart Grid using Multi-Player Games.

Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege

Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Real-Time Synthesis is Hard!

Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

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

ω-Petri Nets: Algorithms and Complexity.

Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin

Fundam. Informaticae, 2015

Quantitative Games under Failures.

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Simple Priced Timed Games are not That Simple.

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

On regions and zones for event-clock automata.

Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder

Formal Methods Syst. Des., 2014

Synthesising Succinct Strategies in Safety Games.

Gilles Geeraerts, Joël Goossens, Amélie Stainer

CoRR, 2014

Synthesising Succinct Strategies in Safety and Reachability Games.

Gilles Geeraerts, Joël Goossens, Amélie Stainer

Proceedings of the Reachability Problems - 8th International Workshop, 2014

On MITL and Alternating Timed Automata over Infinite Words.

Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Adding Negative Prices to Priced Timed Games.

Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm.

Gilles Geeraerts, Joël Goossens, Markus Lindström

Real Time Syst., 2013

On MITL and Alternating Timed Automata.

Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.

Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell

Proceedings of the Automated Technology for Verification and Analysis, 2013

ω-Petri Nets.

Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

Queue-Dispatch Asynchronous Systems.

Gilles Geeraerts, Alexander Heußner, Jean-François Raskin

Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints

Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell

CoRR, 2012

2011

A faster exact multiprocessor schedulability test for sporadic tasks.

Markus Lindström, Gilles Geeraerts, Joël Goossens

Proceedings of the 19th International Conference on Real-Time and Network Systems, 2011

On Reachability for Hybrid Automata over Bounded Time.

Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Event Clock Automata: From Theory to Practice.

Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

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

Safraless Procedures for Timed Specifications.

Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Lattice-Valued Binary Decision Diagrams.

Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin

Proceedings of the Automated Technology for Verification and Analysis, 2010

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

Realizability of Real-Time Logics.

Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

2007

Well-structured languages.

Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin

Acta Informatica, 2007

2006

On the <i>omega</i>-language expressive power of extended Petri nets.

Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin

Theor. Comput. Sci., 2006

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

2005

Expand, Enlarge and Check... Made Efficient.

Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004

On the omega-language Expressive Power of Extended Petri Nets.

Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin

Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004