Programming and Computer Software

, Volume 29, Issue 5, pp 245–258 | Cite as

Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case

  • I. B. Bourdonov
  • A. S. Kossatchev
  • V. V. Kuliamin


Problems of testing program systems modeled by deterministic finite automata are considered. The necessary (and, sometimes, sufficient) component of such testing is a traversal of the graph of the automaton state transitions. The main attention is given to the so-called irredundant traversal algorithms (algorithms for traversing unknown graphs, or on-line algorithms), which do not require an a priori knowledge of the total graph structure.


Operating System State Transition Artificial Intelligence Direct Graph Testing Program 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Edmonds, J. and Johnson, E.L., Matching, Euler Tours and the Chinese Postman Math. Programming, 1973, vol. 5, pp. 88-124.Google Scholar
  2. 2.
    Lenstra, J.K. and Rinnooy Kan, A.H.G., On General Routing Problems, Networks, 1976, vol. 6, pp. 273-280.Google Scholar
  3. 3.
    Thimbleby, H., The Directed Chinese Postman Problem, Techn. Report, School of Computing Sci., Middlesex Univ., London, 2000.Google Scholar
  4. 4.
    Hoffman, D. and Strooper, P., ClassBench: A Framework for Automated Class Testing, Software Maintenance: Practice Experience, 1997, vol. 27, no. 5, pp.?573-579.Google Scholar
  5. 5.
    Murray, L., Carrington, D., MacColl, I., McDonald, J., and Strooper, P., Formal Derivation of Finite State Machines for Class Testing, Lecture Notes Comput. Sci., (Proc. of the 11th Int. Conf. of Z Users), Berlin: Springer, 1998, vol. 1493, pp. 42-59.Google Scholar
  6. 6.
    Deng, X. and Papadimitriou, C.H., Exploring an Unknown Graph, J. Graph Theory, 1999, vol. 32, no. 3, pp. 265-297.Google Scholar
  7. 7.
    Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Use of Finite Automata for Program Testing, Programmirovanie, 2000, no. 2, pp. 12-28.Google Scholar
  8. 8.
    Albers, S. and Henzinger, M.R., Exploring Unknown Environments, SIAM J. Comput., 2000, vol. 29, no. 4, pp. 1164-1188.Google Scholar
  9. 9.
    Ore, O., Theory of Graphs, Providence: AMS, 1962. Translated under the title Teoriya grafov, Moscow: Nauka, 1980.Google Scholar
  10. 10.
    Rabin, M.O., Maze Threading Automata. Lecture presented at MIT and UC Berkley, 1967.Google Scholar
  11. 11.
    Bourdonov, I.B., Study of the Automaton Behavior on Graphs, MS Dissertation, Moscow: Moscow State University, 1971.Google Scholar
  12. 12.
    Blum, M. and Sakoda, W.J., On the Capability of Finite Automata in 2 and 3 Dimensional Space, Proc. of the Eighteenth Annu. Symp. on Foundations of Comput. Sci., 1977, pp. 147-161.Google Scholar
  13. 13.
    Even, S., Graph Algorithms, Comput. Sci., 1979.Google Scholar
  14. 14.
    Afek, Y. and Gafni, E., Distributed Algorithms for Undirectional Networks, SIAM J. Comput. 1994, vol. 23, no.6, pp. 1152-1178.Google Scholar
  15. 15.
    Even, S., Litman, A., and Winkler, P., Computing with Snakes in Directed Networks of Automata, J. Algorithms, 1997, vol. 24, pp. 158-170.Google Scholar
  16. 16.
    Bhatt, S., Even, S., Greenberg, D., and Tayar, R., Traversing Directed Eulerian Mazes, Proc. of WG'2000, Brandes, U. and Wagner, D., Eds., Lecture Notes in Computer Science, vol. 1928, pp. 35-46, Berlin: Springer, 2000.Google Scholar
  17. 17.
    Lee, D. and Yannakakis, M., Principles and Methods of Testing Finite State Machines: A Survey, Proceedings of the IEEE, vol. 84, no. 8, pp. 1090-1123, Berlin: IEEE Computer Society, 1996.Google Scholar
  18. 18.
    von Bochmann, G. and Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, Proc. of ISSTA, 1994, pp. 109-124.Google Scholar
  19. 19.
    Petrenko, A., Yevtushenko, N., and Dssouli, R., Grey-Box FSM-Based Testing Strategies, Department Publication 911, Univ. de Montreal, 1994.Google Scholar
  20. 20.
    Fecko, M.A., Uyar, M.U., Sethi, A.S., and Amer, P.D., Conformance Testing in Systems with Semicontrollable Interfaces, Ann. Telecommunications, 2000, vol. 55, no.1, pp. 70-83.Google Scholar
  21. 21.
    Petrenko, A., Yevtushenko, N., and von Bochmann, G., Testing Deterministic Implementations from Nondeterministic FSM Specifications, Selected Proc. of the IFIP TC6 9th Int. Workshop on Testing of Communicating Systems, 1996.Google Scholar
  22. 22.
    Gurevich, Yu., Sequential Abstract State Machines Capture Sequential Algorithms, ACM Trans. Computational Logic, 2000, vol. 1, no. 1, pp. 77-111.Google Scholar
  23. 23.
    Tabourier, M., Cavalli, A., and Ionescu, M., A GSMMAP Protocol Experiment Using Passive Testing, Proc. of the World Congr. on Formal Methods in Development of Computing Systems (FM'99), Toulouse, 1999.Google Scholar
  24. 24.
    Rabin, M. and Scott, D., Finite Automata and Their Decision Problem, IBM J. Research Development, 1959, vol. 3, pp. 114-125.Google Scholar
  25. 25.
    Ginsburg, S., The Mathematical Theory of Context-Free Languages, New York: McGraw-Hill, 1966. Translated under the title Matematicheskaya teoriya kontekstnosvobodnykh yazykov, Moscow: Mir, 1970, pp. 71-78.Google Scholar
  26. 26.
    Varsanof'ev, D.V. and Dymchenko, A.G., Osnovy kompilyatsii (Fundamentals of Compilation), 1991, Scholar
  27. 27.
    Bourdonov, I, Kossatchev, A., Kuliamin, V., and Petrenko, A., UniTesK Test Suite Architecture, Proc. of FME 2002, Lecture Notes in Computer Science, vol.2391, pp. 77-88, Berlin: Springer, 2002.Google Scholar
  28. 28.
    Bourdonov, I., Kossatchev, A., Petrenko, A., and Gatter, D., KVEST: Automated Generation of Test Suites from Formal Specifications, Proc. of FM'99, Lecture Notes in Computer Science, vol. 1708, pp. 608-621, Berlin: Springer, 1999.Google Scholar
  29. 29. Scholar

Copyright information

© MAIK “Nauka/Interperiodica” 2003

Authors and Affiliations

  • I. B. Bourdonov
    • 1
  • A. S. Kossatchev
    • 1
  • V. V. Kuliamin
    • 1
  1. 1.Institute for System Programming, Russian Academy of Sciences, Bol'shaya KommunisticheskayaMoscowRussia

Personalised recommendations