Abstract
In cost conscious industries, such as automotive, it is imperative for designers to adhere to policies that reduce system resources to the extent feasible, even for safety-critical sub-systems. However, the overall reliability requirement, typically in the order of 10-9 faults/hour, must be both analysable and met. Faults can be hardware, software or timing faults. The latter being handled by hard-real time schedulability analysis, which is used to prove that no timing violations will occur. However, from a reliability and cost perspective there is a tradeoff between timing guarantees, the level of hardware and software faults, and the per-unit cost for meeting the overall reliability requirement.
This paper outlines a reliability analysis method that considers the effect of faults on schedulability analysis and its impact on the reliability estimation of the system. The ideas have general applicability, but the method has been developed with modeling of external interferences of automotive CAN buses in mind. We illustrate the method using the example of a distributed braking system.
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
N. C. Audsley, A. Burns, M.F. Richardson, K. Tindell, and A.J. Wellings. Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling. Software Engineering Journal, 8(5):284–292, September 1993.
A. Burns. Preemptive Priority Based Scheduling: An Appropriate Engineering Approach. Technical Report YCS 214, University of York, 1993.
A. Burns, S. Punnekkat, L. Strigini, and D.R. Wright. Probabilistic scheduling guarantees for fault-tolerant real-time systems. Proceedings of DCCS-7,IFIP International Working Conference on Dependable Computing for Critical Applications, California, January 1999.
H. Hansson, C. Norström, and S. Punnekkat. Reliability Modelling of Time-Critical Distributed Systems. Technical report, MRTC, Mälardalen University, July 2000.
S. Punnekkat, H. Hansson, and C. Norström. Response Time Analysis under Errors for CAN. Proceedings of IEEE Real-Time Technology and Applications Symposium(RTAS), page To appear, June 2000.
L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Transactions on Computers, 39(9):1175–1185, September 1990.
K. W. Tindell and A. Burns. Guaranteed message latencies for distributed safety-critical hard real-time control networks. Technical Report YCS229, Dept. of Computer Science, University of York, June 1994.
K. W. Tindell, A. Burns, and A. J. Wellings. Calculating Controller Area Network (CAN) Message Response Times. Control Engineering Practice, 3(8):1163–1169, 1995.
K. W. Tindell, H. Hansson, and A. J. Wellings. Analysing Real-Time Communications: Controller Area Network (CAN). Proceedings 15th IEEE Real-Time Systems Symposium, pages 259–265, December 1994.
J. Xu and D. L. Parnas. Priority scheduling versus pre-run-time scheduling. Real-Time Systems Journal, 18(1), January 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hansson, H., Norström, C., Punnekkat, S. (2000). Reliability Modelling of Time-Critical Distributed Systems. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-45352-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41055-3
Online ISBN: 978-3-540-45352-9
eBook Packages: Springer Book Archive