Schmidt, KlausSchmidt, Ece G.2025-05-132025-05-13201097814244357461550-2252https://doi.org/10.1109/VETECF.2010.5594414https://hdl.handle.net/20.500.12416/9970Schmidt, Ece Guran/0000-0002-4062-389XIn this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.eninfo:eu-repo/semantics/closedAccessConference Object10.1109/VETECF.2010.55944142-s2.0-78649414450WOS:000287525200460N/AN/A