<?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">phmath</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Государственного университета просвещения. Серия: Физика-Математика</journal-title><trans-title-group xml:lang="en"><trans-title>Bulletin of Federal State University of Education. Series: Physics and Mathematics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2949-5083</issn><issn pub-type="epub">2949-5067</issn><publisher><publisher-name>Federal State University of Education</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">phmath-183</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></article-categories><title-group><article-title>МОДИФИКАЦИЯ ОПЕРАТОРОВ CTL ЛОГИКИ И ИХ АЛГОРИТМЫ
ПРОВЕРКИ НА СТРУКТУРЕ КРИПКЕ</article-title><trans-title-group xml:lang="en"><trans-title>UPDATING OF CTL OPERATORS AND THEIR CHECK ALGORITHMS
ON KRIPKE STRUCTURE</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-alternatives><email xlink:type="simple">noemail@neicon.ru</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>2010</year></pub-date><pub-date pub-type="epub"><day>30</day><month>09</month><year>2022</year></pub-date><volume>0</volume><issue>3</issue><fpage>66</fpage><lpage>74</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Мазуров Ю.А., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Мазуров Ю.А.</copyright-holder><copyright-holder xml:lang="en">Мазуров Ю.А.</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.physmathmgou.ru/jour/article/view/183">https://www.physmathmgou.ru/jour/article/view/183</self-uri><abstract><p>В настоящей статье предложено расширение некоторых темпоральных операторов CTL логики, позволяющее явно указывать количество состояний системы или количество путей, в которых выполняется заданное свойство системы. Дается семантика, формальная грамматика, а так же соответствующие алгоритмы проверки выполнимости на структуре Крипке,расширенных темпоральных операторов.</p></abstract><trans-abstract xml:lang="en"><p>In this article, extension of some temporal CTL logics operators is proposed,
which enables explicit indication of the number of system states or the number of ways
wherein the preset feature of the system is realized. Semantics, formal grammar, as well
as relevant Kripke structure and extended temporal operators based feasibility check algorithms
are given.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>верификация</kwd><kwd>Model Checking</kwd><kwd>CTL логика</kwd><kwd>структура Крипке</kwd></kwd-group><kwd-group xml:lang="en"><kwd>verification</kwd><kwd>Model Checking</kwd><kwd>CTL logics</kwd><kwd>Kripke structure</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">Pnueli, A.. The temporal logic of programs [Text]. //Proc. of 18-th IEEE Symposium on Foundations of Computer Science, pp. 46-57, 1977.</mixed-citation><mixed-citation xml:lang="en">Pnueli, A.. The temporal logic of programs [Text]. //Proc. of 18-th IEEE Symposium on Foundations of Computer Science, pp. 46-57, 1977.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Clarke, J.E.M., Emerson E.A. Design and synthesis of synchronization skeletons using branching time temporal logic [Text]. //A Series of Lecture Notes in Computer Science. - V. 131, pp.52-71, Springer, 1981.</mixed-citation><mixed-citation xml:lang="en">Clarke, J.E.M., Emerson E.A. Design and synthesis of synchronization skeletons using branching time temporal logic [Text]. //A Series of Lecture Notes in Computer Science. - V. 131, pp.52-71, Springer, 1981.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Кларк, Э., Грамберг, О., Пелед, Д. Верификация моделей программ: Model Checking [Текст]. - М.: МЦНМО, 2002, с. 56-61.</mixed-citation><mixed-citation xml:lang="en">Кларк, Э., Грамберг, О., Пелед, Д. Верификация моделей программ: Model Checking [Текст]. - М.: МЦНМО, 2002, с. 56-61.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Карпов, Ю.Г. Model Checking. Верификация параллельных и распределенных программных систем[Текст]. - СПб.: БХВ-Петербург, 2010, с. 41-73.</mixed-citation><mixed-citation xml:lang="en">Карпов, Ю.Г. Model Checking. Верификация параллельных и распределенных программных систем[Текст]. - СПб.: БХВ-Петербург, 2010, с. 41-73.</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>
