by Sven Burmester, Holger Giese, Andreas Seibel, Matthias Tichy
Abstract:
In the future, technical systems are expected to operate more intelligent than today by taking their local context explored by means of sensors and network communication into account. To realize this vision, the systems must be able to represent and query as well as interact with a large number of possible situations not known a priori. Therefore, flexible means to store, query, and manipulate such context information are required. Known flexible and powerful representations are class diagrams or other graph-like notations. However, such dynamic data structures which are sources for unpredictable run-time timing behavior are traditionally not recommended for the development of hard real-time systems. In this paper, we describe our efforts to employ story patterns, which are used for the specification of query and update operations on dynamic data structures, in hard real-time systems.
Reference:
Worst-Case Execution Time Optimization of Story Patterns for Hard Real-Time Systems (Sven Burmester, Holger Giese, Andreas Seibel, Matthias Tichy), In Proc. of the 3rd International Fujaba Days 2005, Paderborn, Germany, 2005.
Bibtex Entry:
@InProceedings{BGST05_ag,
AUTHOR = {Burmester, Sven and Giese, Holger and Seibel, Andreas and Tichy, Matthias},
TITLE = {{Worst-Case Execution Time Optimization of Story Patterns for Hard Real-Time Systems}},
YEAR = {2005},
MONTH = {September},
BOOKTITLE = {Proc. of the 3rd International Fujaba Days 2005, Paderborn, Germany},
PAGES = {71-78},
URL = {http://www.upb.de/cs/ag-schaefer/Veroeffentlichungen/Quellen/Papers/2005/FDays_RTSP.pdf},
PDF = {uploads/pdf/FDays_RTSP.pdf},
ABSTRACT = {In the future, technical systems are expected to operate more intelligent than today by taking their local context explored by means of sensors and network communication into account. To realize this vision, the systems must be able to represent and query as well as interact with a large number of possible situations not known a priori. Therefore, flexible means to store, query, and manipulate such context information are required. Known flexible and powerful representations are class diagrams or other graph-like notations. However, such dynamic data structures which are sources for unpredictable run-time timing behavior are traditionally not recommended for the development of hard real-time systems. In this paper, we describe our efforts to employ story patterns, which are used for the specification of query and update operations on dynamic data structures, in hard real-time systems.},
ANNOTE = {LANGUAGE : english}
}