@inproceedings{AM11,

title = { Causality closure for a new class of curves in real-time calculus },

author = {Altisen, Karine and Moy, Matthieu},

year = {2011},

booktitle = {{Proceedings of the 1st International Workshop on Worst-Case Traversal Time}},

address = {Vienna, Autriche},

pages = {3--10},

publisher = {ACM},

team = {SYNC},

hal_id = {hal-00648628},
keywords = {algorithms, causality, real-time calculus},
language = {Anglais},
affiliation = {Verimag - IMAG},
audience = {internationale},
pdf = {http://hal.archives-ouvertes.fr/hal-00648628/PDF/wctt2011-final.pdf},

abstract = {{Real-Time Calculus (RTC) is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by arrival curves which express upper and lower bounds on the number of events that may arrive over any specified time interval. System properties may then be computed using algebraic techniques in a compositional way. The property of causality on arrival curves essentially characterizes the absence of deadlock in the corresponding generator. A mathematical operation called causality closure transforms arbitrary curves into causal ones. In this paper, we extend the existing theory on causality to the class Upac of infinite curves represented by a finite set of points plus piecewise affine functions, where existing algorithms did not apply. We show how to apply the causality closure on this class of curves, prove that this causal representative is still in the class and give algorithms to compute it. This provides the tightest pair of curves among the curves which accept the same sets of streams.}},

}