@inproceedings {38,
	title = {Network-Code Machine: Programmable Real-Time Communication Schedules},
	booktitle = {Proc. of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)},
	year = {2006},
	month = {April},
	pages = {311{\textendash}324},
	address = {San Jose, USA},
	abstract = {<p>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.</p>
},
	keywords = {NCM, real-time, state-based scheduling},
	isbn = {0769525164},
	doi = {10.1109/RTAS.2006.31},
	url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1613346},
	author = {Fischmeister, Sebastian and Sokolsky, Oleg and Lee, Insup}
}
