Articles dans des revues avec comité de lecture (167)
  1. 29. 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
  2. 30. 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
  3. 31. Hunter, P. W., Pauly, A., Perez, G. A., & Raskin, J.-F. (2017). Mean-Payoff Games with Partial Observation. Theoretical computer science.
  4. 32. 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
  5. 33. 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
  6. 34. 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
  7. 35. Bruyère, V., Hautem, Q., & Raskin, J.-F. (2016). On the complexity of heterogeneous multidimensional quantitative games. Leibniz international proceedings in informatics, 59, 11. doi:10.4230/LIPIcs.CONCUR.2016.11
  8. 36. Bozianu, R., Filiot, E., Gentilini, R., & Raskin, J.-F. (2016). The Complexity of Rational Synthesis (ICALP'16). Automata, languages and programming, 14.
  9. 37. Chechik, M., & Raskin, J.-F. (2016). Tools and Algorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016 held as part of the european joint conferences on theory and practice of software, ETAPS 2016 Eindhoven, The Netherlands, April 2-8, 2016 proceedings. Lecture notes in computer science, 9636, 7-8. doi:10.1007/978-3-662-49674-9
  10. 38. Brihaye, T., Bruyère, V., Meunier, N., & Raskin, J.-F. (2015). Weak subgame perfect equilibria and their application to quantitative reachability. Leibniz international proceedings in informatics, 41, 504-518. doi:10.4230/LIPIcs.CSL.2015.504
  11. 39. Brenguier, R., Raskin, J.-F., & Sankur, O. (2015). Assume-admissible synthesis. Leibniz international proceedings in informatics, 42, 100-113. doi:10.4230/LIPIcs.CONCUR.2015.100
  12. 40. Clemente, L., & Raskin, J.-F. (2015). Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives. Proceedings - Symposium on Logic in Computer Science, 2015-July, 7174887, 257-268. doi:10.1109/LICS.2015.33
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>