Abstract
Real-time systems must meet, in addition to their functional requirements, requirements regarding their timing behavior. In the case of hard real-time systems, such requirements include the absence of deadline misses. In contrast, for soft real-time systems, a “reasonable” number of deadline misses may happen without leading to a system failure. The usual definition of what a “reasonable” number of deadline misses formally means is based on probability distributions. Another option is to use weakly-hard constraints, which describe bounds on the number of allowed deadline misses in a given time window.
In this paper we show the interest of using weakly-hard constraints for other purposes than describing deadline misses, e.g. to describe execution times or jitter. We discuss in depth the semantics of weakly-hard constraints with an emphasis on how they can be inferred from other weakly-hard constraints and compared to probabilistic constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ATESST2 project, http://www.atesst.org
Bernat, G.: Specification and Analysis of Weakly Hard Real-Time Systems. PhD thesis, Universitat de les Illes Balears (1998)
Bernat, G., Burns, A., Llamosí, A.: Weakly hard real-time systems. IEEE Trans. Computers 50(4), 308–321 (2001)
Henia, R., Hamann, A., Jersak, M., Racu, R., Richter, K., Ernst, R.: System level performance analysis - the SymTA/S approach. In: IEE Proceedings Computers and Digital Techniques (2005)
Ivers, M., Ernst, R.: Probabilistic Network Loads with Dependencies and the Effect on Queue Sojourn Times. In: Bartolini, N., Nikoletseas, S., Sinha, P., Cardellini, V., Mahanti, A. (eds.) QShine 2009. LNICST, vol. 22, pp. 280–296. Springer, Heidelberg (2009)
Jersak, M., Henia, R., Ernst, R.: Context-aware performance analysis for efficient embedded system design. In: Proceedings of DATE 2004, pp. 1046–1051. IEEE Computer Society (2004)
López, J.M., Díaz, J.L., Entrialgo, J., García, D.F.: Stochastic analysis of real-time systems under preemptive priority-driven scheduling. Real-Time Systems 40(2), 180–207 (2008)
Quinton, S., Ernst, R., Bertrand, D., Yomsi, P.M.: Challenges and new trends in probabilistic timing analysis. In: Proceedings of DATE 2012 (2012); Hot Topic Special Session
Quinton, S., Hanke, M., Ernst, R.: Formal analysis of sporadic overload in real-time systems. In: Proceedings of DATE 2012 (2012)
TADL: Timing Augmented Description Language – TIMMO public deliverable D6, http://timmo-2-use.org/timmo/pdf/D6_TIMMO_TADL_Version_2_v12.pdf
Thiele, L., Chakraborty, S., Naedele, M.: Real-time calculus for scheduling hard real-time systems. In: Proceedings of ISCAS 2000, vol. 4, pp. 101–104. IEEE Computer Society (2000)
TIMMO project, http://timmo-2-use.org/timmo/index.htm
TIMMO-2-USE project, http://timmo-2-use.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quinton, S., Ernst, R. (2012). Generalized Weakly-Hard Constraints. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies. ISoLA 2012. Lecture Notes in Computer Science, vol 7610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34032-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-34032-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34031-4
Online ISBN: 978-3-642-34032-1
eBook Packages: Computer ScienceComputer Science (R0)