A Mechanized Semantic Framework for Real-Time Systems

Abstract

Concurrent systems consist of many components which may execute in parallel and are complex to design, to analyze, to verify, and to implement. The complexity increases if the systems have real-time constraints, which are very useful in avionic, spatial and other kind of embedded applications. In this paper we present a logical framework for defining and validating real-time formalisms as well as reasoning methods over them. For this purpose, we have implemented in the Coq proof assistant well known semantic domains for real-time systems based on labelled transitions systems and timed runs. We experiment our framework by considering the real-time CSP-based language fiacre, which has been defined as a pivot formalism for modeling languages (aadl, sdl, ...) used in the TOPCASED project. Thus, we define an extension to the formal semantic models mentioned above that facilitates the modeling of fine-grained time constraints of fiacre. Finally, we implement this extension in our framework and provide a proof method environment to deal with real-time system in order to achieve their formal certification. ⋆. This work has been partly funded by the FNRAE project Quarteft.

Formal verification of user-level real-time property patterns

“…This proof follows the same structure that the one found in the work of Abid et al [17]. Actually, our group has also conducted experiments on the use of interactive theorem prover to prove this kind of properties [18].…”

A Formal Framework to Prove the Correctness of Model Driven Engineering Composition Operators

“…We plan to experiment the behavioural aspect by considering the merging of Statecharts Specifications [30]. In the long run, we plan to integrate the work of Garnacho et al [17] that provide an embedding in Coq of timed transition systems in order to model the behavioral aspect of languages.…”

Verified Model Checking of Timed Automata

“…This work has the basic decidability result using regions and claims to make some attempt to extend the formalization towards DBMs. Another line of work [10,11] aims at modeling the class of pautomata [12] in Coq and proving properties of concrete p-automata within Coq. A similar approach was pursued with the help of Isabelle/HOL in the CClair project [13].…”