Skip to main content

CAN Bus Experiments of Real-Time Communications

  • Conference paper
  • First Online:
Computer Science – CACIC 2017 (CACIC 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 790))

Included in the following conference series:

  • 606 Accesses

Abstract

This paper presents a benchmark development and the analysis of communication times in a CAN (Controller Area Network) bus. Preemptive and fixed priority scheduling is taken as departure point for the initial experiments and analysis. This method would be adapted for programming CAN messages without preemption of the shared communications channel. It is also complemented by a specific priority assignment algorithm, suitable for non-preemptive systems. A real CAN network is used for the experiments, and results are analyzed from the point of view of real-time performance and CAN specification. We have found well known, deterministic, and correct performance communication times. Messages and signals are delivered within deadlines, a fundamental requirement for a real-time system.

F. G. Tinetti—Comisión de Investigaciones Científicas, Prov. de Bs. As.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Audsley, N.: Optimal priority assignment and feasibility of static priority tasks with arbitrary start times (1991)

    Google Scholar 

  2. Davis, R.I., Burns, A., Bril, R.J., Lukkien, J.J.: Controller area network (CAN) schedulability analysis: refuted, revisited and revised. Real-Time Syst. 35(3), 239–272 (2007). https://doi.org/10.1007/s11241-007-9012-7

    Article  Google Scholar 

  3. George, L., Rivierre, N., Spuri, M.: Preemptive and non-preemptive real-time uniprocessor scheduling. Research Report RR-2966. INRIA (1996). https://hal.inria.fr/inria-00073732. projet REFLECS

  4. Kopetz, H.: A solution to an automotive control system benchmark. In: 1994 Proceedings Real-Time Systems Symposium, pp. 154–158, December 1994

    Google Scholar 

  5. Lehoczky, J.P.: Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: 1990 Proceedings 11th Real-Time Systems Symposium, pp. 201–209, December 1990

    Google Scholar 

  6. Tindell, K., Burns, A., Wellings, A.: Calculating controller area network (CAN) message response times. Control Eng. Pract. 3(8), 1163–1169 (1995). http://www.sciencedirect.com/science/article/pii/0967066195001128

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fernando G. Tinetti .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tinetti, F.G., Romero, F.L., Pérez, A.D. (2018). CAN Bus Experiments of Real-Time Communications. In: De Giusti, A. (eds) Computer Science – CACIC 2017. CACIC 2017. Communications in Computer and Information Science, vol 790. Springer, Cham. https://doi.org/10.1007/978-3-319-75214-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75214-3_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75213-6

  • Online ISBN: 978-3-319-75214-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics