Sciweavers

Share
RTAS
2006
IEEE

Network-Code Machine: Programmable Real-Time Communication Schedules

9 years 3 months ago
Network-Code Machine: Programmable Real-Time Communication Schedules
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 offlinegenerated 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 realtime communication schedules. It allows modeling arbitrary time-triggered communication schedules with on-thefly 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 ver...
Sebastian Fischmeister, Oleg Sokolsky, Insup Lee
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where RTAS
Authors Sebastian Fischmeister, Oleg Sokolsky, Insup Lee
Comments (0)
books