Suivre
Gilles Geeraerts
Gilles Geeraerts
Associate Prof. of Computer Science, Université libre de Bruxelles (ULB)
Adresse e-mail validée de ulb.be - Page d'accueil
Titre
Citée par
Citée par
Année
Expand, enlarge, and check: New algorithms for the coverability problem of WSTS
G Geeraerts, JF Raskin, L Van Begin
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005
1272005
On the efficient computation of the minimal coverability set for Petri nets
G Geeraerts, JF Raskin, L Van Begin
International Symposium on Automated Technology for Verification and …, 2007
452007
Well-structured languages
G Geeraerts, JF Raskin, L Van Begin
Acta Informatica 44 (3), 249-288, 2007
422007
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
G Geeraerts, J Goossens, M Lindström
Real-time systems 49, 171-218, 2013
412013
MightyL: A Compositional Translation from MITL to Timed Automata
T Brihaye, G Geeraerts, HM Ho, B Monmege
International Conference on Computer Aided Verification, 421-440, 2017
372017
On reachability for hybrid automata over bounded time
T Brihaye, L Doyen, G Geeraerts, J Ouaknine, JF Raskin, J Worrell
International Colloquium on Automata, Languages, and Programming, 416-427, 2011
342011
On the efficient computation of the minimal coverability set of petri nets
G Geeraerts, JF Raskin, L Van Begin
International Journal of Foundations of Computer Science 21 (02), 135-165, 2010
342010
Expand, enlarge and check... made efficient
G Geeraerts, JF Raskin, L Van Begin
International Conference on Computer Aided Verification, 394-407, 2005
312005
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
T Brihaye, G Geeraerts, A Haddad, B Monmege
Acta Informatica 54, 85-125, 2017
272017
Adding negative prices to priced timed games
T Brihaye, G Geeraerts, S Narayanan Krishna, L Manasa, B Monmege, ...
International Conference on Concurrency Theory, 560-575, 2014
262014
On MITL and alternating timed automata
T Brihaye, M Estiévenart, G Geeraerts
Formal Modeling and Analysis of Timed Systems: 11th International Conference …, 2013
242013
Realizability of real-time logics
L Doyen, G Geeraerts, JF Raskin, J Reichert
International Conference on Formal Modeling and Analysis of Timed Systems …, 2009
242009
To reach or not to reach? Efficient algorithms for total-payoff games
T Brihaye, G Geeraerts, A Haddad, B Monmege
arXiv preprint arXiv:1407.5030, 2014
232014
Time-bounded reachability for monotonic hybrid automata: Complexity and fixed points
T Brihaye, L Doyen, G Geeraerts, J Ouaknine, JF Raskin, J Worrell
Automated Technology for Verification and Analysis: 11th International …, 2013
222013
On the ω-language Expressive Power of Extended Petri Nets
A Finkel, G Geeraerts, JF Raskin, L Van Begin
Electronic Notes in Theoretical Computer Science 128 (2), 87-101, 2005
222005
Safraless procedures for timed specifications
B Di Giampaolo, G Geeraerts, JF Raskin, N Sznajder
Formal Modeling and Analysis of Timed Systems: 8th International Conference …, 2010
172010
Simple priced timed games are not that simple
T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege
arXiv preprint arXiv:1507.03786, 2015
162015
Coverability and Expressiveness Properties of Well-structured Transition Systems
G Geeraerts
These de doctorat, Université Libre de Bruxelles, Belgique, 2007
162007
A counter-example to the minimal coverability tree algorithm
A Finkel, G Geeraerts, JF Raskin, L Van Begin
Université Libre de Bruxelles, Tech. Rep 535, 2005
162005
On MITL and alternating timed automata over infinite words
T Brihaye, M Estiévenart, G Geeraerts
Formal Modeling and Analysis of Timed Systems: 12th International Conference …, 2014
152014
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20