Articles dans des revues avec comité de lecture (185)
  1. 89. Bulychev, P. E., Cassez, F. F., David, A., Larsen, K. G., Raskin, J.-F., & Reynier, P.-A. (2012). Controllers with Minimal Observation Power: Application to Timed Systems. Lecture notes in computer science, 7561, 223-237.
  2. 90. Bohy, A., Bruyère, V., Filiot, E., & Raskin, J.-F. (2012). ACACIA+ a Tool for LTL Synthesis. Lecture notes in computer science, 7358, 652-657.
  3. 91. Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy Synthesis for Multi-dimensional Quantitative Objectives. Lecture notes in computer science, 7454 LNCS, 115-131. doi:10.1007/978-3-642-32940-1_10
  4. 92. Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., & Raskin, J.-F. (2012). Faster Algorithms for Mean-payoff Games. Formal methods in system design, 38(2), 97-118. doi:10.1007/s10703-010-0105-x
  5. 93. 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
  6. 94. Filiot, E., Jin, N., & Raskin, J.-F. (2011). Antichains and compositional algorithms for LTL synthesis. Formal methods in system design, 39(3), 261-296. doi:10.1007/s10703-011-0115-3
  7. 95. Hermanns, H., Larsen, K. G., Raskin, J.-F., & Tretyakov, J. (2011). Quantitative System Validation in Model Driven Design. ACM Annual Computer Science Conference, 301-302.
  8. 96. 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
  9. 97. 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
  10. 98. 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.
  11. 99. 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
  12. 100. 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
    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 >>