An efficient verification procedure supporting evolution of reactive system specifications

Abstract

To evolve reactive system specifications, it is necessary to check properties of the specifications, such as satisfiability, stepwise satisfiability and strong satisfiability. We developed a verification method for checking these properties of specifications described in Linear Temporal Logic. The most significant problem of the verification is that it needs huge computational resources. To solve the problem, we introduce an efficient procedure for checking these properties based on a tableau method using combination of Binary Decision Diagrams representing sets of states and coarse graphs representing transitions.