Articles dans des revues avec comité de lecture (185)
  1. 125. De Wulf, M., Doyen, L., Maquet, N., & Raskin, J.-F. (2008). LTL Satisfiability, Alternating B¨uchi Automata Emptiness, and Model Checking with ALASKA. Lecture notes in computer science, 5311, 240-245.
  2. 126. De Wulf, M., Doyen, L., Maquet, N., & Raskin, J.-F. (2008). ALASKA: antichains for logic, automata and symbolic Kripke structures analysis. Lecture notes in computer science, 5311 LNCS, 240-245. doi:10.1007/978-3-540-88387-6_21
  3. 127. De Wulf, M., Doyen, L., Maquet, N., & Raskin, J.-F. (2008). Antichains: alternative algorithms for LTL satisfiability and model-checking. Lecture notes in computer science, 4963, 63-77. doi:10.1007/978-3-540-78800-3_6
  4. 128. Ganty, P., Raskin, J.-F., & Van Begin, L. (2008). From many places to few: Automatic abstraction refinement for petri nets. Fundamenta informaticae, 88(3), 275-305.
  5. 129. Bouyer, P. P., Brihaye, T., Bruyère, V., & Raskin, J.-F. (2007). On the optimal reachability problem of weighted timed automata. Formal methods in system design, 31(2), 135-175. doi:10.1007/s10703-007-0035-4
  6. 130. Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2007). Well-structured languages. Acta informatica, 44(3-4), 249-288. doi:10.1007/s00236-007-0050-3
  7. 131. 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. 132. 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.
  9. 133. 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.
  10. 134. 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
  11. 135. 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.
  12. 136. 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
    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 >>