Communications publiées lors de congrès ou colloques nationaux et internationaux (23)
  1. 18. Massart, T., Raskin, J.-F., & Van Begin, L. (2002). Symbolic distributed verification of a class of parametric concurrent systems. Proceedings of PDMC02: Workshop on Parallel and Distributed Model Checking (p. 6) (August 2002: Brno, Czech Republic).
  2. 19. Kremer, S., & Raskin, J.-F. (2000). Formal Verification of Non of Non-Repudiation Protocols. Proceedings of Formal Methods for Computer Security (FMCS’00) (p. 13p.) (Chicago, USA).
  3. 20. Kremer, S., & Raskin, J.-F. (2000). A Game Approach to the Verification of Exchange Protocols: Application to Non-Repudiation Protocols. Proceedings of the IFIP Working Group on “Theoretical Foundations of Security Analysis and Design 2000” (p. 6p.) WIST’00(Genève).
  4. 21. Raskin, J.-F., & Schobbens, P.-Y. (1996). Automata for Qualitative Real-Time. In Proceedings of ModelAge’96: “Formal Models of Agents” (pp. 233-240) University of Lisbon.
  5. 22. Raskin, J.-F., Tan, Y.-H., & van der Torre, L. W. (1995). How to Model Normative Behavior in Petri Nets. Proceedings of ModelAge’96: “Formal Models of Agents” (pp. 339-348) (Rotterdam).
  6. 23. Raskin, J.-F., Tan, Y.-H., & van der Torre, L. W. (1995). Modeling Deontic States in Petri Nets. Proceedings of NAIC’95:8 Seventh Dutch Conference on Artificial Intelligence (pp. 339-348) (Rotterdam).
    7.   Rapports de recherche, comptes rendus, lettres à l'éditeur, working papers (6)
  7. 1. Geeraerts, G., Raskin, J.-F., & Sznajder, N. (2011). Event-clock automata : From theory to practice.
  8. 2. Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Raskin, J.-F., & Worrell, J. (2011). On reachability for hybrid automata over bounded time.
  9. 3. Raskin, J.-F., & Servais, F. (2008). Visibly pushdown transducers.
  10. 4. Ganty, P., Meuter, C., Van Begin, L., Kalyon, G., Raskin, J.-F., & Delzanno, G. (2007). Symbolic Data Structure for Sets of k-uples of Integers.
  11. 5. Collette, S., Raskin, J.-F., & Servais, F. (2006). On the symbolic computation of the hardest configurations of the rush hour game.
  12. 6. Finkel, A., Geeraerts, G., Raskin, J.-F., & Van Begin, L. (2005). A counter-example to the minimal coverability tree algorithm.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Suivant >>