Worst-Case Time Analysis of CAN Messages

  • Marco Di Natale
  • Haibo Zeng
  • Paolo Giusto
  • Arkadeb Ghosal


Designers of CAN-based systems are of course interested in being able to predict the time performance of the messages exchanged over the network. The CAN protocol adopts a collision detection and resolution scheme, where the message to be transmitted is chosen according to its identifier. When multiple nodes need to transmit over the bus, the lowest identifier message is selected for transmission. The CAN MAC arbitration protocol encodes the message priority into the identifier field and implements priority-based real-time scheduling of periodic and aperiodic messages. Predictable scheduling of real-time messages on the CAN bus is then made possible by adapting existing real-time scheduling algorithms to the MAC arbitration protocol or by superimposing a higher-level scheduler designed purposely.


Busy Period Critical Instant Message Queue Outgoing Message Priority Inversion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Marco Di Natale
    • 1
  • Haibo Zeng
    • 2
  • Paolo Giusto
    • 3
  • Arkadeb Ghosal
    • 4
  1. 1.Scuola Superiore S. Anna RETIS Lab.PisaItaly
  2. 2.McGill UniversityMontrealCanada
  3. 3.General Motors CorporationPalo AltoUSA
  4. 4.National InstrumentsBerkeleyUSA

Personalised recommendations