The PEGASE Project: Precise and Scalable Temporal Analysis for Aerospace Communication Systems with Network Calculus

Boyer, Marc; Navet, Nicolas; Olivé, Xavier; Thierry, Éric

doi:10.1007/978-3-642-16558-0_13

Cited by 16 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use the Java based software RTaW-Pegase [10] in version 4.3.8.4 to run our simulations. To implement our experiments, we use Python in version 3.10.5 and use the optimization algorithms provided by the pymoo library [6] in version 0.6.0.1.…”

Section: Implementation Detailsmentioning

confidence: 99%

Approximation of Worst-Case Traversal Times in Real-Time Ethernet Networks: Exploring the Potential of Many-Objective Optimization for Simulation Aggregation

Keller,

Navet

2024

2024 IEEE 20th International Conference on Factory Communication Systems (WFCS)

Self Cite

View full text Add to dashboard Cite

Simulation is an important tool for the verification of modern complex time-critical communication systems, especially when worst-case schedulability analysis is not available. Evaluating worst-case traversal times via simulation traditionally involves resource-intensive long simulations that are poorly parallelizable. Recent research has demonstrated that aggregating many short simulations with randomized starting conditions yields substantial improvements over this classical approach in terms of likelihood of observing very large communication latencies. In this study, we explore the potential of many-objective optimization to further enhance the efficiency of the aggregation approach.To this end we further reduce the length of the aggregated simulations and perform many-objective optimization to set the starting conditions, namely the node start offsets and initial flow scheduling order. Our approach consists in modelling the approximation of worst-case traversal times as a many-objective Pareto optimization problem in the context of real-time Ethernet networks. Performance evaluation, conducted on different industrially relevant use cases from the automotive and aerospace domains, shows up to 46.42% increased end-to-end latencies for a 50 times shorter total simulation time, in comparison to the traditional approach of running single long simulations.

show abstract

Section: Implementation Detailsmentioning

confidence: 99%

Approximation of Worst-Case Traversal Times in Real-Time Ethernet Networks: Exploring the Potential of Many-Objective Optimization for Simulation Aggregation

Keller,

Navet

2024

2024 IEEE 20th International Conference on Factory Communication Systems (WFCS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…An open implementation has been developed but is no longer maintained [6] to our knowledge. An industrial implementation exists, which is the core of the network calculus tool PEGASE [10]. The UPP-PA implementation can be accessed through an on-line console [1].…”

Section: State Of the Artmentioning

confidence: 99%

Verifying Min-Plus Computations with Coq

Rakotomalala

Roux

Boyer

2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Network-calculus is a theory that bounds delays in embedded networks such as AFDX networks used in modern airplanes. Effective computations rely on operators from the min-plus algebra on real functions. Algorithms on specific subsets can be found in the literature. Such algorithms and related implementations are however complicated. Instead of redeveloping a provably correct implementation, we take an existing implementation as an oracle and propose a Coq based verifier.

show abstract

“…These computations are performed by the pegase Network Calculus tool [2] and certified using Isabelle.…”

Section: Certifying a Simple Network Computationmentioning

confidence: 99%

Towards Certifying Network Calculus

Mabille¹,

Boyer

Fejoz³

et al. 2013

Interactive Theorem Proving

Self Cite

View full text Add to dashboard Cite

Network Calculus (NC) [5] is an established theory for determining bounds on message delays and for dimensioning buffers in the design of networks for embedded systems. It is supported by academic and industrial tool sets and has been widely used, including for the design and certification of the Airbus A380 AFDX backbone [1,3,4]. However, while the theory of NC is generally well understood, results produced by existing tools have to be trusted: some algorithms require subtle reasoning in order to ensure their applicability, and implementation errors could result in faulty network design, with unpredictable consequences.Tools used in design processes for application domains with strict regulatory requirements are subject to a qualification process in order to gain confidence in the soundness of their results. Nevertheless, given the safety-critical nature of network designs, we believe that more formal evidence for their correctness should be given. We report here on work in progress towards using the interactive proof assistant Isabelle/HOL [6] for certifying the results of NC computations. In a nutshell (cf. Figure 1), the NC tool outputs a trace of the calculations it performs, as well as their results. The validity of the trace (w.r.t. the applicability of the computation steps and the numerical correctness of the result) is then established offline by a trusted checker.The approach of result certification is useful in general for computations performed at design time, as is the case with the use of NC tools, and the idea of using interactive theorem provers for result certification is certainly not new. In particular, it is usually easier to instrument an existing tool in order to produce a checkable trace than to attempt a full-fledged correctness proof. Also, the NC tool can be implemented by a tool provider using any software development process, programming language, and hardware, and it can be updated without having to be requalified, as long as it still produces certifiable traces.In the remainder, we give a brief introduction to NC, outline our ongoing work on formalizing NC in Isabelle/HOL, and finally illustrate its use for the certification of bounds on the message delay in a toy network.

show abstract

The PEGASE Project: Precise and Scalable Temporal Analysis for Aerospace Communication Systems with Network Calculus

Cited by 16 publications

References 22 publications

Approximation of Worst-Case Traversal Times in Real-Time Ethernet Networks: Exploring the Potential of Many-Objective Optimization for Simulation Aggregation

Approximation of Worst-Case Traversal Times in Real-Time Ethernet Networks: Exploring the Potential of Many-Objective Optimization for Simulation Aggregation

Verifying Min-Plus Computations with Coq

Towards Certifying Network Calculus

Contact Info

Product

Resources

About