Checking validity of the min-plus operations involved in the analysis of a real-time embedded network
Abstract
The network calculus theory is widely used to check that a network satisfies its real-time requirements. Such checking involves a lot of computations in the min-plus dioid. This paper shows how such computations can be formally checked using the Coq proof assistant in a realistic industrial context.
| Origin | Files produced by the author(s) |
|---|