A contribution to the validation of complex real-time systems
Résumé
This paper deals with the verification of temporal properties on a complex real-time system. We use a sub class of timed automata formalism called Timed Input Output State machine (TIOSM) to model system and properties. In order to verify one property on a system, we applied formerly a method that is based on the synchronous product of the two state machines. If the system and the property are designed thanks to state machines containing cycles, the complexity of the analysis increased. We propose then to transform each strongly connected component of each automata into simple cycles. We show that it is possible to identify matching cycles of the two automata and present a validation algorithm based on the matching cycles.