Analysis of a graph by a set of automata
- 51 Downloads
An algorithm of traversal (retrieval of full information on the structure) of an a priori unknown directed graph by an unbounded set of finite automata that interact through the exchange of messages and can move along the arcs of the graph according to their direction is described. Under the assumption that the execution time of basic operations and the transmission time of individual messages are bounded, the total operating time of the algorithm is bounded, at worst, by O(m + nd), where n is the number of vertices of the graph, m is the number of its arcs, and d is the diameter of the graph; moreover, this estimate is unimprovable. The full proofs of the propositions formulated in this paper have been published in .
KeywordsFull Information Finite Automaton Total Operating Time Initial Vertex Terminal Vertex
Unable to display preview. Download preview PDF.
- 1.Demakov, A., Kamkin, A., and Sortov, A., High-Performance Testing: Parallelizing Functional Tests for Computer Systems Using Distributed Graph Exploration, Open Cirrus Summit 2011, Moscow, 2011.Google Scholar
- 2.Bourdonov, I.B., Groshev, S.G., Demakov, A.V., Kamkin. A.S., Kossatchev, A.S., and Sortov, A.A., Parallel testing of large automata models, Vestn. Nizhegorod. Gos. Univ., 2011, no. 3, pp. 187–193.Google Scholar
- 6.Bourdonov, I.B., and Kossatchev, A.S., Traversal of an unknown directed graph by a group of automata, Tr. Inst. Syst. Program., Ross. Akad. Nauk, 2014, vol. 30, no. 2, pp. 43–86.Google Scholar