Duration properties over real time system designs

Constraints on the accumulated sojourn time at particular system states are among the possible requirements for a real-time system. These requirements are called duration properties. The need to predict temporal behavior of critical real-time systems has encouraged the development of a useful collection of results for run-time scheduling as well as an interesting set of formal automatic techniques based on model-checking. However no automatic technique directly supports the verification of duration requirements over physical designs of real-time software. In (Braberman and Felder, 1999) an approach is presented that applies known scheduling theory to automatically derive simple and compositional formal models based on timed automata (Alur and Dill, 1994). We combine that modeling method with a conservative algorithm that extends (Braberman and Dang Van Hung, 1998) to check duration properties over the resulting timed automata