Causality problem in real-time calculus

Abstract

Real-time calculus (RTC) (Thiele et al. in: ISCAS, Geneva, 2000) is a framework to analyze heterogeneous, real-time systems that process event streams of data. The streams are characterized by pairs of curves, called arrival curves, that express upper and lower bounds on the number of events that may arrive over any specified time interval. A well-known limitation of RTC is that it cannot model systems with states and several works (Altisen and Moy in: ECRTS, Brussels, http://www-verimag.imag.fr/~moy/publications/ac2lus-conf, 2010; Altisen et al. in: QAPL, Paphos, http://www-verimag.imag.fr/~moy/publications/gran-paper, 2010; Banerjee and Dasgupta in: Proceedings of the conference on design, automation & test in Europe, 2014; Giannopoulou et al. in: Proceedings of the tenth ACM international conference on embedded software, New York, 2012; Krcal et al. in: Proceedings of 19th Nordic workshop on programming theory (NWPT07), Oslo, 2007; Kumar et al. in: Proceedings of the 49th annual design automation conference, New York, 2012; Lampka et al. in: EMSOFT, Grenoble, 2009; Lampka et al. in Des Autom Embed Syst 14:1---35, 2010; Perathoner et al. in: DATE, IEEE, Grenoble, 2013; Lampka et al. in Int J Softw Tools Technol Transf 15:155---170, 2011; Phan et al. in: Proceedings of the IEEE real-time systems symposium (RTSS), Los Alamitos, doi:10.1109/RTSS.2007.46, 2007; Uppsala University in Cats tool, Uppsala University, Uppsala, 2007) studied how to interface RTC curves with state-based models. Doing so, while trying, for example to generate a stream of events that satisfies some given pair of curves, we faced a causality problem (Raymond in Compilation efficace d'un langage declaratif synchrone: Le generateur de code Lustre-v3, PhD thesis, 1991): it can be the case that, after generating a finite prefix of an event stream, the generator deadlocks, since no extension of the prefix can satisfy the curves afterwards. This paper formally defines the problem; it states and proves algebraic results that characterize causal pairs of curves, i.e. curves for which the problem cannot occur. We consider the general case of infinite curve models, either discrete or continuous time and events. The paper provides an analysis on how causality issues appear when using arrival curves and how they could be handled. It also provides an overview of algorithms to compute causal curves in several models. These algorithms compute a canonical representation of a pair of curves, which is the best pair of curves among the curves equivalent to the ones they take as input.