Articles dans des revues avec comité de lecture (185)

  1. 41. 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
  2. 42. 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
  3. 43. 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
  4. 44. 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
  5. 45. Brenguier, R., Raskin, J.-F., & Sankur, O. (2017). Assume-admissible synthesis. Acta informatica, 54(1), 41-83. doi:10.1007/s00236-016-0273-2
  6. 46. Hunter, P. W., Perez, G. A., & Raskin, J.-F. (2017). Looking at Mean-Payoff Through Foggy Windows. Acta informatica, 55(8), 627-647. doi:10.1007/s00236-017-0304-7
  7. 47. Hunter, P. W., Perez, G. A., & Raskin, J.-F. (2017). Reactive synthesis without regret. Acta informatica, 54(1), 3-39. doi:10.1007/s00236-016-0268-z
  8. 48. Hunter, P. W., Pauly, A., Perez, G. A., & Raskin, J.-F. (2017). Mean-Payoff Games with Partial Observation. Theoretical computer science.
  9. 49. Jacobs, S., Bloem, R., Brenguier, R., Ehlers, R., Hell, T., K"onighofer, R., Perez, G. A., Raskin, J.-F., Ryzhyk, L., Sankur, O., Seidl, M., Tentrup, L., & Walker, A. (2017). The first reactive synthesis competition (SYNTCOMP 2014). International journal on software tools for technology transfer, 19(3), 367-390. doi:10.1007/s10009-016-0416-3
  10. 50. Bruyère, V., Le Roux, S., Pauly, A., & Raskin, J.-F. (2017). On the existence of weak subgame perfect equilibria. Lecture notes in computer science, 10203 LNCS, 145-161. doi:10.1007/978-3-662-54458-7_9
  11. 51. 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
  12. 52. Filiot, E., Mazzocchi, N., & Raskin, J.-F. (2017). Decidable weighted expressions with presburger combinators. Lecture notes in computer science, 10472 LNCS, 243-256. doi:10.1007/978-3-662-55751-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 >>