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

  1. 75. Best, E., Devillers, R., & Koutny, M. (1999). The Box Algebra - A Model of Nets and Process Expressions: in Proceedings of the 20th International Conference on Application and Theory of Petri Nets (ICATPN'99). Lecture notes in computer science, 1639, 344-363. doi:10.1007/3-540-48745-X_21
  2. 76. Devillers, R., & Koutny, M. (1998). Recursive nets in the box algebra. Proceedings (International Conference on Application of Concurrency to System Design), 1998-March, 657555, 239-249. doi:10.1109/CSD.1998.657555
  3. 77. Goossens, J., & Devillers, R. (1997). The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems. Real-time systems, 13(2), 107-126.
  4. 78. Devillers, R., Klaudel, H., & Riemann, R.-C. (1997). General Refinement for High Level Petri Nets: in Proceedings of the 17th Conference on the Foundations of Software Technology and Theoretical Computer Science. Lecture notes in computer science, 1346, 297-311. doi:10.1007/BFb0058038
  5. 79. Devillers, R. (1996). Petri Boxes and Finite Precedence: in Proceedings of the 7th International Conference on Concurrency Theory (CONCUR '96). Lecture notes in computer science, 1119, 465-480. doi:10.1007/3-540-61604-7_70
  6. 80. Devillers, R. (1995). S-invariant analysis of general recursive Petri boxes. Acta informatica, 32(4), 313-345. doi:10.1007/BF01178382
  7. 81. Devillers, R. (1993). Construction of S-invariants and S-components for Refined Petri Boxes: in Proceedings of the 14th International Conference on Application and Theory of Petri Nets 1993. Lecture notes in computer science, 691, 242-261. doi:10.1007/3-540-56863-8_50
  8. 82. Best, E., Devillers, R., & Esparza, J. (1993). General Refinement and Recursion Operators for the Petri Box Calculus: in Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture notes in computer science, 665, 130-140. doi:10.1007/3-540-56503-5_16
  9. 83. Massart, T., & Devillers, R. (1993). Equality of agent expressions is preserved under an extension of the universe of actions. Formal aspects of computing, 5(1), 79-88. doi:10.1007/BF01211317
  10. 84. Devillers, R. (1992). Maximality preserving bisimulation. Theoretical computer science, 102(1), 165-183.
  11. 85. Best, E., Devillers, R., Kiehn, A., & Pomello, L. (1991). Concurrent bisimulations in Petri nets. Acta informatica, 28(3), 231-264. doi:10.1007/BF01178506
  12. 86. Devillers, R. (1990). The Semantics of Capacities in P/T Nets: in Advances in Petri Net 1989. Lecture notes in computer science, 424, 128-150. doi:10.1007/3-540-52494-0_28

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