Gilles Geeraerts

69 papers A* 2B 7C 2Misc 2Journal 35Unranked 20

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	A Zone-Based Algorithm for Timed Parity Games. FSTTCS Gilles Geeraerts, Frédéric Herbreteau, Jean-François Raskin, Alexis Reynouard
2025	J	`jnl`	A Zone-Based Algorithm for Timed Parity Games. CoRR Gilles Geeraerts, Frédéric Herbreteau, Jean-François Raskin, Alexis Reynouard
2024	Misc	`conf`	Exact schedulability test for sporadic mixed-criticality real-time systems using antichains and oracles. RTNS Simon Picard, Antonio Paolillo, Gilles Geeraerts, Joël Goossens
2024	J	`jnl`	Exact schedulability test for sporadic mixed-criticality real-time systems using antichains and oracles. CoRR Simon Picard, Antonio Paolillo, Gilles Geeraerts, Joël Goossens
2022	J	`jnl`	One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2020	J	`jnl`	Monte Carlo Tree Search guided by Symbolic Advice for MDPs. CoRR Damien Busatto-Gaston, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin
2020	J	`jnl`	On the termination of dynamics in sequential games. Inf. Comput. Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux
2020	J	`jnl`	One-Clock Priced Timed Games with Arbitrary Weights. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2020	J	`jnl`	Safe Learning for Near Optimal Scheduling. CoRR Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin
2019	—	`conf`	Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
2019	J	`jnl`	Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
2018	B	`conf`	Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege
2018	—	`conf`	Safe and Optimal Scheduling for Hard and Soft Tasks. FSTTCS Gilles Geeraerts, Shibashis Guha, Jean-François Raskin
2018	J	`jnl`	Synthesising succinct strategies in safety games with an application to real-time scheduling. Theor. Comput. Sci. Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen, Amélie Stainer
2017	—	`conf`	A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. ACSD Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen
2017	J	`jnl`	A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. CoRR Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen
2017	J	`jnl`	Admissibility in Concurrent Games. CoRR Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
2017	A*	`conf`	Admissiblity in Concurrent Games. ICALP Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
2017	—	`conf`	Dynamics and Coalitions in Sequential Games. GandALF Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux
2017	—	`ed.`	Formal Modeling and Analysis of Timed Systems - 15th International Conference, FORMATS 2017, Berlin, Germany, September 5-7, 2017, Proceedings FORMATS Alessandro Abate, Gilles Geeraerts
2017	—	`conf`	MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2017	C	`conf`	Models and Algorithms for Chronology. TIME Gilles Geeraerts, Eythan Levy, Frédéric Pluquet
2017	J	`jnl`	Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2017	C	`conf`	Timed-Automata-Based Verification of MITL over Signals. TIME Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2016	—	`conf`	Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2016	—	`conf`	Real-Time Synthesis is Hard! FORMATS Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
2016	J	`jnl`	Real-Time Synthesis is Hard! CoRR Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
2015	J	`jnl`	On the Verification of Concurrent, Asynchronous Programs with Waiting Queues. ACM Trans. Embed. Comput. Syst. Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
2015	—	`conf`	Quantitative Games under Failures. FSTTCS Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015	J	`jnl`	Quantitative Games under Failures. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015	J	`jnl`	Simple Priced Timed Games Are Not That Simple. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2015	—	`conf`	Simple Priced Timed Games are not That Simple. FSTTCS Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2015	B	`conf`	To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2015	J	`jnl`	ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
2014	B	`conf`	Adding Negative Prices to Priced Timed Games. CONCUR Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014	J	`jnl`	Adding Negative Prices to Priced Timed Games. CoRR Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014	—	`conf`	On MITL and Alternating Timed Automata over Infinite Words. FORMATS Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2014	J	`jnl`	On MITL and alternating timed automata over infinite words. CoRR Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2014	J	`jnl`	On regions and zones for event-clock automata. Formal Methods Syst. Des. Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2014	J	`jnl`	Synthesising Succinct Strategies in Safety Games. CoRR Gilles Geeraerts, Joël Goossens, Amélie Stainer
2014	—	`conf`	Synthesising Succinct Strategies in Safety and Reachability Games. RP Gilles Geeraerts, Joël Goossens, Amélie Stainer
2014	J	`jnl`	To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2013	J	`jnl`	Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. Real Time Syst. Gilles Geeraerts, Joël Goossens, Markus Lindström
2013	—	`conf`	On MITL and Alternating Timed Automata. FORMATS Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2013	J	`jnl`	On MITL and alternating timed automata CoRR Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2013	—	`conf`	Queue-Dispatch Asynchronous Systems. ACSD Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
2013	B	`conf`	Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. ATVA Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2013	B	`conf`	ω-Petri Nets. Petri Nets Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
2013	J	`jnl`	ω-Petri nets CoRR Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin
2012	J	`jnl`	Queue-Dispatch Asynchronous Systems CoRR Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
2012	J	`jnl`	Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints CoRR Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011	J	`jnl`	A faster exact multiprocessor schedulability test for sporadic tasks CoRR Markus Lindström, Gilles Geeraerts, Joël Goossens
2011	Misc	`conf`	A faster exact multiprocessor schedulability test for sporadic tasks. RTNS Markus Lindström, Gilles Geeraerts, Joël Goossens
2011	—	`conf`	Event Clock Automata: From Theory to Practice. FORMATS Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2011	J	`jnl`	Event-Clock Automata: From Theory to Practice CoRR Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2011	J	`jnl`	On Reachability for Hybrid Automata over Bounded Time CoRR Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011	—	`conf`	On Reachability for Hybrid Automata over Bounded Time. ICALP (2) Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2010	B	`conf`	Lattice-Valued Binary Decision Diagrams. ATVA Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin
2010	J	`jnl`	On the Efficient Computation of the Minimal Coverability Set of Petri Nets. Int. J. Found. Comput. Sci. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2010	—	`conf`	Safraless Procedures for Timed Specifications. FORMATS Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
2009	J	`jnl`	Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. Tech. Sci. Informatiques Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2009	—	`conf`	Realizability of Real-Time Logics. FORMATS Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert
2007	B	`conf`	On the Efficient Computation of the Minimal Coverability Set for Petri Nets. ATVA Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2007	J	`jnl`	Well-structured languages. Acta Informatica Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2006	J	`jnl`	Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2006	J	`jnl`	On the Theor. Comput. Sci. Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2005	A*	`conf`	Expand, Enlarge and Check... Made Efficient. CAV Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2004	—	`conf`	Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. FSTTCS Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
2004	—	`conf`	On the omega-language Expressive Power of Extended Petri Nets. EXPRESS Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin