Skip to main content
Article
Network-Code Machine: Programmable Real-Time Communication Schedules
Departmental Papers (CIS)
  • Sebastian Fischmeister, University of Pennsylvania
  • Oleg Sokolsky, University of Pennsylvania
  • Insup Lee, University of Pennsylvania
Date of this Version
4-1-2006
Document Type
Conference Paper
Comments
Copyright 2006 IEEE. Reprinted from Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06)

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Abstract
Distributed hard real-time systems require guaranteed communication. One common approach is to restrict network access by enforcing a time-division multiple access (TDMA) schedule.The typical data representation of offline-generated TDMA schedules is table-like structures. This representation, however, does not permit applications with dynamic communication demands, because the table-like structure prevents on-the-fly changes during execution. A common approach for applications with dynamic communication behavior is dynamic TDMA schedules. However, such schedules are hard to verify, because they are usually implemented in a programming language, which does not support verification. Network code is a behavioral model for specifying real-time communication schedules. It allows modeling arbitrary time-triggered communication schedules with on-the-fly choices, and it is also apt for formal verification. In this work, we present network code and show how we can use a model checker to verify safety properties such as collision-free communication, schedulability, and guaranteed message reception. We also discuss its implementation in RTLinux and provide performance measurements.
Keywords
  • Real time systems,
  • scheduling,
  • time division multiaccess,
  • networks,
  • software verification and validation
Citation Information
Sebastian Fischmeister, Oleg Sokolsky and Insup Lee. "Network-Code Machine: Programmable Real-Time Communication Schedules" (2006)
Available at: http://works.bepress.com/sokolsky/57/