Clik here to view.
On the omega-language Expressive Power of Extended Petri Nets.
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
View ArticleClik here to view.
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.
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
View ArticleClik here to view.
Expand, Enlarge and Check... Made Efficient.
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Expand, Enlarge and Check... Made Efficient. CAV 2005: 394-407
View ArticleClik here to view.
On the omega-language expressive power of extended Petri nets.
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)
View ArticleClik here to view.
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS.
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)
View ArticleClik here to view.
On the Efficient Computation of the Minimal Coverability Set for Petri Nets.
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
View ArticleClik here to view.
Well-structured languages.
Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Well-structured languages. Acta Informatica 44(3-4): 249-288 (2007)
View ArticleClik here to view.
Realizability of Real-Time Logics.
Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, Julien Reichert: Realizability of Real-Time Logics. FORMATS 2009: 133-148
View ArticleClik here to view.
Le problème de couverture pour les réseaux de Petri. Résultats classiques et...
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...
View ArticleClik here to view.
Safraless Procedures for Timed Specifications.
Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder: Safraless Procedures for Timed Specifications. FORMATS 2010: 2-22
View ArticleClik here to view.
Lattice-Valued Binary Decision Diagrams.
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin: Lattice-Valued Binary Decision Diagrams. ATVA 2010: 158-172
View ArticleClik here to view.
On the Efficient Computation of the Minimal Coverability Set of Petri Nets.
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)
View ArticleClik here to view.
Event-Clock Automata: From Theory to Practice.
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder: Event-Clock Automata: From Theory to Practice. CoRR abs/1107.4138 (2011)
View ArticleClik here to view.
A faster exact multiprocessor schedulability test for sporadic tasks.
Markus Lindström, Gilles Geeraerts, Joël Goossens: A faster exact multiprocessor schedulability test for sporadic tasks. CoRR abs/1105.5055 (2011)
View ArticleClik here to view.
On Reachability for Hybrid Automata over Bounded Time.
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)
View ArticleClik here to view.
A faster exact multiprocessor schedulability test for sporadic tasks.
Markus Lindström, Gilles Geeraerts, Joël Goossens: A faster exact multiprocessor schedulability test for sporadic tasks. RTNS 2011: 25-34
View ArticleClik here to view.
On Reachability for Hybrid Automata over Bounded Time.
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
View ArticleClik here to view.
Event Clock Automata: From Theory to Practice.
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder: Event Clock Automata: From Theory to Practice. FORMATS 2011: 209-224
View ArticleClik here to view.
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints.
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)
View ArticleClik here to view.
Queue-Dispatch Asynchronous Systems.
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin: Queue-Dispatch Asynchronous Systems. CoRR abs/1201.4871 (2012)
View Article
