Skip to main content
SpringerLink
Log in

Analysis of a graph by a set of automata

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  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 

Download references

Author information

Authors and Affiliations

  1. Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004, Russia

    I. B. Bourdonov, A. S. Kossatchev & V. V. Kulyamin

Authors
  1. I. B. Bourdonov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Kossatchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. V. Kulyamin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. B. Bourdonov.

Additional information

Original Russian Text © I.B. Bourdonov, A.S. Kossatchev, V.V. Kulyamin, 2015, published in Programmirovanie, 2015, Vol. 41, No. 6.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bourdonov, I.B., Kossatchev, A.S. & Kulyamin, V.V. Analysis of a graph by a set of automata. Program Comput Soft 41, 307–310 (2015). https://doi.org/10.1134/S0361768815060031

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768815060031

Keywords

Search

Navigation