Geodesic
Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets
Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 4, pp. 144-156.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MAIS_2011_18_4_a12,
     author = {D. M. Beloglazov and M. Yu. Mashukov and V. A. Nepomnyashchii},
     title = {Verification of telecommunication systems specified by communicating finite automata with the help of coloured {Petri} nets},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {144--156},
     publisher = {mathdoc},
     volume = {18},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a12/}
}
TY  - JOUR
AU  - D. M. Beloglazov
AU  - M. Yu. Mashukov
AU  - V. A. Nepomnyashchii
TI  - Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2011
SP  - 144
EP  - 156
VL  - 18
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a12/
LA  - ru
ID  - MAIS_2011_18_4_a12
ER  - 
%0 Journal Article
%A D. M. Beloglazov
%A M. Yu. Mashukov
%A V. A. Nepomnyashchii
%T Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets
%J Modelirovanie i analiz informacionnyh sistem
%D 2011
%P 144-156
%V 18
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a12/
%G ru
%F MAIS_2011_18_4_a12
D. M. Beloglazov; M. Yu. Mashukov; V. A. Nepomnyashchii. Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets. Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 4, pp. 144-156. http://geodesic.mathdoc.fr/item/MAIS_2011_18_4_a12/

[1] R. A. Vinogradov, E. V. Kuzmin, V. A. Sokolov, “Verifikatsiya avtomatnykh programm sredstvami CPN/Tools”, Modelirovanie i analiz informatsionnykh sistem, 13:2 (2006), 4–15

[2] E. V. Kuzmin, V. A. Sokolov, “Modelirovanie, spetsifikatsiya i verifikatsiya “avtomatnykh” programm”, Programmirovanie, 2008, no. 1, 38–60 | MR

[3] A. A. Shalyto, N. I. Tukkel, “SWITCH-tekhnologiya — avtomatnyi podkhod k sozdaniyu programmnogo obespecheniya “reaktivnykh” sistem”, Programmirovanie, 2001, no. 5, 45–62 | Zbl

[4] D. Beloglazov, V. Nepomniaschy, “A Two-Level Approach for Modeling and Verification of Telecommunication Systems”, Proc. PSI 2009, LNCS, 5947, 2010, 70–85 | Zbl

[5] C. Capellmann, H. Dibold, U. Herzog, “Using High-Level Petri Nets in the Field of Intelligent Networks”, LNCS, 1605, 1999, 1–36

[6] A. Cavalli, S. Maag, “A New Algorithm for Service Interaction Detection”, Proc. ICFEM 2002, LNCS, 2495, 2002, 371–382 | Zbl

[7] R. Cohen, A. Segall, “An Efficient Reliable Ring Protocol”, IEEE Transactions on Communications, 39:11 (1991), 1616–1623 | DOI

[8] P. Gibson, G. Hamilton, D. Mery, “Integration Problems in Telephone Feature Requirements”, Proc. of the 1st Intern. Conf. on Integrated Formal Methods (York (IFM'99)), Springer, 1999, 129–148 | Zbl

[9] K. Jensen, L. M. Kristensen, Coloured Petri Nets: Modelling and Validation of Concurrent Systems, Springer, 2009

[10] K. Jensen, L. M. Kristensen, L. Wells, “Coloured Petri Nets and CPN Tools for modeling and validation of concurrent systems”, Int. J. on Software Tools for Technology Transfer 9, 2007, 213–254 | DOI

[11] D. O.Keck, P. J. Kuehn, “The Feature and Service Interaction Problem in Telecom-munications Systems: A Survey”, IEEE Trans. on Software Eng., 24:10 (1998), 779–796 | DOI

[12] V. E. Kozura, V. A. Nepomniaschy, R. M. Novikov, “Verification of Distributed Systems Modelled by High-level Petri Nets”, Proc. Intern. Conf. on Parallel Computing in Electrical Engineering, Warsaw, Poland, 2002, 61–66 | DOI

[13] D. Lee, “Principles and methods of testing finite state machines”, Proc. IEEE, 84:8 (1996), 1090–1123 | DOI

[14] L. Lorentsen, A. Tuovinen, J. Xu, “Modelling Feature Interaction Patterns in Nokia Mobile Phones using Coloured Petri Nets and Design/CPN”, Proc. 3rd Workshop on Practical Use of Coloured Petri Nets (CPN'01) (Aarhus Univ., DAIMI PB-554), 2001, 1–14

[15] M. Nakamura, Design and Evaluation of Efficient Algorithms for Feature Interaction Detection in Telecommunication Services, PhD dissertation, Osaka University, 1999

[16] V. Nepomniaschy, D. Beloglazov, T. Churina, M. Mashukov, “Using Coloured Petri Nets to Model and Verify Telecommunications Systems”, Proc. CSR 2008, LNCS, 5010, 2008, 360–371

[17] B. Schatz, Ch. Salzmann, “Service-Based Systems Engineering: Consistent Combination of Services”, Proc. ICFEM 2003, LNCS, 2885, 2003, 86–104