Articles dans des revues avec comité de lecture (185)
  1. 137. Brihaye, T., Henzinger, T. A., Prabhu, V. S., & Raskin, J.-F. (2007). Minimum-time reachability in timed games. Lecture notes in computer science, 4596 LNCS, 825-837.
  2. 138. Cousot, P. P., Ganty, P., & Raskin, J.-F. (2007). Fixpoint-guided abstraction refinements. Lecture notes in computer science, 4634 LNCS, 333-348.
  3. 139. Doyen, L., & Raskin, J.-F. (2007). Improved algorithms for the automata-based approach to model-checking. Lecture notes in computer science, 4424 LNCS, 451-465.
  4. 140. Cassez, F. F., David, A., Larsen, K. G., Lime, D., & Raskin, J.-F. (2007). Timed control with observation based and stuttering invariant strategies. Lecture notes in computer science, 4762 LNCS, 192-206.
  5. 141. Ganty, P., Raskin, J.-F., & Van Begin, L. (2007). From many places to few: Automatic abstraction refinement for Petri nets. Lecture notes in computer science, 4546 LNCS, 124-143.
  6. 142. Markey, N. N., & Raskin, J.-F. (2006). Model checking restricted sets of timed paths. Theoretical computer science, 358(2-3), 273-292. doi:10.1016/j.tcs.2006.01.019
  7. 143. 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
  8. 144. 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
  9. 145. 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
  10. 146. 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.
  11. 147. 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.
  12. 148. 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.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 Suivant >>