Proving sequential function chart programs using timed automata
Applications described by sequential function chart (SFC) often being critical, we have investigated the possibilities of program checking. In particular, physical time can be handled by SFC programs using temporizations, which is why we are interested in the quantitative temporal properties. We have proposed a modeling of SFC in timed automata, a formalism which takes time into account. In this modeling, we use the physical constraints of the environment. Verification of properties can be carried out using the model-checker Kronos. We apply this method to SFC programs of average size like that of the control part of the production cell Korso. The size of the programs remains however a limit and we are studying the means of solving this problem. (C) 2001 Elsevier Science B.V. All rights reserved.
timed automata sequential function chart (sfc) checking formal methods tctl logic