オートマトン理論に基づく通信プロトコルのタイミング検証 : 実時間シンボリック言語包含検証手法

抄録

As communication protocol consists of complex configurations of processes and has strict timing constraints, there have been many researches about formal verification including timing verification. We have reported the specification and verification method by timed automata. Using this method, we have verified the properties of fairness and regularity by language inclusion algorithm, but the verification costs are large. In this paper, we propose the effective timing verification method as follows. (1) We verify communication protocol both by the finite set of strongly connected components of specification and by checking timing constraints. (2) We verify communication protocol both by image computation based on BDD (Binary Decision Diagram) and by checking timing constraints. We have developed the verification system based on this method. This system can avoid state explosion problem.