<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">mais-1105</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Оригинальные статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Articles</subject></subj-group></article-categories><title-group><article-title>Верификация телекоммуникационных систем, специфицированных взаимодействующими конечными автоматами, с помощью раскрашенных
сетей Петри</article-title><trans-title-group xml:lang="en"><trans-title>Verification of Telecommunication Systems Specified
by Communicating Finite Automata with the Help
of Coloured Petri Nets</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Белоглазов</surname><given-names>Дмитрий Михайлович</given-names></name><name name-style="western" xml:lang="en"><surname>Beloglazov</surname><given-names>D. M.</given-names></name></name-alternatives><email xlink:type="simple">dmitry.beloglazov@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Машуков</surname><given-names>Михаил Юрьевич</given-names></name><name name-style="western" xml:lang="en"><surname>Mashukov</surname><given-names>M. Yu.</given-names></name></name-alternatives><email xlink:type="simple">mashukovm@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Непомнящий</surname><given-names>Валерий Александрович</given-names></name><name name-style="western" xml:lang="en"><surname>Nepomniaschy</surname><given-names>V. A.</given-names></name></name-alternatives><email xlink:type="simple">vnep@iis.nsk.su</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Институт систем информатики им. А.П. Ершова СО РАН</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2011</year></pub-date><pub-date pub-type="epub"><day>20</day><month>12</month><year>2011</year></pub-date><volume>18</volume><issue>4</issue><fpage>144</fpage><lpage>156</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Белоглазов Д.М., Машуков М.Ю., Непомнящий В.А., 2011</copyright-statement><copyright-year>2011</copyright-year><copyright-holder xml:lang="ru">Белоглазов Д.М., Машуков М.Ю., Непомнящий В.А.</copyright-holder><copyright-holder xml:lang="en">Beloglazov D.M., Mashukov M.Y., Nepomniaschy V.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1105">https://www.mais-journal.ru/jour/article/view/1105</self-uri><abstract><p>Рассматриваются униформные системы взаимодействующих расширенных конечных автоматов, которые удобны для задания исходной спецификации телекоммуникационных систем, таких как кольцевые протоколы и телефонные сети. Цель работы - представить программный комплекс Automata Systems Verifier (ASV), предназначенный для анализа и верификации автоматных спецификаций. Он базируется на алгоритме трансляции систем автоматов в раскрашенные сети Петри (РСП), представленном и обоснованном в [<xref ref-type="bibr" rid="cit4">4</xref>]. Для анализа РСП комплекс ASV использует систему CPN Tools [<xref ref-type="bibr" rid="cit10">10</xref>], а для их верификации методом проверки моделей относительно свойств, заданных формулами мю-исчисления, он использует систему Petri Net Verifier [<xref ref-type="bibr" rid="cit12">12</xref>]. Описано применение этого комплекса к верификации кольцевого RE-протокола и к исследованию взаимодействия функциональностей в телефонных сетях.</p></abstract><trans-abstract xml:lang="en"><p>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 [<xref ref-type="bibr" rid="cit4">4</xref>]. The ASV tool uses CPN Tools [<xref ref-type="bibr" rid="cit10">10</xref>] for analysis of the net models and Petri Net Verifier [<xref ref-type="bibr" rid="cit12">12</xref>] 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.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>телекоммуникационные системы</kwd><kwd>расширенные конечные автоматы</kwd><kwd>раскрашенные сети Петри</kwd><kwd>кольцевые протоколы</kwd><kwd>взаимодействие функциональностей</kwd><kwd>телефонные сети</kwd><kwd>верификация</kwd><kwd>метод проверки моделей</kwd></kwd-group><kwd-group xml:lang="en"><kwd>telecommunication systems</kwd><kwd>extended finite automata</kwd><kwd>coloured Petri nets</kwd><kwd>ring protocols</kwd><kwd>feature interactions</kwd><kwd>telephone networks</kwd><kwd>verification</kwd><kwd>model checking method</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Виноградов Р.А., Кузьмин Е.В., Соколов В.А. Верификация автоматных программ средствами CPN/Tools // Моделирование и анализ информационных систем. 2006. Т. 13, № 2. C. 4-15.</mixed-citation><mixed-citation xml:lang="en">Виноградов Р.А., Кузьмин Е.В., Соколов В.А. Верификация автоматных программ средствами CPN/Tools // Моделирование и анализ информационных систем. 2006. Т. 13, № 2. C. 4-15.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Кузьмин Е.В., Соколов В.А. Моделирование, спецификация и верификация "автоматных" программ // Программирование. 2008. №1. C. 38-60.</mixed-citation><mixed-citation xml:lang="en">Кузьмин Е.В., Соколов В.А. Моделирование, спецификация и верификация "автоматных" программ // Программирование. 2008. №1. C. 38-60.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Шалыто А.А., Туккель Н.И. SWITCH-технология - автоматный подход к созданию программного обеспечения "реактивных" систем // Программирование. 2001. № 5. C. 45-62.</mixed-citation><mixed-citation xml:lang="en">Шалыто А.А., Туккель Н.И. SWITCH-технология - автоматный подход к созданию программного обеспечения "реактивных" систем // Программирование. 2001. № 5. C. 45-62.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Capellmann C., Dibold H., Herzog U. Using High-Level Petri Nets in the Field of Intelligent Networks // LNCS. 1999. V. 1605. P. 1-36.</mixed-citation><mixed-citation xml:lang="en">Capellmann C., Dibold H., Herzog U. Using High-Level Petri Nets in the Field of Intelligent Networks // LNCS. 1999. V. 1605. P. 1-36.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Cavalli A., Maag S. A New Algorithm for Service Interaction Detection // Proc. ICFEM 2002. LNCS. 2002. V. 2495. P. 371-382.</mixed-citation><mixed-citation xml:lang="en">Cavalli A., Maag S. A New Algorithm for Service Interaction Detection // Proc. ICFEM 2002. LNCS. 2002. V. 2495. P. 371-382.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Cohen R., Segall A. An Efficient Reliable Ring Protocol // IEEE Transactions on Communications. 1991. V. 39, № 11. P. 1616 - 1623.</mixed-citation><mixed-citation xml:lang="en">Cohen R., Segall A. An Efficient Reliable Ring Protocol // IEEE Transactions on Communications. 1991. V. 39, № 11. P. 1616 - 1623.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Jensen K., Kristensen L.M. Coloured Petri Nets: Modelling and Validation of Concurrent Systems // Springer, 2009.</mixed-citation><mixed-citation xml:lang="en">Jensen K., Kristensen L.M. Coloured Petri Nets: Modelling and Validation of Concurrent Systems // Springer, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Lee D. Principles and methods of testing finite state machines // Proc. IEEE. 1996. V. 84, № 8. P. 1090-1123.</mixed-citation><mixed-citation xml:lang="en">Lee D. Principles and methods of testing finite state machines // Proc. IEEE. 1996. V. 84, № 8. P. 1090-1123.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Nakamura M. Design and Evaluation of Efficient Algorithms for Feature Interaction Detection in Telecommunication Services. // PhD dissertation, Osaka University, 1999.</mixed-citation><mixed-citation xml:lang="en">Nakamura M. Design and Evaluation of Efficient Algorithms for Feature Interaction Detection in Telecommunication Services. // PhD dissertation, Osaka University, 1999.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Schatz B., Salzmann Ch. Service-Based Systems Engineering: Consistent Combination of Services // Proc. ICFEM 2003. LNCS. 2003. V. 2885. P. 86-104.</mixed-citation><mixed-citation xml:lang="en">Schatz B., Salzmann Ch. Service-Based Systems Engineering: Consistent Combination of Services // Proc. ICFEM 2003. LNCS. 2003. V. 2885. P. 86-104.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
