I. Introduction
For certain application domains, critical communication flows need to be proven correct in terms of their temporal behavior. For example, in the aerospace domain, but also in emerging industrial automation systems, authorities require the proof of correctness as part of the certification process with respect to critical traffic fulfilling end-to-end latency requirements. These requirements have been guaranteed through analysis methods like Network Calculus [1] , [2] , [3] or the more recent Compositional Performance Analysis [4] , for technologies like Avionics Full DupleX (AFDX) [5] . The Network Calculus method [1] is a well-known mathematical framework based on min-plus algebra that is widely used in the certification process to derive worst-case end-to-end latency bounds for individual asynchronous communication flows.