Sibirskii Matematicheskii Zhurnal
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


Sibirsk. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskii Matematicheskii Zhurnal, 2021, Volume 62, Number 3, Pages 619–628
DOI: https://doi.org/10.33048/smzh.2021.62.313 (Mi smj7582) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Branching time logics with multiagent temporal accessibility relations

V. V. Rybakovab

a Institute of Mathematics and Informatics, Siberian Federal University, Krasnoyarsk, Russia
b A.P. Ershov Institute of Informatics Systems, Novosibirsk, Russia
Full-text PDF (411 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.33048/smzh.2021.62.313
Abstract: Under study are the branching time temporal logics with temporal accessibility relations for the agents different in length and content. We find an algorithm for solving the problems of satisfiability and decidability of the logic through describing finite satisfiable models of computable size (through the size of the input formulas). We remove the constraints on the size of all temporal accessibility intervals for the agents (to be all inside a common temporal accessibility interval at any local time point); i.e., all constraints can be arbitrary. Also, we formulate some open problems.
Keywords: temporal logic, multiagent logic, satisfiability problem, deciding algorithm.
Funding agency Grant number
National Research University Higher School of Economics
Ministry of Science and Higher Education of the Russian Federation 075-02-2020-1534/1
The author was supported by the Research Program at HSE University (Higher School of Economics, University, Moscow, Russia). The author was also supported by the Krasnoyarsk Mathematical Center and financed by the Ministry of Science and Higher Education of the Russian Federation (Grant 075–02–2020–1534/1).
Received: 14.08.2020
Revised: 10.01.2021
Accepted: 22.01.2021
English version:
Siberian Mathematical Journal, 2021, Volume 62, Issue 3, Pages 503–510
DOI: https://doi.org/10.1134/S0037446621030137
Bibliographic databases:
Document Type: Article
UDC: 510.64+510.65+510.66
Language: Russian
Citation: V. V. Rybakov, “Branching time logics with multiagent temporal accessibility relations”, Sibirsk. Mat. Zh., 62:3 (2021), 619–628; Siberian Math. J., 62:3 (2021), 503–510
Citation in format AMSBIB
\Bibitem{Ryb21}
\by V.~V.~Rybakov
\paper Branching time logics with multiagent temporal accessibility relations
\jour Sibirsk. Mat. Zh.
\yr 2021
\vol 62
\issue 3
\pages 619--628
\mathnet{http://mi.mathnet.ru/smj7582}
\crossref{https://doi.org/10.33048/smzh.2021.62.313}
\elib{https://elibrary.ru/item.asp?id=46788528}
\transl
\jour Siberian Math. J.
\yr 2021
\vol 62
\issue 3
\pages 503--510
\crossref{https://doi.org/10.1134/S0037446621030137}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000655743500013}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85107001397}
Linking options:
  • https://www.mathnet.ru/eng/smj7582
  • https://www.mathnet.ru/eng/smj/v62/i3/p619
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Сибирский математический журнал Siberian Mathematical Journal
    Statistics & downloads:
    Abstract page:165
    Full-text PDF :67
    References:22
    First page:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024