Articles dans des revues avec comité de lecture (167)
  1. 161. Raskin, J.-F., & Schobbens, P.-Y. (1999). Models Generation of a Fictitious Clock Real-Time Logic Using Sharing-Trees. Electronic Notes in Theoretical Computer Science, 23(2), 131-149.
  2. 162. Raskin, J.-F., & Schobbens, P.-Y. (1999). The Logic of Event Clocks: Decidability, Complexity and Expressiveness. Journal of automata, languages and combinatorics, 4(3), 247-284.
  3. 163. Raskin, J.-F., & Schobbens, P.-Y. (1999). The Logic of “Initially” and “Next”: Completeness and Complexity. Information processing letters, 69(5), 221-225.
  4. 164. Henzinger, T. A., Raskin, J.-F., & Schobbens, P.-Y. (1998). Axioms for Real-Time Logics. Lecture notes in computer science, 1466, 219-236.
  5. 165. Henzinger, T. A., Raskin, J.-F., & Schobbens, P.-Y. (1998). The Regular Real-Time Languages. Lecture notes in computer science, 1443, 580-591.
  6. 166. Raskin, J.-F., & Schobbens, P.-Y. (1997). Real-time Logics: Fictitious Clock as an Abstraction of Dense Time. Lecture notes in computer science, 1217, 165-182.
  7. 167. Raskin, J.-F., & Schobbens, P.-Y. (1997). State Clock Logic:: a decidable Real-Time Logic. Lecture notes in computer science, 1201, 31-47.
    8.   Communications publiées lors de congrès ou colloques nationaux et internationaux (23)
  8. 1. Balachander, M., Filiot, E., & Raskin, J.-F. (2023). LTL Reactive Synthesis with a Few Hints. In Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part II Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part II: Vol. 13994 (pp. 309-328). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-031-30820-8_20
  9. 2. Busatto-Gaston, D., Chakraborty, D., & Raskin, J.-F. (2020). Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. 31st International Conference on Concurrency Theory (CONCUR 2020). Vol. 171 (pp. 40:1-40:24). doi:10.4230/LIPIcs.CONCUR.2020.40
  10. 3. Chatterjee, K., Novotn'y, P., Perez, G. A., Raskin, J.-F., & Zikelic, D. (2017). Optimizing Expectation with Guarantees in POMDPs. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. (pp. 3725-3732) AAAI Press.
  11. 4. Hunter, P. W., Perez, G. A., & Raskin, J.-F. (2016). Minimizing Regret in Discounted-Sum Games. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France: Vol. 62 (pp. 30:1-30:17). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. doi:10.4230/LIPIcs.CSL.2016.30
  12. 5. Brenguier, R., Clemente, L., Hunter, P. W., Perez, G. A., Randour, M., Raskin, J.-F., Sankur, O., & Sassolas, M. (2016). Non-Zero Sum Games for Reactive Synthesis. In Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings: Vol. 9618 (pp. 3-23). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-319-30000-9_1
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>