Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Igor Burdonov"'
Autor:
Igor Burdonov, Alexander Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 28, Iss 1, Pp 151-184 (2018)
The problem of testing of aggregate systems is considered. The system components are described with finite automata with multiple entries and exits. The communication between automata is described with message passing over simplex communication chann
Externí odkaz:
https://doaj.org/article/c5865285b5304054bd8d7bb8f80c592b
Autor:
Igor Burdonov, Alexander Kossachev
Publikováno v:
Труды Института системного программирования РАН, Vol 26, Iss 6, Pp 57-62 (2018)
The paper presents a parallel graph exploration algorithm. Automaton on a graph is an analogue of the Turing machine тАФ tape cells correspond to graph vertices, where the automaton can store some data, and moves along the tape correspond to moves
Externí odkaz:
https://doaj.org/article/21ae4618cbbf45f8b096217da6726707
Autor:
Igor Burdonov, Alexander Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 27, Iss 2, Pp 189-220 (2018)
The problem of parallel computation of the value of a function of multiset of values recorded at the vertices of a directed strongly connected graph is considered. Computation is performed by automata that are located at the graph vertices. The autom
Externí odkaz:
https://doaj.org/article/b5e4bd4137d643589e75f190d7cc0ed4
Publikováno v:
Труды Института системного программирования РАН, Vol 26, Iss 6, Pp 63-66 (2018)
The paper presents a parallel computation algorithm of an arbitrary function value on a multiset of values distributed on directed graph vertices. The computation is performed by message passing executed by automata distributed on the graph vertices.
Externí odkaz:
https://doaj.org/article/b5eaf60a4735436ea3abb12e53736dd1
Autor:
Igor Burdonov, Alexander Kosachev
Publikováno v:
Труды Института системного программирования РАН, Vol 26, Iss 2, Pp 43-86 (2018)
Graph learning by automata is a basic task in many applications. Among these applications are verification and testing of software and hardware systems, network exploration including Internet and GRID basing on formal models. The system or network mo
Externí odkaz:
https://doaj.org/article/cd07d12c270b4b939c41db7ef8009668
Autor:
Igor Burdonov, Alexander Kosachev
Publikováno v:
Труды Института системного программирования РАН, Vol 27, Iss 1, Pp 69-96 (2018)
Monitoring of oriented graphs is a key task in many applications. Such monitoring is very specific when the graph models a communication network including Internet and GRID. A node of the network has local information about the network: if "knows" on
Externí odkaz:
https://doaj.org/article/9f01b2a214bd4dca99189e146a3f2de8
Autor:
Igor Burdonov, Alexander Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 26, Iss 1, Pp 27-72 (2018)
The paper covers theoretical and practical works on conformance testing performed in ISP RAS since 1994 till now. The conformance theory development was done in various directions and, in the whole, was characterized by generalization of the interact
Externí odkaz:
https://doaj.org/article/110896f1f5d142868ea30869aac64934
Publikováno v:
EWDTS
Software Defined Network (SDN) technology is one of the modern network virtualization technologies. When implementing a virtual network on the SDN data plane, undesired effects may occur: the appearance of undesired paths where packages can be sent,
Autor:
Igor Burdonov, Alexandre Kossachev, Jorge López, Nina Yevtushenko, Natalia Kushik, Djamal Zeghlache
Publikováno v:
ENASE
Software Defined Networking (SDN) is a novel network management technology, which currently attracts a lot of attention due to the provided capabilities. Recently, different works have been devoted to testing / verifying the (correct) configurations
Publikováno v:
EWDTS
The paper investigates the implementation of virtual networks on the SDN data plane, modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender, receiver), and it is implement