A Two-Level Approach for Modeling and Verification of Telecommunication Systems

Abstract

AbstractFor modeling, specification and verification of telecommunication systems, the models such as finite automata, Petri nets and their generalizations are usually applied. The goal of our paper is to represent a new two-level approach for modeling, specification and verification of telecommunication systems. On the first level, telecommunication systems are specified by communicating extended finite automata, while on the second level the automata systems are translated into coloured Petri nets (CPN). Correctness of the translation algorithm is justified by proving bisimilarity between the resulting CPN and the automata system. This method is applied to investigation of two case studies: ring protocols (RE-protocol and ATMR-protocol) and the feature interaction problem in telephone networks. CPN Tools [9] are used for modeling these telecommunication systems and constructing reachability graphs of CPN. We used the Petri Net Verifier [11] for verification of the net models with respect to properties expressed in mu-calculus by the model checking method.KeywordsTelecommunication SystemFinite AutomatonTelephone NetworkTranslation AlgorithmModel Check MethodThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.