Freshness and Reactivity Analysis in Globally Asynchronous Locally Time-Triggered Systems

Critical embedded systems are often designed as a set of real-time tasks, running on shared computing modules, and communicating through networks. Because of their critical nature, such systems have to meet timing properties. To help the designers to prove the correctness of their system, the real-time systems community has developed numerous approaches for analyzing the worst case times either on the processors (e.g. worst case execution time of a task) or on the networks (e.g. worst case traversal time of a message). However, there is a growing need to consider the complete system and to be able to determine end-to-end properties. Such properties apply to a functional chain which describes the behavior of a sequence of functions, not necessarily hosted on a shared module, from an input until the production of an output. This paper explores two end-to-end properties: freshness and reactivity, and presents an analysis method based on Mixed Integer Linear Programming (MILP). This work is supported by the French National Research Agency within the Satrimmap project.

[1]  Lothar Thiele,et al.  Real-time calculus for scheduling hard real-time systems , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[2]  Marc Boyer,et al.  Non Preemptive Static Priority with Network Calculus: Enhancement , 2012, MMB/DFT.

[3]  Jérôme Ermont,et al.  Latency and freshness analysis on IMA systems , 2011, ETFA2011.

[4]  Pascale Minet,et al.  Worst case end-to-end response times of flows scheduled with FP/FIFO , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

[5]  Alan Burns,et al.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

[6]  Christian Fraboul,et al.  Applying and optimizing trajectory approach for performance evaluation of AFDX avionics network , 2009, 2009 IEEE Conference on Emerging Technologies & Factory Automation.

[7]  Jérôme Ermont,et al.  Analyzing End-to-End Functional Delays on an IMA Platform , 2010, ISoLA.

[8]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[9]  Marco Spuri,et al.  Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems , 1996 .

[10]  Frédéric Boniol,et al.  A formal framework for verifying distributed embedded systems based on abstraction methods , 2006, International Journal on Software Tools for Technology Transfer.

[11]  Marc Boyer,et al.  Combining network calculus and scheduling theory to improve delay bounds , 2012, RTNS '12.

[12]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[13]  Christian Fraboul,et al.  Worst-case end-to-end delays evaluation for SpaceWire networks , 2011, Discret. Event Dyn. Syst..

[14]  Devesh B. Chokshi,et al.  Performance analysis of FlexRay-based systems using real-time calculus, revisited , 2010, SAC '10.

[15]  Reinhard German,et al.  Stochastic and deterministic performance evaluation of automotive CAN communication , 2009, Comput. Networks.

[16]  Klaus Echtle,et al.  Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 15th International GI/ITG Conference, MMB&DFT 2010, Essen, Germany, March 15-17, 2010. Proceedings , 2010, MMB/DFT.

[17]  Paul Prisaznuk,et al.  ARINC Specification 653, Avionics Application Software Standard Interface , 2006, Avionics.

[18]  Marc Boyer,et al.  Non preemptive static priority with network calculus , 2011, ETFA2011.