Validation of distributed periodic real-time systems using CAN protocol with finite automata

International audience‘In a previous work, we have defined a temporal model based on regular languages to validate periodic real-time systems: the feasability decisional process is expressed by means of algebraic operations on languages, such as intersection, Hadamard product, and language center computing. Here, we describe how this model can be used to validate periodic distributed real-time systems. We base this description on the example of the CAN network protocol