{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:04:05Z","timestamp":1775012645229,"version":"3.50.1"},"reference-count":36,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1134\/s0361768807050015","type":"journal-article","created":{"date-parts":[[2007,9,29]],"date-time":"2007-09-29T02:55:51Z","timestamp":1191034551000},"page":"239-260","source":"Crossref","is-referenced-by-count":6,"title":["Formalization of test experiments"],"prefix":"10.1134","volume":"33","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":"137","reference":[{"key":"5001_CR1","doi-asserted-by":"crossref","unstructured":"Bernot, G., Testing against Formal Specifications: A Theoretical View, TAPSOFT\u201991, Abramsky, S. and Maibaum, T.S.F., Eds., vol. 2, pp. 99\u2013119, Lect. Notes Comput. Sci., 1991, vol. 494.","DOI":"10.1007\/3540539816_63"},{"key":"5001_CR2","doi-asserted-by":"crossref","unstructured":"Milner, R., Modal Characterization of Observable Machine Behavior, Proc. CAAP, 1981, Astesiano, G. and Bohm, C. Eds., Lect. Notes Comput. Sci., 1981, vol. 112, pp. 25\u201334.","DOI":"10.1007\/3-540-10828-9_52"},{"key":"5001_CR3","doi-asserted-by":"crossref","unstructured":"Van Glabbeek, R.J., The Linear Time\u2014Branching Time Spectrum, Proc. of CONCUR\u201990, Baeten, J.C.M. and Klop, J.W., Eds., Lect. Notes Comput. Sci., 1990, vol. 458, pp. 278\u2013297.","DOI":"10.1007\/BFb0039066"},{"key":"5001_CR4","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"Proc. of CONCUR\u201993","author":"R.J. Van Glabbeek","year":"1993","unstructured":"Van Glabbeek, R.J., The Linear Time\u2014Branching Time Spectrum II: The Semantics of Sequential Processes with Silent Moves, Proc. of CONCUR\u201993, Hildesheim, Germany, 1993, Best, E., Ed., Lect. Notes Comput. Sci., 1993, vol. 715, p. 66."},{"key":"5001_CR5","doi-asserted-by":"crossref","unstructured":"Lynch, N.A. and Tuttle, M.R., Hierarchical Correctness Proofs for Distributed Algorithms, Proc. of the 6th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, 1987, pp. 137\u2013151.","DOI":"10.1145\/41840.41852"},{"key":"5001_CR6","unstructured":"Phalippou, M. Relations d\u2019Implantation et Hypotheses de Test des Automates a Entrees et Sorties, PhD Thesis, l\u2019Universite de Bordeaux 1, 1994."},{"key":"5001_CR7","doi-asserted-by":"crossref","unstructured":"Tretmans, J., Test Generation with Inputs, Outputs and Repetitive Quiescence, Software Concepts and Tools, 1996, vol. 17, issue 3.","DOI":"10.1007\/3-540-61042-1_42"},{"key":"5001_CR8","doi-asserted-by":"crossref","unstructured":"Milner, R., A Calculus of Communicating Systems, Lect. Notes Comput. Sci., 1980, vol. 92.","DOI":"10.1007\/3-540-10235-3"},{"key":"5001_CR9","unstructured":"Milner, R., Communication and Concurrency, Prentice-Hall, 1989."},{"key":"5001_CR10","doi-asserted-by":"crossref","unstructured":"Vaandrager, F., On the Relationship between Process Algebra and Input\/Output Automata, Logic in Computer Science, Sixth Annual IEEE Symposium, IEEE Computer Society, 1991, pp. 387\u2013398.","DOI":"10.1109\/LICS.1991.151662"},{"key":"5001_CR11","doi-asserted-by":"crossref","unstructured":"Jard, C., J\u00e9ron, T., Tanguy, L., and Viho, C., Remote Testing Can Be as Powerful as Local Testing, Formal Methods for Protocol Engineering and Distributed Systems, FORTE XII\/PSTV XIX\u201999 Wu, J., Chanson, S., and Gao, Q., Eds., Beijing, 1999, pp. 25\u201340.","DOI":"10.1007\/978-0-387-35578-8_2"},{"key":"5001_CR12","doi-asserted-by":"crossref","unstructured":"Van der Bijl, M., Rensink, A., and Tretmans, J., Compositional Testing with ioco, Formal Approaches to Software Testing: Third Int. Workshop FATES, Petrenko, A. and Ulrich, A., Eds., Montreal, 2003, Lect. Notes Comput. Sci., 2003, vol. 2931, pp. 86\u2013100.","DOI":"10.1007\/978-3-540-24617-6_7"},{"key":"5001_CR13","unstructured":"Van der Bijl, M., Rensink, A., and Tretmans, J., Component Based Testing with ioco, CTIT Technical Report, Univ. of Twente, 2003, no. TR-CTIT-03-34."},{"key":"5001_CR14","doi-asserted-by":"crossref","unstructured":"Von Bochmann, G.V. and Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, Proc. of ISSTA, 1994, pp. 109\u2013124.","DOI":"10.1145\/186258.187153"},{"key":"5001_CR15","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\u20131123, Berlin: IEEE Computer Society, 1996."},{"key":"5001_CR16","volume-title":"Formal Approaches to Conformance Testing","author":"J. Tretmans","year":"1992","unstructured":"Tretmans, J., Formal Approaches to Conformance Testing, Ph.D. Thesis, Enschede, Netherlands: Univ. of Twente, 1992."},{"key":"5001_CR17","first-page":"63","volume-title":"Trudy Vserossiiskoi konferentsii \u201cNauchnyi servis v seti Internet\u201d","author":"I.B. Bourdonov","year":"2005","unstructured":"Bourdonov, I.B. and Kossatchev, A.S., Testing Components of a Distributed System, Trudy Vserossiiskoi konferentsii \u201cNauchnyi servis v seti Internet\u201d (Proc. of the All-Russia Conf. on the Research Services on the Internet), Moscow: Mosk. Gos. Univ., 2005, pp. 63\u201365."},{"key":"5001_CR18","first-page":"67","volume-title":"Trudy Vserossiiskoi konferentsii \u201cNauchnyi servis v seti Internet\u201d","author":"I.B. Bourdonov","year":"2005","unstructured":"Bourdonov, I.B. and Kossatchev, A.S., Verification of the Composition of a Distributed System, Trudy Vserossiiskoi konferentsii \u201cNauchnyi servis v seti Internet\u201d (Proc. of the All-Russia Conf. on the Research Services on the Internet), Moscow: Mosk. Gos. Univ., 2005, pp. 67\u201369."},{"key":"5001_CR19","doi-asserted-by":"crossref","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions, Proc. of MBT, Vienna, 2006.","DOI":"10.1016\/j.entcs.2006.09.008"},{"key":"5001_CR20","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Teoriya sootvetstviya dlya sistem s blokirovkami i razrusheniyami (Conformance Theory for Systems with Refusals and Destruction), Moscow: Nauka (in press)."},{"key":"5001_CR21","doi-asserted-by":"crossref","unstructured":"Heerink, L. and Tretmans, J., Refusal Testing for Classes of Transition Systems with Inputs and Outputs, in Formal Description Techniques and Protocol Specification, Testing and Verification, Chapman & Hill, 1997.","DOI":"10.1007\/978-0-387-35271-8_2"},{"key":"5001_CR22","volume-title":"PhD Thesis","author":"L. Heerink","year":"1998","unstructured":"Heerink, L. Ins and Outs in Refusal Testing, PhD Thesis, Enschede, Netherlands: Univ. of Twente, 1998."},{"key":"5001_CR23","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Yevtushenko, N., and Huo, J.L., Testing Transition Systems with Input and Output Testers, Proc. 15th Int. Conf. on Communicating Systems, TestCom\u20192003, Sophia, Antipolis, France, pp. 129\u2013145.","DOI":"10.1007\/3-540-44830-6_11"},{"key":"5001_CR24","doi-asserted-by":"crossref","unstructured":"Lestiennes, G. and Gaudel, M.-C., Test de Systemes Reactifs non Receptifs, J. Europ. des Systemes Automatises, Modelisation des Systemes Reactifs, 2005, pp. 255\u2013270.","DOI":"10.3166\/jesa.39.255-270"},{"issue":"10","key":"5001_CR25","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R., An Axiomatic Basis for Computer Programming, Commun. ACM, 1969, vol. 12, no. 10, pp. 576\u2013585.","journal-title":"Commun. ACM"},{"key":"5001_CR26","unstructured":"Blass, A., Gurevich, Y., Nachmanson, L., and Veanes, M., Play to Test Microsoft Research, Technical Report, 2005, no. MSR-TR-2005-04; 5th Int. Workshop on Formal Approaches to Testing of Software (FATES 2005), Edinburgh, 2005."},{"key":"5001_CR27","unstructured":"Fujiwara, S. and von Bochmann, G. Testing Nondeterministic Finite State Machine with Fault Coverage, Proc. IFIP TC6 Fourth Int. Workshop on Protocol Test Systems, 1991, Kroon, J., Heijink, R.J., and Brinksma E., Eds., North-Holland, 1992, pp. 267\u2013280."},{"key":"5001_CR28","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"},{"key":"5001_CR29","doi-asserted-by":"crossref","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Application of Finite Automatons for Program Testing, Programmirovanie, 2000, no. 2, pp. 12\u201328 [Programming Comput. Software (Engl. Transl.), 2000, vol. 26, no. 2, pp. 61\u201373].","DOI":"10.1007\/BF02759192"},{"key":"5001_CR30","doi-asserted-by":"crossref","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case, Programmirovanie, 2003, no. 5, pp. 11\u201330 [Programming Comput. Software (Engl. Transl.), 2003, vol. 29, no. 5, pp. 245\u2013258].","DOI":"10.1023\/A:1025733107700"},{"key":"5001_CR31","doi-asserted-by":"crossref","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case, Programmirovanie, 2004, no. 1, pp. 4\u201324 [Programming Comput. Software (Engl. Transl.), 2004, vol. 30, no. 1, pp. 2\u201317].","DOI":"10.1023\/B:PACS.0000013436.72070.95"},{"key":"5001_CR32","doi-asserted-by":"crossref","unstructured":"Kuliamin, V.V., Petrenko, A.K., Kossatchev, A.S., and Bourdonov, I.B., The UniTesK Approach to Designing Test Suites, Programmirovanie, 2003, no. 6, pp. 25\u201343 [Programming Comput. Software (Engl. Transl.), 2003, vol. 29, no. 6, pp. 310\u2013322].","DOI":"10.1023\/B:PACS.0000004131.54590.fb"},{"key":"5001_CR33","doi-asserted-by":"crossref","unstructured":"Kuliamin, V.V., Kossatchev, A.S., Petrenko, A.K., Pakoulin, N.V., and Bourdonov, I.B., Integration of Functional and Timed Testing of Real-Time and Concurrent Systems, in Perspectives of System Informatics, Lect. Notes Comput. Sci., 2003.","DOI":"10.1007\/978-3-540-39866-0_45"},{"key":"5001_CR34","first-page":"7","volume":"4","author":"I.B. Bourdonov","year":"2003","unstructured":"Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Asynchronous Automata: Classification and Testing, Tr. ISP RAN (Proceedings of Institute for System Programming, Russian Academy of Sciences), 2003, vol. 4, pp. 7\u201384.","journal-title":"Tr. ISP RAN"},{"key":"5001_CR35","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola, R. and Hennessy, M.C.B., Testing Equivalence for Processes, Theor. Comput. Sci., 1984, vol. 34, pp. 83\u2013133.","journal-title":"Theor. Comput. Sci."},{"key":"5001_CR36","unstructured":"Langerak, R. A., Testing Theory for LOTOS Using Deadlock Detection, in Protocol Specification, Testing, and Verification IX, Brinksma E., Scollo, G., and Vissers, C.A., Eds. North-Holland, 1990, pp. 87\u201398."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768807050015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768807050015","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768807050015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768807050015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:01:38Z","timestamp":1775008898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768807050015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["5001"],"URL":"https:\/\/doi.org\/10.1134\/s0361768807050015","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}