{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:06Z","timestamp":1775053266916,"version":"3.50.1"},"reference-count":18,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"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":[[2010,7]]},"DOI":"10.1134\/s0361768810040043","type":"journal-article","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T06:25:25Z","timestamp":1283495125000},"page":"216-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Synthesis of distinguishing test cases for timed finite state machines"],"prefix":"10.1134","volume":"36","author":[{"given":"M. L.","family":"Gromov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. V.","family":"Yevtushenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2010,9,4]]},"reference":[{"issue":"2","key":"6074_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R. and Dill, D.L., A Theory of Timed Automata, Theor. Comput. Sci., 1994, vol. 126, no. 2, pp. 183\u2013235.","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"6074_CR2","first-page":"1023","volume":"28","author":"A. En-Nouaary","year":"2002","unstructured":"En-Nouaary, A., Dssouli, R., and Khendek, F., Timed Wp-Method: Testing Real-Time Systems, IEEE TSE, 2002, vol. 28, no. 11, pp. 1023\u20131038.","journal-title":"IEEE TSE"},{"issue":"1\u20132","key":"6074_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(99)00134-6","volume":"254","author":"J. Springintveld","year":"2001","unstructured":"Springintveld, J., Vaandrager, F., and D\u2019Argenio, P., Testing Timed Automata, Theor. Comput. Sci., 2001, vol. 254, no. 1\u20132, pp. 225\u2013257.","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"6074_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TC.2008.15","volume":"57","author":"M.G. Merayo","year":"2008","unstructured":"Merayo, M.G., Nu\u2019\u00f1ez, M., and Rodriguez, I., Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-outs, IEEE Trans. on Comput., 2008, vol. 57, no. 6, pp. 835\u2013844.","journal-title":"IEEE Trans. on Comput."},{"issue":"2","key":"6074_CR5","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.comnet.2007.10.002","volume":"52","author":"M.G. Merayo","year":"2008","unstructured":"Merayo, M.G., Nu\u2019\u00f1ez, M., and Rodriguez, I., Formal Testing from Timed Finite State Machines, Comput. Networks, 2008, vol. 52, no. 2, pp. 432\u2013460.","journal-title":"Comput. Networks"},{"key":"6074_CR6","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z., Switching and Finite Automata Theory, New York: McGraw-Hill, 1978."},{"issue":"4","key":"6074_CR7","first-page":"85","volume":"3","author":"M.L. Gromov","year":"2008","unstructured":"Gromov, M.L., A Method of Construction of Complete Verifying Test for Input-Output Automata, Vestn. Tomskogo Gos. Univ., Control, Computers and Informatics, 2008, vol. 3, no. 4, pp. 85\u201398.","journal-title":"Vestn. Tomskogo Gos. Univ., Control, Computers and Informatics"},{"key":"6074_CR8","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., and Yannakakis, M., Distinguishing Tests for Nondeterministic and Probabilistic Machines, Proc. of the 27th ACM Symp. on Theory of Computing, 1995, pp. 363\u2013372.","DOI":"10.1145\/225058.225161"},{"key":"6074_CR9","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, 1980, vol. 92.","DOI":"10.1007\/3-540-10235-3"},{"key":"6074_CR10","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Yevtushenko, N., and von Bochmann, G., Testing Deterministic Implementations from their Nondeterministic Specifications, Proc. of the IFIP Ninth Int. Workshop on Testing of Communicating Systems, 1996, pp. 125\u2013140.","DOI":"10.1007\/978-0-387-35062-2_10"},{"key":"6074_CR11","volume-title":"Nedeterminirovannye avtomaty: analiz i sintez. Chast\u2019 1. Otnosheniya i operatsii. Uchebnoe posobie","author":"N.V. Yevtushenko","year":"2006","unstructured":"Yevtushenko, N.V., Petrenko, A.F., and Vetrova, M.V., Nedeterminirovannye avtomaty: analiz i sintez. Chast\u2019 1. Otnosheniya i operatsii. Uchebnoe posobie (Nondeterministic Automata: Analysis and Synthesis. Part 1: Relations and Operations. Textbook), Tomsk: TGU, 2006."},{"key":"6074_CR12","unstructured":"Starke, P., Abstract automata, American Elsevier, 1972."},{"key":"6074_CR13","first-page":"210","volume-title":"6th All-Siberian Congress for Women Mathematicians (S.V. Kovalevskaya\u2019s Birthday)","author":"O.V. Kondrat\u2019eva","year":"2010","unstructured":"Kondrat\u2019eva, O.V. and Gromov, M.L., Observable Form of Timed Automata, 6th All-Siberian Congress for Women Mathematicians (S.V. Kovalevskaya\u2019s Birthday), Krasnoyarsk: RITs SibGTU, 2010, pp. 210\u2013214."},{"key":"6074_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-02138-1_9","volume":"5522","author":"M. Gromov","year":"2009","unstructured":"Gromov, M., El-Fakih, Kh., Shabaldina, N., and Yevtushenko, N., Distinguishing Non-deterministic Timed Finite State Machines, Lecture Notes in Computer Science, 2009, vol. 5522, pp. 137\u2013151.","journal-title":"Lecture Notes in Computer Science"},{"issue":"10","key":"6074_CR15","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/TC.2004.85","volume":"53","author":"R.M. Hierons","year":"2004","unstructured":"Hierons, R.M., Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting, IEEE Trans. Comput., 2004, vol. 53, no. 10, pp. 1330\u20131342.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"6074_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1093\/comjnl\/46.3.307","volume":"46","author":"R.M. Hierons","year":"2003","unstructured":"Hierons, R.M., Using Candidates to Test a Deterministic Implementation against a Non-Deterministic Finite State Machine, The Comput. J., 2003, vol. 46, no. 3, pp. 307\u2013318.","journal-title":"The Comput. J."},{"issue":"5","key":"6074_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1093\/comjnl\/41.5.349","volume":"41","author":"R.M. Hierons","year":"1998","unstructured":"Hierons, R.M., Adaptive Testing of a Deterministic Implementation against a Nondeterministic Finite State Machine, The Comput. J., 1998, vol. 41, no. 5, pp. 349\u2013355.","journal-title":"The Comput. J."},{"key":"6074_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11759744_9","volume":"3997","author":"A. Petrenko","year":"2005","unstructured":"Petrenko, A. and Yevtushenko, N., Conformance Tests as Checking Experiments for Partial Nondeterministic FSM, Lecture Notes in Computer Science (Proc. of the 5th Int. Workshop on Formal Approaches to Testing of Software), 2005, vol. 3997, pp. 118\u2013133.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810040043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768810040043","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810040043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810040043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:08:07Z","timestamp":1775009287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768810040043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["6074"],"URL":"https:\/\/doi.org\/10.1134\/s0361768810040043","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"25 May 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}