@conference {12818,
	title = {Predictability of real-time systems: a process-algebraic approach},
	booktitle = {Real-Time Systems Symposium, IEEE International},
	year = {1996},
	month = {1996///},
	pages = {82 - 82},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Los Alamitos, CA, USA},
	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{\textquoteright} "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.},
	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},
	doi = {http://doi.ieeecomputersociety.org/10.1109/REAL.1996.563703},
	author = {Natarajan,V. and Cleaveland, Rance}
}
