Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
ARINC 653, Aeronautical Radio Inc.: Avionics Application Software Standard Interface (1997)
Boyer, M., Doose, D.: Combining network calculus and scheduling theory to improve delay bounds. In: RTNS 2012, pp. 51–60 (2012)
Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve 5.5, open source (mixed-integer) linear programming system. Software, (May 2004), http://lpsolve.sourceforge.net/5.5/
Bauer, H., Scharbarg, J.-L., Fraboul, C.: Applying and optimizing trajectory approach for performance evaluation of afdx avionics network. In: Proceedings of the 14th IEEE International Conference on Emerging Technologies & Factory Automation, ETFA 2009, Piscataway, NJ, USA, pp. 690–697. IEEE Press (2009)
Carcenac, F., Boniol, F.: A formal framework for verifying distributed embedded systems based on abstraction methods. International Journal on Software Tools for Technology Transfer 8(6), 471–484 (2006)
Chokshi, D.B., Bhaduri, P.: Performance analysis of flexray-based systems using real-time calculus. In: Shin, S.Y., Ossowski, S., Schumacher, M., Palakal, M.J., Hung, C.-C. (eds.) SAC, pp. 351–356. ACM (2010) (revisited)
Ferrandiz, T., Frances, F., Fraboul, C.: Worst-case end-to-end delays evaluation for spacewire networks. Discrete Event Dynamic Systems 21(3), 339–357 (2011)
Herpel, T., Hielscher, K.-S.J., Klehmet, U., German, R.: Stochastic and deterministic performance evaluation of automotive can communication. Computer Networks 53(8), 1171–1185 (2009)
Lauer, M., Boniol, F., Ermont, J., Pagetti, C.: Latency and freshness analysis on IMA systems. In: Emerging Technologies and Factory Automation (ETFA), Toulouse, France. IEEE (September 2011)
Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)
Lauer, M., Ermont, J., Pagetti, C., Boniol, F.: Analyzing end-to-end functional delays on an IMA platform. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part I. LNCS, vol. 6415, pp. 243–257. Springer, Heidelberg (2010)
Martin, S., Minet, P.: Worst case end-to-end response times of flows scheduled with FP/FIFO. In: Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, pp. 54–62. IEEE Computer Society, Washington, DC (2006)
Sha, L., Abdelzaher, T., AArzén, K.-E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., Mok, A.K.: Real time scheduling theory: A historical perspective. Real-Time Syst. 28(2-3), 101–155 (2004)
Mangoua Sofack, W., Boyer, M.: Non preemptive static priority with network calculus: Enhancement. In: Schmitt, J.B. (ed.) MMB & DFT 2012. LNCS, vol. 7201, pp. 258–272. Springer, Heidelberg (2012)
Spuri, M.: Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems. Research Report RR-2873, INRIA (1996)
Tindell, K., Clark, J.: Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and Microprogramming 40(2-3), 117–134 (1994)
Thiele, L., Chakraborty, S., Naedele, M.: Real-time calculus for scheduling hard real-time systems. In: ISCAS, pp. 101–104 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boniol, F., Lauer, M., Pagetti, C., Ermont, J. (2013). Freshness and Reactivity Analysis in Globally Asynchronous Locally Time-Triggered Systems. In: Brat, G., Rungta, N., Venet, A. (eds) NASA Formal Methods. NFM 2013. Lecture Notes in Computer Science, vol 7871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38088-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-38088-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38087-7
Online ISBN: 978-3-642-38088-4
eBook Packages: Computer ScienceComputer Science (R0)