A new approach to the specification and verification of real-time systems

Exact high level WCET analysis of synchronous programs by symbolic state space exploration

“…Furthermore, arbitrary temporal properties specified in a temporal logic can be verified. In particular, we have defined in [22] an extension called JCTL of the well-known temporal logic CTL by real-time contraints. In contrast to other real-time temporal logics, JCTL is a consequent extention of CTL and therefore still allows the use of already available symbolic model checking algorithms.…”

“…• any atomic formula In [22], a symbolic model checking algorithm for JCTL has been presented that computes for a given JCTL formula Φ and a TKS K the set of states of K where Φ holds. Manually given path information like the infeasibility of computation paths can be specified in JCTL, and hence, can be verified by the algorithms given in [22].…”

“…In Section 3, we then explain the basics of our real-time verification methods as introduced in [22]. Section 3.2 contains the main results of the paper: Using symbolic state space exploration, we compute for all inputs the lengths of all computations from given program locations S α to other program locations S γ .…”

“…In particular, we can compute path information like loop bounds, the minimal/maximal number of macro steps required to reach a certain program location from another one, and infeasible paths for a later low-level WCET analysis. Using our algorithms for real-time model checking [22,23] allows us furthermore to efficiently verify given path information.…”

“…Section 3.2 contains the main results of the paper: Using symbolic state space exploration, we compute for all inputs the lengths of all computations from given program locations S α to other program locations S γ . Beneath computing the execution times, we can also use the real-time verification algorithms given in [22] to verify given path information. …”