Articles dans des revues avec comité de lecture (31)
  1. 13. Kalyon, G., Massart, T., Meuter, C., & Van Begin, L. (2007). Testing distributed systems through symbolic model checking. Lecture notes in computer science, 4574 LNCS, 263-279.
  2. 14. Abdulla, P. A., Delzanno, G., & Van Begin, L. (2007). Comparing the expressive power of well-structured transition systems. Lecture notes in computer science, 4646 LNCS, 99-114.
  3. 15. 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.
  4. 16. Delzanno, G., & Van Begin, L. (2007). On the dynamics of PB systems with volatile membranes. Lecture notes in computer science, 4860 LNCS, 240-256.
  5. 17. Devillers, R., & Van Begin, L. (2006). Boundedness undecidability for synchronized nets. Information processing letters, 99(5), 208-214. doi:10.1016/j.ipl.2006.04.009
  6. 18. 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
  7. 19. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2006). Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. Journal of computer and system sciences, 72(1), 180-203. doi:10.1016/j.jcss.2005.09.001
  8. 20. Ganty, P., Raskin, J.-F., & Van Begin, L. (2006). A complete abstract interpretation framework for coverability properties of WSTS. Lecture notes in computer science, 3855 LNCS, 49-64.
  9. 21. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2005). Expand, Enlarge and Check... Made Efficient. Lecture notes in computer science, 3576, 394-407.
  10. 22. Raskin, J.-F., Samuelides, M., & Van Begin, L. (2005). Games for counting abstractions. Electronic Notes in Theoretical Computer Science, 128(6), 69-85. doi:10.1016/j.entcs.2005.04.005
  11. 23. Darlot, C., Finkel, A., & Van Begin, L. (2005). About fast and TReX accelerations. Electronic Notes in Theoretical Computer Science, 128(6), 87-103. doi:10.1016/j.entcs.2005.04.006
  12. 24. Raskin, J.-F., & Van Begin, L. (2004). Petri nets with non-blocking arcs are difficult to analyze. Electronic Notes in Theoretical Computer Science, 98, 35-55. doi:10.1016/j.entcs.2003.10.005
    13. << Précédent 1 2 3 4 Suivant >>