Zobrazeno 1 - 9
of 9
pro vyhledávání: '"N. O. Garanina"'
Autor:
N. O. Garanina, E. A. Sidorova
Publikováno v:
Моделирование и анализ информационных систем, Vol 23, Iss 6, Pp 703-714 (2016)
In the paper, we describe a verification method for families of distributed systems generated by context-sensitive network grammar of a special kind. This grammar includes special non-terminal symbols, so called quasi-terminals, which uniquely corre
Externí odkaz:
https://doaj.org/article/97e21b0835864362a79767e9288fb11f
Publikováno v:
Моделирование и анализ информационных систем, Vol 21, Iss 6, Pp 31-43 (2014)
The paper presents an approach to formal verification of multi-agent data analysis algorithms for ontology population. The system agents correspond to information items of the input data and the rule of ontology population and data processing. They d
Externí odkaz:
https://doaj.org/article/a49a01e1d46044adb7550d43a0d36669
Autor:
N. O. Garanina
Publikováno v:
Моделирование и анализ информационных систем, Vol 20, Iss 6, Pp 10-21 (2013)
We investigate a model checking problem for the logic of common knowledge and fixpoints µPLCn in well-structured multiagent systems with perfect recall. In this paper we show that a perfect recall synchronous environment over a well-structured envir
Externí odkaz:
https://doaj.org/article/3b35684befec4fc583d4770f10656f6e
Autor:
N. O. Garanina
Publikováno v:
Моделирование и анализ информационных систем, Vol 18, Iss 4, Pp 56-67 (2011)
Symbolic model checking is based on a compact representation of sets of states and transition relations. At present there are three basic approaches of symbolic model checking: BDD-methods, bounded model checking using SAT-solvers, and various algebr
Externí odkaz:
https://doaj.org/article/4452cc5986f846aa997ceac60214914d
Publikováno v:
Моделирование и анализ информационных систем, Vol 18, Iss 2, Pp 113-128 (2011)
We continue our study of multiagent algorithms for a problem that we call the Mars Robot Puzzle. This problem could be considered as a special case of a graph-theoretic problem (Discrete Mathematics), as a combinatorial geometry problem (Computer Sci
Externí odkaz:
https://doaj.org/article/4c60c0eed5cc4e9fbaeedddaf6455e60
Autor:
N. O. Garanina
Publikováno v:
Моделирование и анализ информационных систем, Vol 17, Iss 4, Pp 52-59 (2010)
A new data structure is suggested for symbolic model checking of distributed systems defined by linear functions of integer variables.
Externí odkaz:
https://doaj.org/article/3226f7a8c1cc4e948d41d3596d3344a9
Autor:
N. O. Garanina, S. P. Gorlatch
Publikováno v:
Automatic Control and Computer Sciences. 56:634-648
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7ffeb1f37c363d57d4b06d3f598a290
https://doi.org/10.3103/s0146411622070045
https://doi.org/10.3103/s0146411622070045
Autor:
N. O. Garanina, I. S. Anureev, V. E. Zyubin, S. M. Staroletov, T. V. Liakh, A. S. Rozov, S. P. Gorlatch
Publikováno v:
Automatic Control and Computer Sciences. 55:763-775
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::441d02a2683ff4ec3bd4f179b39adda8
https://doi.org/10.3103/s0146411621070038
https://doi.org/10.3103/s0146411621070038
Publikováno v:
Vestnik NSU. Series: Information Technologies. 16:85-94
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14bc95fc2054cd13bba99eb040362c63
https://doi.org/10.25205/1818-7900-2018-16-4-85-94
https://doi.org/10.25205/1818-7900-2018-16-4-85-94