Predictability of real-time systems: a process-algebraic approach
Title | Predictability of real-time systems: a process-algebraic approach |
Publication Type | Conference Papers |
Year of Publication | 1996 |
Authors | Natarajan V, Cleaveland R |
Conference Name | Real-Time Systems Symposium, IEEE International |
Date Published | 1996/// |
Publisher | IEEE Computer Society |
Conference Location | Los Alamitos, CA, USA |
Keywords | process algebra; real time systems predictability; process algebra; testing-based semantic preorder; process description language; tpl; timing behavior; variability; activity-completion times; semantic preorder; must-preorder; optimality |
Abstract | This paper presents a testing-based semantic preorder that relates real-time systems given in the process description language TPL on the basis of the predictability of their timing behavior. This predictability is measured in terms of the amount of variability present in processes' "activity-completion times". The semantic preorder is shown to coincide with an already existing, well-investigated implementation relation for TPL-the must-preorder. The optimality of our relation is also established by means of a full abstraction result. An example is provided to illustrate the utility of this work. |
DOI | 10.1109/REAL.1996.563703 |