Proposition for a logical formalism of expression and of temporal properties verification on repetitive events devoted to the analysis of execution traces

To provide safety analysis of complex real time systems which have been developed for the protection of French nuclear Plants, the CEA is interested in software testing validation techniques. These series of tests are made by a purely software simulation of the system. The purpose is to establish the truth of some critical properties of the programs either at the simulation run time or after its execution. The operator is able to describe the variation of some inputs parameters of the programs and shows the results with graphics facilities. An important need was to describe formally some categories of properties expressed in terms of academic examples. We thought that a logical textual language was appropriate to achieve this formal expression. This thesis describe a new data-flow language called EFRI extending the semantic of interval temporal logics. Then we describe a calculus using regular languages on arrays which associates to each formula of the EFRI language a regular expression. With this method, the verification of a property described by a formula of EFRI can be viewed as a classical problem of languages theory: does a word belongs to a regular language. We can then build a finite automaton to recognize complex temporal diagrams. (author). 38 refs., 7 tabs., 4 appends