| 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 | 127 | 2005 |
| 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 | 45 | 2007 |
| Well-structured languages G Geeraerts, JF Raskin, L Van Begin Acta Informatica 44 (3), 249-288, 2007 | 42 | 2007 |
| 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 | 41 | 2013 |
| 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 | 37 | 2017 |
| 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 | 34 | 2011 |
| 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 | 34 | 2010 |
| Expand, enlarge and check... made efficient G Geeraerts, JF Raskin, L Van Begin International Conference on Computer Aided Verification, 394-407, 2005 | 31 | 2005 |
| 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 | 27 | 2017 |
| 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 | 26 | 2014 |
| On MITL and alternating timed automata T Brihaye, M Estiévenart, G Geeraerts Formal Modeling and Analysis of Timed Systems: 11th International Conference …, 2013 | 24 | 2013 |
| Realizability of real-time logics L Doyen, G Geeraerts, JF Raskin, J Reichert International Conference on Formal Modeling and Analysis of Timed Systems …, 2009 | 24 | 2009 |
| 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 | 23 | 2014 |
| 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 | 22 | 2013 |
| 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 | 22 | 2005 |
| 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 | 17 | 2010 |
| Simple priced timed games are not that simple T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege arXiv preprint arXiv:1507.03786, 2015 | 16 | 2015 |
| Coverability and Expressiveness Properties of Well-structured Transition Systems G Geeraerts These de doctorat, Université Libre de Bruxelles, Belgique, 2007 | 16 | 2007 |
| 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 | 16 | 2005 |
| 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 | 15 | 2014 |
Jean-François RaskinUniversité Libre de Bruxelles, U.L.B.ulb.ac.be의 이메일 확인됨
