Articles dans des revues avec comité de lecture (40)
  1. 13. Brihaye, T., Geeraerts, G., Haddad, A., Monmege, B., Pérez, G. G., & Renault, G. (2015). Quantitative Games under Failures. Leibniz international proceedings in informatics, 45, 293-306. doi:10.4230/LIPIcs.FSTTCS.2015.293
  2. 14. Brihaye, T., Geeraerts, G., Haddad, A., Lefaucheux, E., & Monmege, B. (2015). Simple Priced Timed Games are not That Simple. Leibniz international proceedings in informatics, 45, 278-292. doi:10.4230/LIPIcs.FSTTCS.2015.278
  3. 15. Brihaye, T., Geeraerts, G., Haddad, A., & Monmege, B. (2015). To reach or not to reach? efficient algorithms for total-payoff games. Leibniz international proceedings in informatics, 42, 297-310. doi:10.4230/LIPIcs.CONCUR.2015.297
  4. 16. Geeraerts, G., Heussner, A. E., & Raskin, J.-F. (2015). On the Verification of Concurrent, Asynchronous Programs with Waiting Queues. ACM transactions on embedded computing systems, 14(3), 58-1--58-26. doi:10.1145/2700072
  5. 17. Geeraerts, G., Raskin, J.-F., & Sznajder, N. (2014). On regions and zones for event-clock automata. Formal methods in system design, 45(3). doi:10.1007/s10703-014-0212-1
  6. 18. Brihaye, T., Geeraerts, G., & Estievenart, M. (2014). On MITL and alternating timed automata on infinite words. Lecture notes in computer science, 8711.
  7. 19. Brihaye, T., Geeraerts, G., SHANKARA NARAYANAN, K., MANASA, L., Monmege, B., & Trivedi, A. (2014). Adding negative prices to priced timed games. Lecture notes in computer science, 8704. doi:10.1007/978-3-662-44584-6_38
  8. 20. Geeraerts, G., Goossens, J., & Stainer, A. (2014). Synthesising succinct strategies in safety games. Lecture notes in computer science, 8762, 98-111. doi:10.1007/978-3-319-11439-2_8
  9. 21. Geeraerts, G., Heussner, A. E., Praveen, M., & Raskin, J.-F. (2013). omega-Petri nets. Lecture Notes in Computer Science, 7927 LNCS, 49-69.
  10. 22. Geeraerts, G., Heussner, A. E., & Raskin, J.-F. (2013). Queue-dispatch asynchronous systems. Proceedings (International Conference on Application of Concurrency to System Design),, 10.1109/ACSD.2013.18 150-159.
  11. 23. Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Raskin, J.-F., & Worrell, J. (2013). Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. Lecture Notes in Computer Science, 8172, 55-70.
  12. 24. Brihaye, T., Geeraerts, G., & Estievenart, M. (2013). On MITL and alternating timed automata. Lecture notes in computer science,(8053).
    13. << Précédent 1 2 3 4 5 6 Suivant >>