Proposal of hybrid verification method in asynchronous real‐time software including timing constraints specification

Abstract

AbstractA verification system of asynchronous real‐time software including timing constraints, which supports both model‐checking algorithms and language inclusion algorithms, does not exist. In a language inclusion algorithm, verification specification is described by a timed automaton from the standpoint of both states and behaviors. On the other hand, in a model‐checking algorithm, verification specification is described by real‐time temporal logic from the standpoint of state relation. It is necessary to specify verification property by both timed automaton and real‐time temporal logic. A hybrid verification method, which supports both verification methods, is proposed here. In order to realize it, a timed Kripke structure is generated from timed automaton through an augmented region graph. The method is shown to be effective using the example of a clock problem.