Articles dans des revues avec comité de lecture (167)
125.
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
126.
Brihaye, T., Bruyère, V., & Raskin, J.-F. (2006). On model-checking timed automata with stopwatch observers. Information and computation, 204(3), 408-433. doi:10.1016/j.ic.2005.12.001
127.
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
128.
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.
129.
De Wulf, M., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2006). Antichains: A new algorithm for checking universality of finite automata. Lecture notes in computer science, 4144 LNCS, 17-30.
130.
De Wulf, M., Doyen, L., & Raskin, J.-F. (2006). A lattice theory for solving games of imperfect information. Lecture notes in computer science, 3927 LNCS, 153-168.
131.
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2006). Algorithms for omega-regular games with imperfect information. Lecture notes in computer science, 4207 LNCS, 287-302.
132.
De Wulf, M., Doyen, L., & Raskin, J.-F. (2005). Almost ASAP semantics: from timed models to timed implementations. Formal aspects of computing, 17(3), 319-341. doi:10.1007/s00165-005-0067-8
133.
Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2005). Expand, Enlarge and Check... Made Efficient. Lecture notes in computer science, 3576, 394-407.
134.
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
135.
Brihaye, T., Bruyère, V., & Raskin, J.-F. (2005). On optimal timed strategies. Lecture notes in computer science, 3829 LNCS, 49-64. doi:10.1007/11603009_5
136.
Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2005). Automatic rectangular refinement of affine hybrid systems. Lecture notes in computer science, 3829 LNCS, 144-161. doi:10.1007/11603009_13