default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilles Geeraerts
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]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)- 2020
- [j12]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
On the termination of dynamics in sequential games. Inf. Comput. 272: 104505 (2020) - [i20]Gilles Geeraerts, Shibashis Guha, Guillermo A. Pérez, Jean-François Raskin:
Safe Learning for Near Optimal Scheduling. CoRR abs/2005.09253 (2020) - [i19]Damien Busatto-Gaston
, Debraj Chakraborty, Gilles Geeraerts, Jean-François Raskin:
Monte Carlo Tree Search guided by Symbolic Advice for MDPs. CoRR abs/2006.04712 (2020) - [i18]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Arbitrary Weights. CoRR abs/2009.03074 (2020)
2010 – 2019
- 2019
- [c31]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS 2019: 35:1-35:14 - [i17]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR abs/1910.00094 (2019) - 2018
- [j11]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: 24-49 (2018) - [c30]Gilles Geeraerts, Shibashis Guha, Jean-François Raskin:
Safe and Optimal Scheduling for Hard and Soft Tasks. FSTTCS 2018: 36:1-36:22 - [c29]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege:
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS 2018: 180-184 - 2017
- [j10]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): 85-125 (2017) - [c28]Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen:
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. ACSD 2017: 116-125 - [c27]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) 2017: 421-440 - [c26]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissiblity in Concurrent Games. ICALP 2017: 123:1-123:14 - [c25]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
Timed-Automata-Based Verification of MITL over Signals. TIME 2017: 7:1-7:19 - [c24]Gilles Geeraerts, Eythan Levy, Frédéric Pluquet:
Models and Algorithms for Chronology. TIME 2017: 13:1-13:18 - [c23]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
Dynamics and Coalitions in Sequential Games. GandALF 2017: 136-150 - [e1]Alessandro Abate, Gilles Geeraerts:
Formal Modeling and Analysis of Timed Systems - 15th International Conference, FORMATS 2017, Berlin, Germany, September 5-7, 2017, Proceedings. Lecture Notes in Computer Science 10419, Springer 2017, ISBN 978-3-319-65764-6 [contents] - [i16]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissibility in Concurrent Games. CoRR abs/1702.06439 (2017) - [i15]Gilles Geeraerts, Joël Goossens, Thi-Van-Anh Nguyen:
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks. CoRR abs/1704.00999 (2017) - 2016
- [c22]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! FORMATS 2016: 105-120 - [c21]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: 1-12 - [i14]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! CoRR abs/1606.07124 (2016) - 2015
- [j9]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets: Algorithms and Complexity. Fundam. Informaticae 137(1): 29-60 (2015) - [j8]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): 58:1-58:26 (2015) - [c20]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR 2015: 297-310 - [c19]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games are not That Simple. FSTTCS 2015: 278-292 - [c18]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. FSTTCS 2015: 293-306 - [i13]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. CoRR abs/1504.06744 (2015) - [i12]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games Are Not That Simple. CoRR abs/1507.03786 (2015) - 2014
- [j7]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
On regions and zones for event-clock automata. Formal Methods Syst. Des. 45(3): 330-380 (2014) - [c17]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CONCUR 2014: 560-575 - [c16]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and Alternating Timed Automata over Infinite Words. FORMATS 2014: 69-84 - [c15]Gilles Geeraerts, Joël Goossens, Amélie Stainer:
Synthesising Succinct Strategies in Safety and Reachability Games. RP 2014: 98-111 - [i11]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CoRR abs/1404.5894 (2014) - [i10]Gilles Geeraerts, Joël Goossens, Amélie Stainer:
Synthesising Succinct Strategies in Safety Games. CoRR abs/1404.6228 (2014) - [i9]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and alternating timed automata over infinite words. CoRR abs/1406.4395 (2014) - [i8]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR abs/1407.5030 (2014) - 2013
- [j6]Gilles Geeraerts, Joël Goossens, Markus Lindström:
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. Real Time Syst. 49(2): 171-218 (2013) - [c14]Gilles Geeraerts, Alexander Heußner, Jean-François Raskin:
Queue-Dispatch Asynchronous Systems. ACSD 2013: 150-159 - [c13]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri Nets. Petri Nets 2013: 49-69 - [c12]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: 55-70 - [c11]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and Alternating Timed Automata. FORMATS 2013: 47-61 - [i7]Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin:
ω-Petri nets. CoRR abs/1301.6572 (2013) - [i6]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and alternating timed automata. CoRR abs/1304.2814 (2013) - 2012
- [i5]Gilles Geeraerts, Alexander Heußner, Jean-François Raskin:
Queue-Dispatch Asynchronous Systems. CoRR abs/1201.4871 (2012) - [i4]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) - 2011
- [c10]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Event Clock Automata: From Theory to Practice. FORMATS 2011: 209-224 - [c9]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 - [c8]Markus Lindström, Gilles Geeraerts, Joël Goossens:
A faster exact multiprocessor schedulability test for sporadic tasks. RTNS 2011: 25-34 - [i3]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) - [i2]Markus Lindström, Gilles Geeraerts, Joël Goossens:
A faster exact multiprocessor schedulability test for sporadic tasks. CoRR abs/1105.5055 (2011) - [i1]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Event-Clock Automata: From Theory to Practice. CoRR abs/1107.4138 (2011) - 2010
- [j5]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) - [c7]Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin:
Lattice-Valued Binary Decision Diagrams. ATVA 2010: 158-172 - [c6]Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Safraless Procedures for Timed Specifications. FORMATS 2010: 2-22
2000 – 2009
- 2009
- [j4]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): 1107-1142 (2009) - [c5]Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert:
Realizability of Real-Time Logics. FORMATS 2009: 133-148 - 2007
- [j3]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Well-structured languages. Acta Informatica 44(3-4): 249-288 (2007) - [c4]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 - 2006
- [j2]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) - [j1]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) - 2005
- [c3]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check... Made Efficient. CAV 2005: 394-407 - 2004
- [c2]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 - [c1]Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language Expressive Power of Extended Petri Nets. EXPRESS 2004: 87-101
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
