Articles dans des revues avec comité de lecture (167)
  1. 17. Jacobs, S., Michaud, T., Perez, G. A., Raskin, J.-F., Sankur, O., Tentrup, L., Basset, N., Bloem, R., Brenguier, R., Colange, M., Faymonville, P., Finkbeiner, B., Khalimov, A., & Klein, F. (2017). The 4th reactive synthesis competition (SYNTCOMP 2017): Benchmarks, participants & results. Electronic proceedings in theoretical computer science, 260, 116-143. doi:10.4204/EPTCS.260.10
  2. 18. Bohy, A., Bruyère, V., Raskin, J.-F., & Bertrand, N. (2017). Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta informatica, 54(6), 545-587. doi:10.1007/s00236-016-0255-4
  3. 19. Filiot, E., Jecker, I. R., Lhote, N., Perez, G. A., & Raskin, J.-F. (2017). On delay and regret determinization of max-plus automata. Proceedings - Symposium on Logic in Computer Science., 8005096. doi:10.1109/LICS.2017.8005096
  4. 20. Brenguier, R., Pauly, A., Raskin, J.-F., & Sankur, O. (2017). Admissibility in games with imperfect information. Leibniz international proceedings in informatics, 85, 2. doi:10.4230/LIPIcs.CONCUR.2017.2
  5. 21. Berthon, R., Randour, M., & Raskin, J.-F. (2017). Threshold constraints with guarantees for parity objectives in markov decision processes. Leibniz international proceedings in informatics, 80, 121. doi:10.4230/LIPIcs.ICALP.2017.121
  6. 22. Basset, N., Geeraerts, G., Raskin, J.-F., & Sankur, O. (2017). Admissibility in concurrent games. Leibniz international proceedings in informatics, 80, 123. doi:10.4230/LIPIcs.ICALP.2017.123
  7. 23. Randour, M., Raskin, J.-F., & Sankur, O. (2017). Percentile queries in multi-dimensional Markov decision processes. Formal methods in system design, 50(2-3), 207-248. doi:10.1007/s10703-016-0262-7
  8. 24. Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2017). Doomsday equilibria for omega-regular games. Information and computation, 254(2), 296-315. doi:10.1016/j.ic.2016.10.012
  9. 25. Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (2017). Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Information and computation, 254(2), 259-295. doi:10.1016/j.ic.2016.10.011
  10. 26. Le Roux, S., Pauly, A., & Raskin, J.-F. (2017). Minkowski games. Leibniz international proceedings in informatics, 66, 50. doi:10.4230/LIPIcs.STACS.2017.50
  11. 27. Brenguier, R., Raskin, J.-F., & Sankur, O. (2017). Assume-admissible synthesis. Acta informatica, 54(1), 41-83. doi:10.1007/s00236-016-0273-2
  12. 28. Esparza, J., Křetínský, J., Raskin, J.-F., & Sickert, S. (2017). From ltl and limit-deterministic büchi automata to deterministic parity automata. Lecture notes in computer science, 10205 LNCS, 426-442. doi:10.1007/978-3-662-54577-5_25
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>