<?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 pub-id-type="doi">10.18255/1818-1015-2012-6-45-56</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-138</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>On the Designing of Model Checkers for Real-Time Distributed Systems</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>Volkanov</surname><given-names>D. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>ассистент</p></bio><bio xml:lang="en"><p>ассистент</p></bio><email xlink:type="simple">valdus@yandex.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>Zakharov</surname><given-names>V. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>доцент</p></bio><bio xml:lang="en"><p>доцент</p></bio><email xlink:type="simple">valdus@yandex.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>Zorin</surname><given-names>D. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант</p></bio><bio xml:lang="en"><p>аспирант</p></bio><email xlink:type="simple">valdus@yandex.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>Konnov</surname><given-names>I. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>ассистент</p></bio><bio xml:lang="en"><p>ассистент</p></bio><xref ref-type="aff" rid="aff-2"/></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>Podymov</surname><given-names>V. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант</p></bio><bio xml:lang="en"><p>аспирант</p></bio><email xlink:type="simple">valdus@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Московский государственный университет им. М.В. Ломоносова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Московский государственный университет им. М.В. Ломоносова</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Венский технологический университет</institution><country>Австрия</country></aff><aff xml:lang="en"><institution>Technische Universit¨at Wien</institution><country>Austria</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2012</year></pub-date><pub-date pub-type="epub"><day>12</day><month>03</month><year>2015</year></pub-date><volume>19</volume><issue>6</issue><fpage>45</fpage><lpage>56</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Волканов Д.Ю., Захаров В.А., Зорин Д.А., Коннов И.В., Подымов В.В., 2015</copyright-statement><copyright-year>2015</copyright-year><copyright-holder xml:lang="ru">Волканов Д.Ю., Захаров В.А., Зорин Д.А., Коннов И.В., Подымов В.В.</copyright-holder><copyright-holder xml:lang="en">Volkanov D.Y., Zakharov V.A., Zorin D.A., Konnov I.V., Podymov V.V.</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/138">https://www.mais-journal.ru/jour/article/view/138</self-uri><abstract><p>Исследуется задача верификации систем реального времени (СРВ). Для описания СРВ удобно использовать диаграммы состояний UML с семантикой, определяемой иерархическими автоматами. Для верификации СРВ часто применяется средство UPPAAL, разработанное для проверки формул логики TCTL на сети временных автоматов. Основным результатом данной статьи является алгоритм трансляции иерархических автоматов в сеть временных автоматов и обоснование его корректности.</p></abstract><trans-abstract xml:lang="en"><p>To verify real-time properties of UML statecharts one may apply a UPPAAL, toolbox for model checking of real-time systems. One of the most suitable ways to specify an operational semantics of UML statecharts is to invoke the formal model of Hierarchical Timed Automata. Since the model language of UPPAAL is based on Networks of Timed Automata one has to provide a conversion of Hierarchical Timed Automata to Networks of Timed Automata. In this paper we describe this conversion algorithm and prove that it is correct w.r.t. UPPAAL query language which is based on the subset of Timed CTL.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>верификация</kwd><kwd>система реального времени</kwd><kwd>диаграмма состояний</kwd><kwd>иерархический автомат</kwd><kwd>временной автомат</kwd></kwd-group><kwd-group xml:lang="en"><kwd>verification</kwd><kwd>real time systems</kwd><kwd>statecharts</kwd><kwd>hierarchical automaton</kwd><kwd>timed automaton</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Минобрнауки РФ, федеральная целевая программа "Научные и научно-педагогические кадры инновационной России"</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">David A., Moller M.O. From HUppaal to Uppaal: a translation from hierarchical timed automata to flat timed automata // Research Series RS-01-11, BRICS, Department of Computer Science, University of Aarhus, March 2001.</mixed-citation><mixed-citation xml:lang="en">David A., Moller M.O. From HUppaal to Uppaal: a translation from hierarchical timed automata to flat timed automata // Research Series RS-01-11, BRICS, Department of Computer Science, University of Aarhus, March 2001.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Lakhnech M.E., Siegal M. Hierarchical automata as model for statechart // Lecture Notes in Computer Science. 1997. V. 1345. P. 187–196.</mixed-citation><mixed-citation xml:lang="en">Lakhnech M.E., Siegal M. Hierarchical automata as model for statechart // Lecture Notes in Computer Science. 1997. V. 1345. P. 187–196.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Chen Hai-yan, Dong Wei, Wang Huo-wang. Verify UML statechart with SMV // Wuhan University Journal of Natural Science. 2001. V. 6, №1–2. P. 183–190.</mixed-citation><mixed-citation xml:lang="en">Chen Hai-yan, Dong Wei, Wang Huo-wang. Verify UML statechart with SMV // Wuhan University Journal of Natural Science. 2001. V. 6, №1–2. P. 183–190.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Jussila T., Dubrovin J., Junttila T., Latvala T., Pores I. Model checking dynamic and hierarchical UML state machines // Proc. of the 3rd Workshop on Model Design and Validation. 2006.</mixed-citation><mixed-citation xml:lang="en">Jussila T., Dubrovin J., Junttila T., Latvala T., Pores I. Model checking dynamic and hierarchical UML state machines // Proc. of the 3rd Workshop on Model Design and Validation. 2006.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Latella D., Majzik I., Massink M. Automatic verification of a behavioural subset of UML statechart diagrams using SPIN model-checker // Formal Aspects of Computations. 1999. V. 11.</mixed-citation><mixed-citation xml:lang="en">Latella D., Majzik I., Massink M. Automatic verification of a behavioural subset of UML statechart diagrams using SPIN model-checker // Formal Aspects of Computations. 1999. V. 11.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Lilius J., Paltor I. vUML: a Tool for Verifying UML Models // Technical Report TUCS-272. Turku Centre for Computer Science. 1999.</mixed-citation><mixed-citation xml:lang="en">Lilius J., Paltor I. vUML: a Tool for Verifying UML Models // Technical Report TUCS-272. Turku Centre for Computer Science. 1999.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Ober I., Graf S., Ober I. Validating timed UML models by simulation and verification // Proc. of the Workshop on Specification and Validation of UML models for Real Time and Embedded Systems (SVERTS 2003). 2003.</mixed-citation><mixed-citation xml:lang="en">Ober I., Graf S., Ober I. Validating timed UML models by simulation and verification // Proc. of the Workshop on Specification and Validation of UML models for Real Time and Embedded Systems (SVERTS 2003). 2003.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Behrmann G., David A., Larsen K.G. A Tutorial on Uppaal // Lecture Notes in Computer Science. 2004. V. 3185. P. 200–236.</mixed-citation><mixed-citation xml:lang="en">Behrmann G., David A., Larsen K.G. A Tutorial on Uppaal // Lecture Notes in Computer Science. 2004. V. 3185. P. 200–236.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Bengtsson J., Larsen K.G., Larsson F., Pettersson P., Yi W. UPPAAL – a Tool Suite for Automatic Verification of Real-Time Systems // Lecture Notes in Computer Science. 1996. V. 1066. P. 232–243.</mixed-citation><mixed-citation xml:lang="en">Bengtsson J., Larsen K.G., Larsson F., Pettersson P., Yi W. UPPAAL – a Tool Suite for Automatic Verification of Real-Time Systems // Lecture Notes in Computer Science. 1996. V. 1066. P. 232–243.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">David A., Moller M.O., Yi W. Verification of UML statechart with real-time extensions // IT Tech. Rep. 2003-009, Uppsala: Dep. of Information Technology, Uppsala University. 2003.</mixed-citation><mixed-citation xml:lang="en">David A., Moller M.O., Yi W. Verification of UML statechart with real-time extensions // IT Tech. Rep. 2003-009, Uppsala: Dep. of Information Technology, Uppsala University. 2003.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Muniz A.L.N., Andrade A.M.S., Lima G. Integrating UML and UPPAAL for designing, specifying and verifying component-based real-time systems // Innovation in Software and System Engineering. 2009.</mixed-citation><mixed-citation xml:lang="en">Muniz A.L.N., Andrade A.M.S., Lima G. Integrating UML and UPPAAL for designing, specifying and verifying component-based real-time systems // Innovation in Software and System Engineering. 2009.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Alur R., Dill D.L. Automata for modeling real-time systems // Lecture Notes in Computer Science. 1990. V. 443/1990. P. 322–335.</mixed-citation><mixed-citation xml:lang="en">Alur R., Dill D.L. Automata for modeling real-time systems // Lecture Notes in Computer Science. 1990. V. 443/1990. P. 322–335.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Alur R., Dill D.L. A theory of timed automata // Theoretical Computer Science. 1994. V. 126. P. 183–235.</mixed-citation><mixed-citation xml:lang="en">Alur R., Dill D.L. A theory of timed automata // Theoretical Computer Science. 1994. V. 126. P. 183–235.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Browne M.C., Clarke M.C., Grumberg O. Characterizing finite Kripke structures in propo-sitional temporal logics // Theoretical Computer Science. 1988. V. 59 (1–2). P. 115–131.</mixed-citation><mixed-citation xml:lang="en">Browne M.C., Clarke M.C., Grumberg O. Characterizing finite Kripke structures in propo-sitional temporal logics // Theoretical Computer Science. 1988. V. 59 (1–2). P. 115–131.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Chistolinov M.V., Epatko I.V., Bahmurov A.G., Smelyansky R.L., Zakharov V.A., Winter K., Usenko Y. Towards a unified toolset for embedded systems development // Proc. of the conference UKRPROG-2000 «Problems of Programming». 2000. №1–2. P. 316–322.</mixed-citation><mixed-citation xml:lang="en">Chistolinov M.V., Epatko I.V., Bahmurov A.G., Smelyansky R.L., Zakharov V.A., Winter K., Usenko Y. Towards a unified toolset for embedded systems development // Proc. of the conference UKRPROG-2000 «Problems of Programming». 2000. №1–2. P. 316–322.</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>
