{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:47:55Z","timestamp":1775054875492,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Programming and Computer Software"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1025733107700","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T14:33:40Z","timestamp":1067006020000},"page":"245-258","source":"Crossref","is-referenced-by-count":9,"title":["Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case"],"prefix":"10.1007","volume":"29","author":[{"given":"I. B.","family":"Bourdonov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S.","family":"Kossatchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. V.","family":"Kuliamin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"475085_CR1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J. and Johnson, E.L., Matching, Euler Tours and the Chinese Postman Math. Programming, 1973, vol. 5, pp. 88-124.","journal-title":"Math. Programming"},{"key":"475085_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K. and Rinnooy Kan, A.H.G., On General Routing Problems, Networks, 1976, vol. 6, pp. 273-280.","journal-title":"Networks"},{"key":"475085_CR3","series-title":"Techn. Report","volume-title":"The Directed Chinese Postman Problem","author":"H. Thimbleby","year":"2000","unstructured":"Thimbleby, H., The Directed Chinese Postman Problem, Techn. Report, School of Computing Sci., Middlesex Univ., London, 2000."},{"issue":"5","key":"475085_CR4","first-page":"573","volume":"27","author":"D. Hoffman","year":"1997","unstructured":"Hoffman, D. and Strooper, P., ClassBench: A Framework for Automated Class Testing, Software Maintenance: Practice Experience, 1997, vol. 27, no. 5, pp.?573-579.","journal-title":"Software Maintenance: Practice Experience"},{"key":"475085_CR5","first-page":"42","volume-title":"Lecture Notes Comput. Sci., (Proc. of the 11th Int. Conf. of Z Users)","author":"L. Murray","year":"1998","unstructured":"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."},{"issue":"3","key":"475085_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X. and Papadimitriou, C.H., Exploring an Unknown Graph, J. Graph Theory, 1999, vol. 32, no. 3, pp. 265-297.","journal-title":"J. Graph Theory"},{"key":"475085_CR7","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Use of Finite Automata for Program Testing, Programmirovanie, 2000, no. 2, pp. 12-28."},{"issue":"4","key":"475085_CR8","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S. and Henzinger, M.R., Exploring Unknown Environments, SIAM J. Comput., 2000, vol. 29, no. 4, pp. 1164-1188.","journal-title":"SIAM J. Comput."},{"key":"475085_CR9","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O. Ore","year":"1962","unstructured":"Ore, O., Theory of Graphs, Providence: AMS, 1962. Translated under the title Teoriya grafov, Moscow: Nauka, 1980."},{"key":"475085_CR10","unstructured":"Rabin, M.O., Maze Threading Automata. Lecture presented at MIT and UC Berkley, 1967."},{"key":"475085_CR11","volume-title":"MS Dissertation","author":"I.B. Bourdonov","year":"1971","unstructured":"Bourdonov, I.B., Study of the Automaton Behavior on Graphs, MS Dissertation, Moscow: Moscow State University, 1971."},{"key":"475085_CR12","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/SFCS.1977.20"},{"key":"475085_CR13","unstructured":"Even, S., Graph Algorithms, Comput. Sci., 1979."},{"issue":"6","key":"475085_CR14","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1137\/S009753979223277X","volume":"23","author":"Y. Afek","year":"1994","unstructured":"Afek, Y. and Gafni, E., Distributed Algorithms for Undirectional Networks, SIAM J. Comput. 1994, vol. 23, no.6, pp. 1152-1178.","journal-title":"SIAM J. Comput."},{"key":"475085_CR15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1006\/jagm.1996.0840","volume":"24","author":"S. Even","year":"1997","unstructured":"Even, S., Litman, A., and Winkler, P., Computing with Snakes in Directed Networks of Automata, J. Algorithms, 1997, vol. 24, pp. 158-170.","journal-title":"J. Algorithms"},{"key":"475085_CR16","first-page":"35","volume-title":"Lecture Notes in Computer Science","author":"S. Bhatt","year":"2000","unstructured":"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."},{"key":"475085_CR17","first-page":"1090","volume-title":"Proceedings of the IEEE","author":"D. Lee","year":"1996","unstructured":"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."},{"key":"475085_CR18","doi-asserted-by":"crossref","unstructured":"von Bochmann, G. and Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, Proc. of ISSTA, 1994, pp. 109-124.","DOI":"10.1145\/186258.187153"},{"key":"475085_CR19","unstructured":"Petrenko, A., Yevtushenko, N., and Dssouli, R., Grey-Box FSM-Based Testing Strategies, Department Publication 911, Univ. de Montreal, 1994."},{"issue":"1","key":"475085_CR20","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF02997773","volume":"55","author":"M.A. Fecko","year":"2000","unstructured":"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.","journal-title":"Ann. Telecommunications"},{"key":"475085_CR21","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/978-0-387-35062-2_10"},{"issue":"1","key":"475085_CR22","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Gurevich, Yu., Sequential Abstract State Machines Capture Sequential Algorithms, ACM Trans. Computational Logic, 2000, vol. 1, no. 1, pp. 77-111.","journal-title":"ACM Trans. Computational Logic"},{"key":"475085_CR23","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-48119-2_50"},{"key":"475085_CR24","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M. and Scott, D., Finite Automata and Their Decision Problem, IBM J. Research Development, 1959, vol. 3, pp. 114-125.","journal-title":"IBM J. Research Development"},{"key":"475085_CR25","first-page":"71","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"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."},{"key":"475085_CR26","unstructured":"Varsanof'ev, D.V. and Dymchenko, A.G., Osnovy kompilyatsii (Fundamentals of Compilation), 1991, http:\/\/www.code-net.ru\/progr\/compil\/cmp\/intro.php."},{"key":"475085_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45614-7_5","volume-title":"Proc. of FME 2002","author":"I Bourdonov","year":"2002","unstructured":"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."},{"key":"475085_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/3-540-48119-2_34","volume-title":"Proc. of FM'99","author":"I. Bourdonov","year":"1999","unstructured":"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."},{"key":"475085_CR29","unstructured":"http:\/\/www.ispras.ru\/RedVerst."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025733107700.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025733107700","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025733107700.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:52:09Z","timestamp":1775008329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025733107700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["475085"],"URL":"https:\/\/doi.org\/10.1023\/a:1025733107700","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}