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

  1. 63. Devillers, R., & Klaudel, H. (2005). Synchronous and asynchronous communications in composable parameterized high-level petri nets. Fundamenta informaticae, 66(3), 221-257.
  2. 64. Devillers, R., Klaudel, H., & Koutny, M. (2004). Petri net semantics of the finite π-calculus. Lecture notes in computer science, 3235, 309-325.
  3. 65. Devillers, R., Klaudel, H., & Riemann, R.-C. (2003). General parameterised refinement and recursion for the M-net calculus. Theoretical computer science, 300(1-3), 259-300. doi:10.1016/S0304-3975(02)00088-9
  4. 66. Devillers, R., Klaudel, H., Koutny, M., & Pommereau, F. (2003). Asynchronous Box Calculus. Fundamenta informaticae, 54(4), 295-344.
  5. 67. Best, E., Devillers, R., & Koutny, M. (2002). The box algebra = petri nets + process expressions. Information and computation, 178(1), 44-100. doi:10.1016/S0890-5401(02)93117-2
  6. 68. Devillers, R., Klaudel, H., Koutny, M., & Pommereau, F. (2002). An algebra of non-safe petri boxes. Lecture notes in computer science, 2422, 192-207.
  7. 69. Best, E., Devillers, R., & Koutny, M. (2001). Recursion and Petri nets. Acta informatica, 37(11-12), 781-829.
  8. 70. Devillers, R., & Goossens, J. (2000). Liu and Layland's schedulability test revisited. Information processing letters, 73(5), 157-161. doi:10.1016/S0020-0190(00)00016-8
  9. 71. Devillers, R., Klaudel, H., & Pelz, E. (2000). An Algebraic Box Calculus. Journal of automata, languages and combinatorics, 5(2), 81-107.
  10. 72. Devillers, R., & Goossens, J. (1999). General response time computation for the deadline driven scheduling of periodic tasks. Fundamenta informaticae, 40(2-3), 199-219.
  11. 73. Goossens, J., & Devillers, R. (1999). Feasibility intervals for the deadline driven scheduler with arbitrary deadlines. Proceedings (International Conference on Real-Time Computing Systems and Applications), 54-61. doi:10.1109/RTCSA.1999.811193
  12. 74. Best, E., Devillers, R., & Koutny, M. (1999). The box algebra — A model of nets and process expressions. Lecture notes in computer science, 1639, 344-363. doi:10.1007/3-540-48745-X_21

  13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Suivant >>