Articles dans des revues avec comité de lecture (167)
137.
De Wulf, M., Doyen, L., & Raskin, J.-F. (2005). Systematic implementation of real-time models. Lecture notes in computer science, 3582, 139-156.
138.
Henzinger, T. A., Majumdar, R. R., & Raskin, J.-F. (2005). A classification of symbolic transition systems. ACM transactions on computational logic, 6(1), 1-32. doi:10.1145/1042038.1042039
139.
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
140.
Markey, N. N., & Raskin, J.-F. (2004). Model checking restricted sets of timed paths. Lecture notes in computer science, 3170, 432-447.
141.
De Wulf, M., Doyen, L., Markey, N. N., & Raskin, J.-F. (2004). Robustness and implementability of timed automata. Lecture notes in computer science, 3253, 118-133.
142.
Brihaye, T., Bruyère, V., & Raskin, J.-F. (2004). Model-checking for weighted timed automata. Lecture notes in computer science, 3253, 277-292.
143.
De Wulf, M., Doyen, L., & Raskin, J.-F. (2004). Almost ASAP semantics: from timed models to timed implementations. Lecture notes in computer science, 2993, 296-310.
144.
Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2004). Expand, enlarge, and check: New algorithms for the coverability problem of WSTS. Lecture notes in computer science, 3328, 287-298.
145.
Delzanno, G., Raskin, J.-F., & Van Begin, L. (2004). CSTs (Covering Sharing Trees: Compact Data Structures for Parameterized Verification. International journal on software tools for technology transfer, 5(2-3), 268-297.
146.
Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2004). On the omega-language expressive power of extended Petri nets. Electronic Notes in Theoretical Computer Science, 128(2).
147.
Finkel, A., Raskin, J.-F., Samuelides, M., & Van Begin, L. (2003). Monotonic extensions of petri nets: Forward and backward search revisited. Electronic Notes in Theoretical Computer Science, 68(6), 89-100. doi:10.1016/S1571-0661(04)80535-8
148.
Bruyère, V., Dall'Olio, E., & Raskin, J.-F. (2003). Durations, parametric model-checking in timed automata with presburger arithmetic. Lecture notes in computer science, 2607, 687-698.