RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2011, Volume 18, Number 4, Pages 144–156 (Mi mais205)  

This article is cited in 1 scientific paper (total 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.

Full text: PDF file (471 kB)
References: PDF file   HTML file
UDC: 519.681.3
Received: 18.11.2011

Citation: 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”, Model. Anal. Inform. Sist., 18:4 (2011), 144–156

Citation in format AMSBIB
\Bibitem{BelMasNep11}
\by D.~M.~Beloglazov, M.~Yu.~Mashukov, V.~A.~Nepomnyashchii
\paper Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets
\jour Model. Anal. Inform. Sist.
\yr 2011
\vol 18
\issue 4
\pages 144--156
\mathnet{http://mi.mathnet.ru/mais205}


Linking options:
  • http://mi.mathnet.ru/eng/mais205
  • http://mi.mathnet.ru/eng/mais/v18/i4/p144

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. I. S. Anureev, S. N. Baranov, D. M. Beloglazov, E. V. Bodin, P. D. Drobintsev, A. V. Kolchin, V. P. Kotlyarov, A. A. Letichevskii, A. A. Letichevskii, V. A. Nepomnyaschii, I. V. Nikiforov, S. V. Potienko, L. V. Priima, B. V. Tyutin, “Sredstva podderzhki integrirovannoi tekhnologii dlya analiza i verifikatsii spetsifikatsii telekommunikatsionnykh prilozhenii”, Tr. SPIIRAN, 26 (2013), 349–383  mathnet
  • Моделирование и анализ информационных систем
    Number of views:
    This page:240
    Full text:84
    References:25

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020