A. Bouillard and E. Thierry, An algorithmic toolbox for network calculus. Discrete Event Dynamic Systems, vol.18, pp.3-49, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00123643

M. Boyer, NC-maude: a rewriting tool to play with network calculus, Proceedings of the 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, 2010.

M. Boyer, J. Migge, and M. Fumey, PEGASE, a robust and efficient tool for worst case network traversal time, Proc. of the SAE 2011 AeroTech Congress & Exhibition, 2011.

M. Boyer, J. Migge, and N. Navet, An efficient and simple class of functions to model arrival curve of packetised flows, Proceedings of the 1st International Workshop on Worst-Case Traversal Time (WCTT'2011), pp.43-50, 2011.

M. Boyer, N. Navet, X. Olive, and E. Thierry, The pegase project: Precise and scalable temporal analysis for aerospace communication systems with network calculus, 4th Intl. Symp. Leveraging Applications, vol.6415, pp.122-136, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00551504

J. Grieu, Analyse etévaluation de techniques de commutation Ethernet pour l'interconnexion des systèmes avioniques, 2004.

J. Boudec and P. Thiran, , 2001.

E. Mabille, M. Boyer, L. Fejoz, and S. Merz, Towards certifying network calculus, Interactive Theorem Proving, vol.7998, pp.484-489, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00904796

T. Nipkow, L. Paulson, and M. Wenzel, Isabelle/HOL. A Proof Assistant for Higher-Order Logic. Number 2283 in Lecture Notes in Computer Science, 2002.