Articles dans des revues avec comité de lecture (167)
  1. 101. Doyen, L., & Raskin, J.-F. (2009). Antichains for the automata-based approach to model-checking. Logical methods in computer science, 5(1), 1-20. doi:10.2168/LMCS-5 (1:5) 2009
  2. 102. Doyen, L., Geeraerts, G., Raskin, J.-F., & Reichert, J. (2009). Realizability of real-time logics. Lecture notes in computer science, 5813.
  3. 103. De Wulf, M., Doyen, L., Markey, N. N., & Raskin, J.-F. (2008). Robust safety of timed automata. Formal methods in system design, 33(1-3), 45-84. doi:10.1007/s10703-008-0056-7
  4. 104. Doyen, L., Henzinger, T. A., & Raskin, J.-F. (2008). Equivalence of labeled Markov chains. International journal of foundations of computer science, 19(3), 549-563. doi:10.1142/S0129054108005814
  5. 105. Bruyère, V., Dall'Olio, E., & Raskin, J.-F. (2008). Durations and parametric model-checking in timed automata. ACM transactions on computational logic, 9(2), 12. doi:10.1145/1342991.1342996
  6. 106. 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.
  7. 107. 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
  8. 108. 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
  9. 109. Raskin, J.-F., & Servais, F. (2008). Visibly pushdown transducers. Lecture notes in computer science, 5126, 386-397.
  10. 110. 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.
  11. 111. 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
  12. 112. 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
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>