Timing Verification Method of Communication Protocol by Formal Language Theory

Abstract

Many processes concurrently behave and timing constraints are strict in communication protocols. Formal specification and timing verification of communication protocols are important. As concerns formal specification and verification of communication protocol, SDL and LOTOS, Estelle have been standardized and studied. But timing conditions can not be specified and verified in these methods. In this paper, I propose formal specification and timing verification method. I have developed CASE tool supported for this method. The main feature of this method and CASE tool is as follows. (1) formal specification method: Concurrent behavior between processes is specified by process algebra, and internal behavior in processes is specified by automaton. System specification is automatically generated from both concurrent behavior specification and internal behavior specification. (2) formal timing verification method: Verification property specification is specified by timed automaton, and timing verification is realized by language inclusion algorithm and geometric region. I show that this method and CASE tool are effective by the example of automobile control system.