?
Темпоральная логика для верификации автоматов-преобразователей
С. 204–206.
Zakharov V., Козлова Д. Г.
Language:
Russian
In book
М.: Изд-во механико-математического факультета МГУ, 2016.
Popova E., Логико-философские штудии 2022 Vol. 20 No. 1 P. 1–7
There are two approaches to merging temporal and epistemic models. The first one consists in starting with a temporal model and enriching it with epistemic dimension (as temporal epistemic logic), while the second one is supposed to start with an epistemic model introducing temporal dimension (dynamic epistemic logic, epistemic temporal logic). The proposed evolutionary epistemic ...
Added: August 1, 2022
Gnatenko A., Zakharov V., Automatic Control and Computer Sciences 2021 Vol. 55 No. 7 P. 776–785
Sequential reactive systems include programs and devices that work with two streams of
data and convert input streams of data into output streams. Such information processing systems
include controllers, device drivers, computer interpreters. The results of operation of such computing
systems are infinite sequences of pairs of events of the request-response type, and, therefore, finite
transducers are most often ...
Added: January 17, 2022
Zakharov V., Automatic Control and Computer Sciences (AC&CS), Switzerland 2021 Vol. 55 No. 7 P. 670–701
Finite transducers, two-tape automata, and biautomata are related computational models
descended from the concept of finite-state automaton. In these models an automaton controls two
heads that read or write symbols on the tapes in the one-way mode. The computations of these three
types of automata show many common features, and it is surprising that the methods for analyzing ...
Added: January 17, 2022
Gnatenko A., Zakharov V., Моделирование и анализ информационных систем 2021 Т. 28 № 4 С. 356–371
Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses. When designing such systems one needs formal specification languages capable of expressing the relationships between the input and output flows. Previously, we introduced a family of such specification ...
Added: January 17, 2022
Zakharyaschev M., Ryzhikov V., Wałęga P., Springer Publishing Company, 2020.
Added: November 8, 2021
Rybakov V., Siberian Mathematical Journal 2021 Vol. 62 P. 503–510
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 ...
Added: November 8, 2021
Zakharyaschev M., Savateev Y., Ryzhikov V., Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2021.
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) given in linear temporal logic LTL over (Z, <) and deciding whether it is rewritable to an FO(<)-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity and FO-definability of regular languages, OMQ answering ...
Added: November 6, 2021
Popova E., , in: Двенадцатые Смирновские чтения: материалы Международной научной конференции, Москва, 24–26 июня 2021 г.: М.: Русское общество истории и философии науки, 2021. P. 134–137.
This paper is concerned with the formalization problem of a wide range of scenarios of how knowledge evolves over time. We focus on combinations of temporal and epistemic modalities reflecting various properties of rational agents’ deliberation. For this purpose, we introduce the model EEM – evolutionary epistemic model. ...
Added: June 28, 2021