Advertisement

Programming and Computer Software

, Volume 41, Issue 6, pp 307–310 | Cite as

Analysis of a graph by a set of automata

  • I. B. Bourdonov
  • A. S. Kossatchev
  • V. V. Kulyamin
Article
  • 51 Downloads

Abstract

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 [6].

Keywords

Full Information Finite Automaton Total Operating Time Initial Vertex Terminal Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    Burdonov, I.B., and Kossatchev, A.S., and Kulyamin, V.V., Irredundant algorithms for traversing directed graphs: The deterministic case, Program. Comput. Software, 2003, vol. 29, no. 5, pp. 245–258.MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Burdonov, I.B., and Kossatchev, A.S., and Kulyamin, V.V., Nonredundant algorithms for traversing directed graphs: Nondeterministic case, Program. Comput. Software, 2004, vol. 30, no. 1, pp. 2–17.MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    I. B. Burdonov, Traversal of an unknown directed graph by a finite robot, Program. Comput. Software, 2004, vol. 30, no. 4, pp. 188–203.MathSciNetCrossRefGoogle Scholar
  6. 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

Copyright information

© Pleiades Publishing, Ltd. 2015

Authors and Affiliations

  • I. B. Bourdonov
    • 1
  • A. S. Kossatchev
    • 1
  • V. V. Kulyamin
    • 1
  1. 1.Institute for System ProgrammingRussian Academy of SciencesMoscowRussia

Personalised recommendations