Gilles Geeraerts

Publication Activity (10 Years)

Years Active: 2004-2022
Publications (10 Years): 22

Top Topics

Nash Equilibria

Top Venues

Publications

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. 18 (3) (2022)
Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin
Safe Learning for Near Optimal Scheduling. CoRR (2020)
Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin
Monte Carlo Tree Search guided by Symbolic Advice for MDPs. CoRR (2020)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
One-Clock Priced Timed Games with Arbitrary Weights. CoRR (2020)
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux
On the termination of dynamics in sequential games. Inf. Comput. 272 (2020)
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS (2019)
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR (2019)
Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen, Amélie Stainer
Synthesising succinct strategies in safety games with an application to real-time scheduling. Theor. Comput. Sci. 735 (2018)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS (2018)
Gilles Geeraerts, Shibashis Guha, Jean-François Raskin
Safe and Optimal Scheduling for Hard and Soft Tasks. FSTTCS (2018)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica 54 (1) (2017)
Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. ACSD (2017)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) (2017)
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux
Dynamics and Coalitions in Sequential Games. GandALF (2017)
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
Admissibility in Concurrent Games. CoRR (2017)
Gilles Geeraerts, Eythan Levy, Frédéric Pluquet
Models and Algorithms for Chronology. TIME (2017)
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
Admissiblity in Concurrent Games. ICALP (2017)
Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. CoRR (2017)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
Timed-Automata-Based Verification of MITL over Signals. TIME (2017)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
Real-Time Synthesis is Hard! FORMATS (2016)
Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP (2016)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
Real-Time Synthesis is Hard! CoRR (2016)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
Quantitative Games under Failures. CoRR (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
Simple Priced Timed Games Are Not That Simple. CoRR (2015)
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137 (1) (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
Quantitative Games under Failures. FSTTCS (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
Simple Priced Timed Games are not That Simple. FSTTCS (2015)
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) (2015)
Gilles Geeraerts, Joël Goossens, Amélie Stainer
Synthesising Succinct Strategies in Safety Games. CoRR (2014)
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
On regions and zones for event-clock automata. Formal Methods Syst. Des. 45 (3) (2014)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
On MITL and alternating timed automata over infinite words. CoRR (2014)
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
Adding Negative Prices to Priced Timed Games. CONCUR (2014)
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
Adding Negative Prices to Priced Timed Games. CoRR (2014)
Gilles Geeraerts, Joël Goossens, Amélie Stainer
Synthesising Succinct Strategies in Safety and Reachability Games. RP (2014)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR (2014)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
On MITL and Alternating Timed Automata over Infinite Words. FORMATS (2014)
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
ω-Petri Nets. Petri Nets (2013)
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)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
On MITL and alternating timed automata CoRR (2013)
Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
ω-Petri nets CoRR (2013)
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
Queue-Dispatch Asynchronous Systems. ACSD (2013)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
On MITL and Alternating Timed Automata. FORMATS (2013)
Gilles Geeraerts, Joël Goossens, Markus Lindström
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. Real Time Syst. 49 (2) (2013)
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
Queue-Dispatch Asynchronous Systems CoRR (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 (2012)
Markus Lindström, Gilles Geeraerts, Joël Goossens
A faster exact multiprocessor schedulability test for sporadic tasks. RTNS (2011)
Markus Lindström, Gilles Geeraerts, Joël Goossens
A faster exact multiprocessor schedulability test for sporadic tasks CoRR (2011)
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
Event Clock Automata: From Theory to Practice. FORMATS (2011)
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
Event-Clock Automata: From Theory to Practice CoRR (2011)
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)
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
On Reachability for Hybrid Automata over Bounded Time CoRR (2011)
Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
Safraless Procedures for Timed Specifications. FORMATS (2010)
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) (2010)
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin
Lattice-Valued Binary Decision Diagrams. ATVA (2010)
Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert
Realizability of Real-Time Logics. FORMATS (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. Tech. Sci. Informatiques 28 (9) (2009)
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
On the Efficient Computation of the Minimal Coverability Set for Petri Nets. ATVA (2007)
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
Well-structured languages. Acta Informatica 44 (3-4) (2007)
Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
-language expressive power of extended Petri nets. Theor. Comput. Sci. 356 (3) (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) (2006)
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
Expand, Enlarge and Check... Made Efficient. CAV (2005)
Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
On the omega-language Expressive Power of Extended Petri Nets. EXPRESS (2004)
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. FSTTCS (2004)