Towards optimal priority assignment for probabilistic CAN-based systems

International audienceWe deal in this paper with the existence of optimal priority assignment for periodic activities (tasks or messages) with variable execution times. In the case of one processor (and periodic tasks) we provide first results on Audsley's algorithm for the preemptive and nonpreemptive problems. In the case of a CAN bus (and periodic messages) we conjecture that Audsley's algorithm is also optimal