Andersson, BjörnTovar, Eduardo2014-02-112014-02-112009978-1-4244-4110-5978-1-4244-4109-9http://hdl.handle.net/10400.22/3836Consider a distributed computer system comprising many computer nodes, each interconnected with a controller area network (CAN) bus. We prove that if priorities to message streams are assigned using rate-monotonic (RM) and if the requested capacity of the CAN bus does not exceed 25% then all deadlines are met.engThe utilization bound of non-preemptive rate-monotonic scheduling in controller area networks is 25%conference object10.1109/SIES.2009.5196186