Articles dans des revues avec comité de lecture (167)
  1. 113. Collette, S., Raskin, J.-F., & Servais, F. (2007). On the symbolic computation of the hardest configurations of the RUSH HOUR game. Lecture notes in computer science, 4630, 220-233. doi:10.1007/978-3-540-75538-8_20
  2. 114. 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.
  3. 115. Cousot, P. P., Ganty, P., & Raskin, J.-F. (2007). Fixpoint-guided abstraction refinements. Lecture notes in computer science, 4634 LNCS, 333-348.
  4. 116. 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. 117. 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. 118. 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.
  7. 119. Bruyère, V., & Raskin, J.-F. (2007). Real-Time Model-Checking: Parameters Everywhere. Logical methods in computer science, 3(1), 7, 1-30. doi:10.2168/LMCS-3(1:7)2007
  8. 120. Raskin, J.-F. (2007). Controller Synthesis using Lattice Theory. Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes, 156-160.
  9. 121. Chartejee, K., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2007). Algorithms for omega-Regular with Imperfect Information. Logical methods in computer science, 3, 1-23.
  10. 122. 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.
  11. 123. Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2007). Algorithms for Omega-Regular Games with Imperfect Information. Logical methods in computer science, 3(4), 1-23. doi:10.2168/LMCS-3(3:4)2007
  12. 124. 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
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>