Verification of telecommunication systems specified using communicating finite-state automata using colored Petri nets

Abstract

Uniform systems of communicating extended finite-state automata are considered. These systems can be used for the initial specification of telecommunication systems such as ring protocols and telephone networks. This paper aims to present an automata systems verifier tool (ASV) designed for the analysis and verification of automata specifications. It is based on an algorithm for the translation of automata systems into colored Petri nets (CPN) presented and justified in [4]. The ASV tool uses CPN Tools [10] for analysis and simulation of CPN, also it uses Petri Net Verifier [12] to verify CPN properties by applying the model checking method to CPN reachability graph with respect to the properties expressed in μ-calculus. The application of the ASV tool is described for the ring RE-protocol verification and the study of the feature interaction in telephone networks.