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

  1. 46. Filiot, E., Krishna, S. N., & Trivedi, A. (2014). First-order definable string transformations (FSTTCS'14). Leibniz international proceedings in informatics, 29, 147-159. doi:10.4230/LIPIcs.FSTTCS.2014.147
  2. 47. Bozianu, R., Dima, C., & Filiot, E. (2014). Safraless Synthesis for Epistemic Temporal Specifications: (CAV'14). Lecture notes in computer science. doi:10.1007/978-3-319-08867-9_29
  3. 48. Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (2014). Expectations or guarantees? i Want It All! A crossroad between games and MDPs. Electronic proceedings in theoretical computer science, 146, 1-8. doi:10.4204/EPTCS.146.1
  4. 49. Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (2014). Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (STACS'14). Leibniz international proceedings in informatics.
  5. 50. Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday Equilibria for Omega-Regular Games (VMCAI'14). Lecture notes in computer science, 8318, 78-97. doi:10.1007/978-3-642-54013-4_5
  6. 51. Filiot, E., Gauwin, O., Reynier, P.-A., & Servais, F. (2013). From Two-Way To One-Way Finite State Transducers. Proceedings - Symposium on Logic in Computer Science.
  7. 52. Bohy, A., Bruyère, V., Filiot, E., & Raskin, J.-F. (2013). Synthesis from LTL specifications with mean-payoff objectives. Lecture notes in computer science.
  8. 53. Filiot, E., Jin, N., & Raskin, J.-F. (2013). Exploiting structure in LTL synthesis. International Journal on Software Tools for Technology Transfer, 15(5-6), 541-561.
  9. 54. Alur, R., Filiot, E., & Trivedi, A. (2012). Regular Transformations of Infinite Strings. Proceedings - Symposium on Logic in Computer Science.
  10. 55. 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.
  11. 56. Filiot, E., Gentilini, R., & Raskin, J.-F. (2012). Quantitative languages defined by functional automata. Lecture notes in computer science, 7454 LNCS, 132-146. doi:10.1007/978-3-642-32940-1_11
  12. 57. Filiot, E., & Servais, F. (2012). Visibly pushdown transducers with look-ahead. Lecture notes in computer science, 7147 LNCS, 251-263. doi:10.1007/978-3-642-27660-6_21

  13. << Précédent 1 2 3 4 5 6 7 8 Suivant >>