Articles dans des revues avec comité de lecture (40)
  1. 25. Geeraerts, G., Goossens, J., & Lindstrom, M. (2013). Multiprocessor schedulability of arbitrary- deadline sporadic tasks : Complexity and antichain algorithm. Real-time systems, 48(2). doi:10.1007/s11241-012-9172-y
  2. 26. Geeraerts, G., Raskin, J.-F., & Sznajder, N. (2011). Event clock automata: From theory to practice. Lecture notes in computer science, 6919 LNCS, 209-224. doi:10.1007/978-3-642-24310-3_15
  3. 27. Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Worrell, J., & Raskin, J.-F. (2011). On reachability for hybrid automata over bounded time. Lecture notes in computer science, 6756.
  4. 28. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2010). On the efficient computation of the minimal coverability set of petri nets. International journal of foundations of computer science, 21(2), 135-165. doi:10.1142/S0129054110007180
  5. 29. Ganty, P., Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2010). Le problème de couverture pour les réseaux de Petri: résultats classiques et développements récents. TSI. Technique et science informatiques, 28(9), 1107-1142.
  6. 30. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2010). On the efficient computation of the coverability set of Petri nets. International journal of foundations of computer science, 21(2), 135-165.
  7. 31. Geeraerts, G., Kalyon, G., Le Gall, T., Maquet, N., & Raskin, J.-F. (2010). Lattice-Valued Binary Decision Diagrams. Lecture notes in computer science, 6252, 158-172. doi:10.1007/978-3-642-15643-4_13
  8. 32. Di Giampaolo, B., Geeraerts, G., Raskin, J.-F., & Sznajder, N. (2010). Safraless Procedures for Timed Specifications. Lecture notes in computer science, 6246, 2-22. doi:10.1007/978-3-642-15297-9_2
  9. 33. Doyen, L., Geeraerts, G., Raskin, J.-F., & Reichert, J. (2009). Realizability of real-time logics. Lecture notes in computer science, 5813.
  10. 34. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2007). Well-structured languages. Acta informatica, 44(3-4), 249-288. doi:10.1007/s00236-007-0050-3
  11. 35. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2007). On the efficient computation of the minimal coverability set of Petri nets. Lecture notes in computer science, 4762.
  12. 36. Finkel, A., Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2006). On the omega-language expressive power of extended Petri nets. Theoretical computer science, 356(3), 374-386. doi:10.1016/j.tcs.2006.02.008
    13. << Précédent 1 2 3 4 5 6 Suivant >>