There are several analysis models and corresponding temporal analysis techniques for checking whether applications executed on multiprocessor systems meet their real-time constraints. However, currently there does not exist an exact end-to-end latency analysis technique for Homogeneous Synchronous Dataflow with auto-concurrency (HSDFa) models that takes the correlation between the firing durations of different firings into account. In this paper we present a transformation of strongly connected HSDFa models into timed automata models. This enables an exact end-to-end latency analysis because the correlation between the firing durations of different firings is taken into account. In a case study we compare the latency obtained using timed automata and a Linear Program (LP) based analysis technique that relies on a deterministic abstraction and compare their run-times as well. Exact end-to-end latency analysis results are obtained using timed automata, whereas this is not possible using deterministic timed-dataflow models.
|Title of host publication||Proceedings of the 2017 Design, Automation & Test in Europe (DATE)|
|Subtitle of host publication||27–31 March 2017, Swisstech, Lausanne, Switzerland|
|Publication status||Published - Mar 2017|
|Event||2017 Design, Automation & Test in Europe Conference & Exhibition, DATE 2017 - Lausanne, Switzerland|
Duration: 27 Mar 2017 → 31 Mar 2017
|Conference||2017 Design, Automation & Test in Europe Conference & Exhibition, DATE 2017|
|Period||27/03/17 → 31/03/17|