Articles dans des revues avec comité de lecture (167)
  1. 77. Raskin, J.-F. (2011). Reachability Problems for Hybrid Automata. Lecture notes in computer science, 6945, 28-30. doi:10.1007/978-3-642-24288-5_4
  2. 78. Brihaye, T., Bruyère, V., Doyen, L., Ducobu, M., & Raskin, J.-F. (2011). Antichain-based solving for QBF. Lecture notes in computer science, 6996, 183-197. doi:10.1007/978-3-642-24372-1_14
  3. 79. Geeraerts, G., Raskin, J.-F., & Sznajder, N. (2011). Event clock automata: From theory to practice. Lecture notes in computer science, 6919 LNCS, 209-224. doi:10.1007/978-3-642-24310-3_15
  4. 80. Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Worrell, J., & Raskin, J.-F. (2011). On reachability for hybrid automata over bounded time. Lecture notes in computer science, 6756.
  5. 81. Ganty, P., Maquet, N., & Raskin, J.-F. (2010). Fixed point guided abstraction refinement for alternating automata. Theoretical computer science, 411(38-39), 3444-3459. doi:10.1016/j.tcs.2010.05.037
  6. 82. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2010). On the efficient computation of the minimal coverability set of petri nets. International journal of foundations of computer science, 21(2), 135-165. doi:10.1142/S0129054110007180
  7. 83. Ganty, P., Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2010). Le problème de couverture pour les réseaux de Petri: résultats classiques et développements récents. TSI. Technique et science informatiques, 28(9), 1107-1142.
  8. 84. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2010). On the efficient computation of the coverability set of Petri nets. International journal of foundations of computer science, 21(2), 135-165.
  9. 85. Chartejee, K., Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2010). Generalized Mean-payoff and Energy Games. Leibniz international proceedings in informatics, 1-12.
  10. 86. Filiot, E., Le Gall, T., & Raskin, J.-F. (2010). Iterated regret minimization in game graphs. Lecture notes in computer science, 6281, 342-354. doi:10.1007/978-3-642-15155-2_31
  11. 87. Geeraerts, G., Kalyon, G., Le Gall, T., Maquet, N., & Raskin, J.-F. (2010). Lattice-Valued Binary Decision Diagrams. Lecture notes in computer science, 6252, 158-172. doi:10.1007/978-3-642-15643-4_13
  12. 88. Filiot, E., Jin, N., & Raskin, J.-F. (2010). Compositional Algorithms for LTL Synthesis. Lecture notes in computer science, 6252, 112-127.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>