{'fraction_non_alphanumeric': 0.02631578947368421, 'fraction_numerical': 0.0, 'mean_word_length': 5.186991869918699, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Stochastic response-time guarantee for non-preemptive, fixed-priority scheduling under errors

Error recovery mechanisms, such as automatic repeat request (ARQ) for e.g. the CAN protocol, are a crucial part of safety critical embedded systems. These can have a strong impact on the timing behavior of the system and an unpropitious combination of error events may cause a real-time application to miss deadlines with potentially hazardous consequences. Therefore, formal analysis of the worst-case timing including errors is indispensable for certification. We present a new convolution-based stochastic analysis in which we model errors as additional execution time to bound the probability for an activation to exceed a response-time value in the worst-case.