Gilles Geeraerts
Gilles Geeraerts
Associate Prof. of Computer Science, Université Libre de Bruxelles (ULB)
Bestätigte E-Mail-Adresse bei ulb.ac.be - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1242005
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
402007
Well-structured languages
G Geeraerts, JF Raskin, L Van Begin
Acta Informatica 44 (3-4), 249-288, 2007
392007
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
G Geeraerts, J Goossens, M Lindström
Real-time systems 49 (2), 171-218, 2013
322013
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
302010
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
292011
Expand, enlarge and check... made efficient
G Geeraerts, JF Raskin, L Van Begin
International Conference on Computer Aided Verification, 394-407, 2005
292005
On MITL and alternating timed automata
T Brihaye, M Estiévenart, G Geeraerts
International Conference on Formal Modeling and Analysis of Timed Systems, 47-61, 2013
232013
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
222017
Realizability of real-time logics
L Doyen, G Geeraerts, JF Raskin, J Reichert
International Conference on Formal Modeling and Analysis of Timed Systems …, 2009
212009
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, 55-70, 2013
192013
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
192005
Adding negative prices to priced timed games
T Brihaye, G Geeraerts, SN Krishna, L Manasa, B Monmege, A Trivedi
International Conference on Concurrency Theory, 560-575, 2014
182014
Safraless procedures for timed specifications
B Di Giampaolo, G Geeraerts, JF Raskin, N Sznajder
International Conference on Formal Modeling and Analysis of Timed Systems, 2-22, 2010
172010
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
T Brihaye, G Geeraerts, A Haddad, B Monmege
Acta Informatica 54 (1), 85-125, 2017
162017
On MITL and alternating timed automata over infinite words
T Brihaye, M Estiévenart, G Geeraerts
International Conference on Formal Modeling and Analysis of Timed Systems, 69-84, 2014
152014
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
15*2014
Coverability and Expressiveness Properties of Well-structured Transition Systems
G Geeraerts
These de doctorat, Université Libre de Bruxelles, Belgique, 2007
152007
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
152005
ω-Petri nets
G Geeraerts, A Heußner, M Praveen, JF Raskin
International Conference on Applications and Theory of Petri Nets and …, 2013
112013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20