Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Natalya Olegovna Garanina"'
Publikováno v:
Automatic Control and Computer Sciences. 54:740-751
User-friendly formal specification and verification of concurrent and distributed systems for various domains, such as automatic control systems, telecommunications, and business processes, are active research topics due to their practical significan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7626c71c99aae79d460b9a60c834ae5d
https://doi.org/10.3103/s014641162007007x
https://doi.org/10.3103/s014641162007007x
Autor:
Natalya Olegovna Garanina, T. V. Lyakh, Andrei Rozov, Igor S. Anureev, Sergei Gorlatch, Vladimir Zyubin
Publikováno v:
Programming and Computer Software. 46:261-272
This paper presents a new two-step verification method for control software. The novelty of the method is that it reduces the verification of the temporal properties of a control program to the deductive verification of an imperative program in the H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bc8f2c8dada888e5d208eecefa4fcc9
https://doi.org/10.1134/s0361768820040027
https://doi.org/10.1134/s0361768820040027
Publikováno v:
Automatic Control and Computer Sciences. 53:584-594
This paper presents the ontology of the concurrent processes close to Hoare communicating sequential processes. It is a part of an intellectual system for supporting verification of behavioral properties of such processes. Our ontological representat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42d9803b0c897de843c7070b23b767cf
https://doi.org/10.3103/s0146411619070058
https://doi.org/10.3103/s0146411619070058
Publikováno v:
Programming and Computer Software. 44:23-34
The multiagent approach to coreference resolution in the process of extracting information from texts in natural languages for ontology population is described. Special class agents corresponding to ontology classes are defined. They analyze the avai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61831f22f56eac6371e0a6c72f1ed683
https://doi.org/10.1134/s0361768818010036
https://doi.org/10.1134/s0361768818010036
Publikováno v:
Programming and Computer Software. 42:206-215
The paper presents a conflict resolution algorithm for multi-agent systems with agents connected by relations of different types and worth. The result of conflict resolution is a conflict-free set of agents. We apply this algorithm for the ambiguity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68062d79eea0a7315a9e94878af39136
https://doi.org/10.1134/s0361768816040034
https://doi.org/10.1134/s0361768816040034
Publikováno v:
Automatic Control and Computer Sciences. 49:420-429
The paper presents an approach to formal verification of multiagent 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 de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76736a27c5fac9216ffe31a2b19820a7
https://doi.org/10.3103/s014641161507007x
https://doi.org/10.3103/s014641161507007x
Autor:
Natalya Olegovna Garanina
Publikováno v:
Automatic Control and Computer Sciences. 46:331-337
The symbolic model checking is based on the compact representation of a set. Up to now, there are three general directions of symbolic model checking: methods based on binary decision diagrams, bounded model checking with SAT solvers, and various alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99996065b0b5984879e9bf84bfc2078b
https://doi.org/10.3103/s0146411612070085
https://doi.org/10.3103/s0146411612070085
Autor:
Natalya Olegovna Garanina
Publikováno v:
Programming and Computer Software. 38:294-303
The model checking algorithm for a combination of the computation tree logic (CTL) and the propositional logic of knowledge (PLK) in multiagent systems with perfect recall is revised. The proposed approach is based on data structures that are exponen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a55417e7c9580f972571235a96f433ff
https://doi.org/10.1134/s0361768812060047
https://doi.org/10.1134/s0361768812060047
Autor:
Natalya Olegovna Garanina
Publikováno v:
Automatic Control and Computer Sciences. 45:397-401
A new data structure is suggested for symbolic model checking of distributed systems defined by linear functions of integer variables.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b356b570b9945d8da4168d4ce7531042
https://doi.org/10.3103/s0146411611070078
https://doi.org/10.3103/s0146411611070078
Publikováno v:
Encyclopedia of Artificial Intelligence
It becomes evident in recent years a surge of interest to applications of modal logics for specification and validation of complex systems. It holds in particular for combined logics of knowledge, time and actions for reasoning about multiagent syste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd595d0113a717c6885c70d25ede91f4
https://doi.org/10.4018/978-1-59904-849-9.ch160
https://doi.org/10.4018/978-1-59904-849-9.ch160
