{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:38:22Z","timestamp":1775014702284,"version":"3.50.1"},"reference-count":6,"publisher":"Pleiades Publishing Ltd","issue":"6","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1134\/s0361768815060031","type":"journal-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T22:51:27Z","timestamp":1447455087000},"page":"307-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of a graph by a set of automata"],"prefix":"10.1134","volume":"41","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":"Kulyamin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2015,11,15]]},"reference":[{"key":"6276_CR1","volume-title":"Open Cirrus Summit 2011","author":"A. Demakov","year":"2011","unstructured":"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."},{"key":"6276_CR2","first-page":"187","volume":"3","author":"I.B. Bourdonov","year":"2011","unstructured":"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\u2013193.","journal-title":"Vestn. Nizhegorod. Gos. Univ."},{"issue":"5","key":"6276_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1025733107700","volume":"29","author":"I.B. Burdonov","year":"2003","unstructured":"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\u2013258.","journal-title":"Program. Comput. Software"},{"issue":"1","key":"6276_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1023\/B:PACS.0000013436.72070.95","volume":"30","author":"I.B. Burdonov","year":"2004","unstructured":"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\u201317.","journal-title":"Program. Comput. Software"},{"issue":"4","key":"6276_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1023\/B:PACS.0000036417.58183.64","volume":"30","author":"I. B. Burdonov","year":"2004","unstructured":"I. B. Burdonov, Traversal of an unknown directed graph by a finite robot, Program. Comput. Software, 2004, vol. 30, no. 4, pp. 188\u2013203.","journal-title":"Program. Comput. Software"},{"issue":"2","key":"6276_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.15514\/ISPRAS-2014-26(2)-2","volume":"30","author":"I.B. Bourdonov","year":"2014","unstructured":"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\u201386.","journal-title":"Tr. Inst. Syst. Program., Ross. Akad. Nauk"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768815060031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768815060031","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768815060031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768815060031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:20:53Z","timestamp":1775010053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768815060031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["6276"],"URL":"https:\/\/doi.org\/10.1134\/s0361768815060031","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"12 May 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}