Temporal analysis for adapting concurrent applications to embedded systems

Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore pro-cessors). It is difficult to write one program that would work re-liably on such a wide range of devices. This is especially true when the application must be temporally predictable and robust which should usually be the case since the physical world works in real-time. Thus, any application interacting with such a sys-tem, must also work in real-time. In this paper we introduce a representation of the tempo-ral behavior of distributed real-time applications as a colored graphs that capture the timing of temporally continuous sections of execution and dependencies between them, creating a par-tial order. We then introduce a method of extracting the grap