Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Edmonds, J. and Johnson, E.L., Matching, Euler Tours and the Chinese Postman Math. Programming, 1973, vol. 5, pp. 88-124.
Lenstra, J.K. and Rinnooy Kan, A.H.G., On General Routing Problems, Networks, 1976, vol. 6, pp. 273-280.
Thimbleby, H., The Directed Chinese Postman Problem, Techn. Report, School of Computing Sci., Middlesex Univ., London, 2000.
Hoffman, D. and Strooper, P., ClassBench: A Framework for Automated Class Testing, Software Maintenance: Practice Experience, 1997, vol. 27, no. 5, pp.?573-579.
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.
Deng, X. and Papadimitriou, C.H., Exploring an Unknown Graph, J. Graph Theory, 1999, vol. 32, no. 3, pp. 265-297.
Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Use of Finite Automata for Program Testing, Programmirovanie, 2000, no. 2, pp. 12-28.
Albers, S. and Henzinger, M.R., Exploring Unknown Environments, SIAM J. Comput., 2000, vol. 29, no. 4, pp. 1164-1188.
Ore, O., Theory of Graphs, Providence: AMS, 1962. Translated under the title Teoriya grafov, Moscow: Nauka, 1980.
Rabin, M.O., Maze Threading Automata. Lecture presented at MIT and UC Berkley, 1967.
Bourdonov, I.B., Study of the Automaton Behavior on Graphs, MS Dissertation, Moscow: Moscow State University, 1971.
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.
Even, S., Graph Algorithms, Comput. Sci., 1979.
Afek, Y. and Gafni, E., Distributed Algorithms for Undirectional Networks, SIAM J. Comput. 1994, vol. 23, no.6, pp. 1152-1178.
Even, S., Litman, A., and Winkler, P., Computing with Snakes in Directed Networks of Automata, J. Algorithms, 1997, vol. 24, pp. 158-170.
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.
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.
von Bochmann, G. and Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, Proc. of ISSTA, 1994, pp. 109-124.
Petrenko, A., Yevtushenko, N., and Dssouli, R., Grey-Box FSM-Based Testing Strategies, Department Publication 911, Univ. de Montreal, 1994.
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.
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.
Gurevich, Yu., Sequential Abstract State Machines Capture Sequential Algorithms, ACM Trans. Computational Logic, 2000, vol. 1, no. 1, pp. 77-111.
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.
Rabin, M. and Scott, D., Finite Automata and Their Decision Problem, IBM J. Research Development, 1959, vol. 3, pp. 114-125.
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.
Varsanof'ev, D.V. and Dymchenko, A.G., Osnovy kompilyatsii (Fundamentals of Compilation), 1991, http://www.code-net.ru/progr/compil/cmp/intro.php.
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.
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.
http://www.ispras.ru/RedVerst.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bourdonov, I.B., Kossatchev, A.S. & Kuliamin, V.V. Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case. Programming and Computer Software 29, 245–258 (2003). https://doi.org/10.1023/A:1025733107700
Issue Date:
DOI: https://doi.org/10.1023/A:1025733107700