Probabilistic response time bound for CAN messages with arbitrary deadlines

Authors:
Philip Axer;Maurice Sebastian;Rolf Ernst
Affiliations:
TU Braunschweig, Germany;TU Braunschweig, Germany;TU Braunschweig, Germany
Venue:
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2012

Citing 5
Cited 1

An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Probabilistic Analysis of CAN with Faults

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Comparing Real-Time Communication Under Electromagnetic Interference

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised

Real-Time Systems
Reliability Analysis of Single Bus Communication with Real-Time Requirements

PRDC '09 Proceedings of the 2009 15th IEEE Pacific Rim International Symposium on Dependable Computing

Stochastic response-time guarantee for non-preemptive, fixed-priority scheduling under errors

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The controller area network (CAN) is widely used in industrial and the automotive domain and in this context often for hard real-time applications. Formal methods guide the designer to give worst-case guarantees on timing. However, due to bit errors on the communication channel response times can be delayed due to retransmissions. Some methods exist to cover these effects, but are limited e.g. (support only periodic real-time traffic). In this paper we generalize existing methods to support arbitrary deadlines, and derive a probabilistic response time bound which is especially useful with the emergence of the new automotive safety standard ISO 26262.