Articles dans des revues avec comité de lecture (40)
  1. 1. Brihaye, T., Geeraerts, G., Haddad, A., Lefaucheux, E., & Monmege, B. (2022). ONE-CLOCK PRICED TIMED GAMES WITH NEGATIVE WEIGHTS. Logical methods in computer science, 18(3), 17:1-17:51. doi:10.46298/lmcs-18(3:17)2022
  2. 2. Geeraerts, G., Goossens, J., Nguyen, T.-V.-A., & Stainer, A. (2018). Synthesising Succinct Strategies in Safety Games with an Application to Real-time Scheduling. Theoretical computer science, 735, 24-49. doi:10.1016/j.tcs.2017.06.004
  3. 3. Geeraerts, G., Guha, S., & Raskin, J.-F. (2018). Safe and optimal scheduling of hard and soft tasks. Leibniz international proceedings in informatics, 122, 36, 1-22.
  4. 4. Geeraerts, G., Goossens, J., & Nguyen, T.-V.-A. (2017). A backward algorithm for the multiprocessor online feasibility of sporadic tasks. Proceedings (International Conference on Application of Concurrency to System Design), 2017-June, 8104033, 116-125. doi:10.1109/ACSD.2017.9
  5. 5. Brihaye, T., Geeraerts, G., Ho, H. M., & Monmege, B. (2017). Timed-automata-based verification of MITL over signals. Leibniz international proceedings in informatics, 90, 7. doi:10.4230/LIPIcs.TIME.2017.7
  6. 6. Geeraerts, G., Levy, E., & Pluquet, F. (2017). Models and algorithms for chronology. Leibniz international proceedings in informatics, 90, 13. doi:10.4230/LIPIcs.TIME.2017.13
  7. 7. Brihaye, T., Geeraerts, G., Hallety, M., & Le Roux, S. (2017). Dynamics and coalitions in sequential games. Electronic proceedings in theoretical computer science, 256, 136-150. doi:10.4204/EPTCS.256.10
  8. 8. 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
  9. 9. Brihaye, T., Geeraerts, G., Haddad, A., & Monmege, B. (2017). Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta informatica, 54(1), 85--125. doi:10.1007/s00236-016-0276-z
  10. 10. Brihaye, T., Geeraerts, G., Ho, H. M., & Monmege, B. (2017). Mightyl: A compositional translation from MITL to timed automata. Lecture notes in computer science, 10426 LNCS, 421-440. doi:10.1007/978-3-319-63387-9_21
  11. 11. Brihaye, T., Estievenart, M., Geeraerts, G., Ho, H. M., Monmege, B., & Sznajder, N. (2016). Real-time synthesis is hard! Lecture notes in computer science, 9884, 105-120. doi:10.1007/978-3-319-44878-7_7
  12. 12. Geeraerts, G., Heussner, A. E., Praveen, S. M., & Raskin, J.-F. (2015). omega-Petri Nets: Algorithms and Complexity. Fundamenta informaticae, 137(1), 29-60. doi:10.3233/FI-2015-1169
    13. << Précédent 1 2 3 4 5 6 Suivant >>