This article is cited in 1 paper

Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets

D. M. Beloglazov, M. Yu. Mashukov, V. A. Nepomnyashchii

A. P. Ershov Institute of Informatics Systems Sib. Br. RAS

Abstract: Uniform systems of communicating extended finite automata are considered in the paper. These automata systems are useful for initial specification of telecommunication systems such as ring protocols and telephone networks. The goal of our paper is to represent an ASV tool (Automata Systems Verifier) intended for analysis and verification of the automata specifications. The ASV tool is based on the algorithm of translation of these automata systems into coloured Petri nets (CPN). This algorithm has been represented and justified in [4]. The ASV tool uses CPN Tools [10] for analysis of the net models and Petri Net Verifier [12] for their verification by the model checking method with respect to properties expressed in mu-calculus. Application of the ASV tool to ring protocol verification and investigation of feature interactions in telephone networks is described.

Keywords: telecommunication systems, extended finite automata, coloured Petri nets, ring protocols, feature interactions, telephone networks, verification, model checking method.

UDC: 519.681.3

Received: 18.11.2011