Section: New Results

Automatic analysis and verification for specific classes of models

Participants : Robert de Simone, Frédéric Mallet, Emilien Kofman, Julien Deantoni.

This part aims at continuing and extending our work on “mostly-automatic”verification, with SMT solvers and model-checking in place to compute optimal scheduling and allocation, for instance. The new expressiveness of CPS adds new challenges [10]. While the global problem of schedulability for a generic CCSL specification is an open problem. We have identified a particular subclass of scheduling called "periodic scheduling" and establish a sufficient conditions for detecting if there is a valid periodic scheduling for a given CCSL specification. This condition is checked using the MAUDE rewriting system that directly encodes the operational semantics of CCSL [8]. However, the performances highly depend on the "period" of the periodic scheduling.

A more efficient solution based on SMT solver is under investigation and has given first encouraging results. A specific direction is reported in Emilien Kofman PhD thesis [1].