Verification of Telecommunication Systems Specified by Communicating Finite Automata with the Help of Coloured Petri Nets
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.
About the Authors
D. M. Beloglazov
Институт систем информатики им. А.П. Ершова СО РАН
Russian Federation
Russian Federation
M. Yu. Mashukov
Институт систем информатики им. А.П. Ершова СО РАН
Russian Federation
Russian Federation
V. A. Nepomniaschy
Институт систем информатики им. А.П. Ершова СО РАН
Russian Federation
Russian Federation
References
1. Виноградов Р.А., Кузьмин Е.В., Соколов В.А. Верификация автоматных программ средствами CPN/Tools // Моделирование и анализ информационных систем. 2006. Т. 13, № 2. C. 4-15.
2. Кузьмин Е.В., Соколов В.А. Моделирование, спецификация и верификация "автоматных" программ // Программирование. 2008. №1. C. 38-60.
3. Шалыто А.А., Туккель Н.И. SWITCH-технология - автоматный подход к созданию программного обеспечения "реактивных" систем // Программирование. 2001. № 5. C. 45-62.
4. Beloglazov D., Nepomniaschy V. A Two-Level Approach for Modeling and Verification of Telecommunication Systems // Proc. PSI 2009. LNCS. 2010. V. 5947. P. 70-85.
5. Capellmann C., Dibold H., Herzog U. Using High-Level Petri Nets in the Field of Intelligent Networks // LNCS. 1999. V. 1605. P. 1-36.
6. Cavalli A., Maag S. A New Algorithm for Service Interaction Detection // Proc. ICFEM 2002. LNCS. 2002. V. 2495. P. 371-382.
7. Cohen R., Segall A. An Efficient Reliable Ring Protocol // IEEE Transactions on Communications. 1991. V. 39, № 11. P. 1616 - 1623.
8. Gibson P., Hamilton G., Mery D. Integration Problems in Telephone Feature Requirements // Proc. of the 1st Intern. Conf. on Integrated Formal Methods, York, (IFM'99). Springer, 1999. P. 129-148.
9. Jensen K., Kristensen L.M. Coloured Petri Nets: Modelling and Validation of Concurrent Systems // Springer, 2009.
10. Jensen K., Kristensen L.M., Wells L. Coloured Petri Nets and CPN Tools for modeling and validation of concurrent systems // Int. J. on Software Tools for Technology Transfer 9. 2007. P. 213-254.
11. Keck D.O., Kuehn P.J. The Feature and Service Interaction Problem in Telecommunications Systems: A Survey // IEEE Trans. on Software Eng. 1998. V. 24, № 10. P. 779-796.
12. Kozura V.E., Nepomniaschy V.A., Novikov R.M. Verification of Distributed Systems Modelled by High-level Petri Nets // Proc. Intern. Conf. on Parallel Computing in Electrical Engineering. Warsaw, Poland, 2002. P. 61-66.
13. Lee D. Principles and methods of testing finite state machines // Proc. IEEE. 1996. V. 84, № 8. P. 1090-1123.
14. Lorentsen L., Tuovinen A., Xu J. 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. P. 1 - 14.
15. Nakamura M. Design and Evaluation of Efficient Algorithms for Feature Interaction Detection in Telecommunication Services. // PhD dissertation, Osaka University, 1999.
16. Nepomniaschy V., Beloglazov D., Churina T., Mashukov M. Using Coloured Petri Nets to Model and Verify Telecommunications Systems // Proc. CSR 2008. LNCS. 2008. V. 5010, P. 360-371.
17. Schatz B., Salzmann Ch. Service-Based Systems Engineering: Consistent Combination of Services // Proc. ICFEM 2003. LNCS. 2003. V. 2885. P. 86-104.
Review
For citations:
Beloglazov D.M., Mashukov M.Yu., Nepomniaschy V.A. Verification of Telecommunication Systems Specified by Communicating Finite Automata with the Help of Coloured Petri Nets. Modeling and Analysis of Information Systems. 2011;18(4):144-156. (In Russ.)
Views:
549
Email this article 