Worst-case execution times and schedulability analysis of statecharts models

Synchronous languages have proven to be very adequate for the modeling of embedded systems. However, such languages assume that all responses to external stimuli are computed infinitely fast (in zero time). It is the task of lower design steps to ensure that timeliness requirements are met even when the actual execution time of the generated code on the target is taken into account. Being able to determine both the worst-case execution time (WCET) an the worst-case response time (WCRT) of synchronous models is therefore crucial for the design of real-rime applications. This paper focuses on the language statecharts, but describes a method for analyzing the real-time behavior of synchronous models in general. For this purpose, we take aspects specific to the semantics of synchronous languages into consideration to provide both an efficient and accurate analysis of tasks generated from synchronous models. This method has been integrated in a code generator for STATEMATE and experimental results are presented