{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:07:07Z","timestamp":1745989627909},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Model-based testing overcomes challenges in software testing by generating automated test cases from behavior models, e.g. finite state machine (FSM) and input\/output transition system (IOTS). Despite the existence of methods for IOTSs, the problem of selection of test cases is an important and difficult topic. The current methods from IOTSs do not provide the same support offered by the existing theory for FSMs, as complete fault coverage. In this paper, we propose a test generation method for IOTSs based on the W method developed for FSMs. The basic idea is to generate a transition cover set and a characterization set and concatenate them to generate complete test suites for IOTSs in a bounded number of steps. The method generates test suites with complete fault coverage for a given fault domain and is targeted at a class of IOTSs, called mealy IOTS, which accepts inputs only in stable states. Results from a case study show the proposed algorithm can achieve better results than a classical method for IOTSs.<\/jats:p>","DOI":"10.1007\/s00165-015-0350-2","type":"journal-article","created":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T09:55:41Z","timestamp":1450432541000},"page":"65-78","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generation of complete test suites from mealy input\/output transition systems"],"prefix":"10.1145","volume":"28","author":[{"given":"Sofia Costa","family":"Paiva","sequence":"first","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e de Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo (USP), PO Box 668, S\u00e3o Carlos, S\u00e3o Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adenilso","family":"Simao","sequence":"additional","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e de Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo (USP), PO Box 668, S\u00e3o Carlos, S\u00e3o Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/11693017_24","volume-title":"Fundamental approaches to software engineering, vol 3922","author":"Aichernig B","year":"2006"},{"key":"e_1_2_1_2_2_2","first-page":"266","volume-title":"Tools and algorithms for the construction and analysis of systems, LNCS, vol 6015","author":"Belinfante A","year":"2010"},{"key":"e_1_2_1_2_3_2","unstructured":"Bensalem S Krichen M Tripakis S (2008) State Identification problems for input\/output transition systems. In: Proc. of 9th WODES\u2014intern. workshop on discrete event systems IEEE pp 225\u2013230"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1978.231496"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2010.07.001"},{"key":"e_1_2_1_2_6_2","first-page":"204","volume-title":"Lecture Notes in Computer Science, vol 3731","author":"Dorofeeva R","year":"2005"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"crossref","unstructured":"DiasNeto AC Travassos GH (2009) Model-based testing approaches selection for software projects. Inf Softw Technol 51(11):1487\u20131504. In: Third IEEE international workshop on automation of software test (AST 2008) eighth international conference on quality software (QSIC 2008)","DOI":"10.1016\/j.infsof.2009.06.010"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.87284"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","unstructured":"Fraser G Weiglhofer M Wotawa F (2008) Coverage based testing with test purposes. In: Proc. of Intern. Conf. on Quality Software pp 199\u2013208","DOI":"10.1109\/QSIC.2008.41"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-59293-8_188","volume-title":"TAPSOFT 95: theory and practice of software development, Lecture Notes in Computer Science, vol 915","author":"Gaudel M-C","year":"1995"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"crossref","unstructured":"Hierons RM Bogdanov K Bowen JP Cleaveland R Derrick J Dick J Gheorghe M Harman M Kapoor K Krause P L\u00fcttgen G Simons AJH Vilkomir S Woodward MR Zedan H (2009) Using formal specifications to support testing. ACM Comput Surv 41(2):9:1\u20139:76","DOI":"10.1145\/1459352.1459354"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.05.038"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"crossref","unstructured":"Hierons RM (2012) Implementation relations for testing through asynchronous channels. Comput J pp 107\u2013122","DOI":"10.1109\/COMPSACW.2012.83"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.396"},{"issue":"4","key":"e_1_2_1_2_15_2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10009-004-0153-x","article-title":"TGV: theory, principles and algorithms","volume":"7","author":"Jard C","year":"2005","journal-title":"Int J Softw Tools Technol Transf (STTT)"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"crossref","unstructured":"Luo G Petrenko A Bochmann GV (1995) Selecting test sequences for partially-specified nondeterministic finite state machines. In: 7th IFIP WG 6.1 international workshop on protocol test systems vol IWPTS \u201994 pp 95\u2013110. Chapman & Hall Ltd London","DOI":"10.1007\/978-0-387-34883-4_6"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.533956"},{"key":"e_1_2_1_2_18_2","first-page":"334","volume-title":"Software engineering and formal methods, Lecture Notes in Computer Science, vol 7041","author":"Noroozi N","year":"2011"},{"key":"e_1_2_1_2_19_2","unstructured":"Paiva SLC Sim\u00e3o A (2015) A systematic mapping study on test generation from input\/output transition systems. In: Software Engineering and Advanced Applications (SEAA) 2015 41th EUROMICRO Conference on IEEE"},{"key":"e_1_2_1_2_20_2","unstructured":"Petrenko A Yevtushenko N (2002) Queued testing of transition systems with inputs and outputs. In: Hierons R Jeron T (eds) Proc. of workshop on formal approaches to testing of softw. FATES\u201902 CONCUR\u201902"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.152"},{"key":"e_1_2_1_2_22_2","first-page":"609","volume-title":"Testing of communicating systems, Lecture Notes in Computer Science, vol 2644","author":"Petrenko A","year":"2003"},{"issue":"9","key":"e_1_2_1_2_23_2","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1093\/comjnl\/bxp073","article-title":"Fault coverage-driven incremental test generation","volume":"53","author":"Sim\u00e3o A","year":"2009","journal-title":"Comput J"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.17"},{"key":"e_1_2_1_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2011.06.006"},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"crossref","unstructured":"Sim\u00e3o A Petrenko A (2014) Generating complete and finite test suite for ioco: is it possible? In: Schlingloff H Petrenko AK (eds) Proc. of 9th workshop on model-based testing France Electronic Proc. in Theoretical Computer Science vol 141. Open Publishing Association pp 56\u201370","DOI":"10.4204\/EPTCS.141.5"},{"key":"e_1_2_1_2_27_2","unstructured":"Spero SE (2007) SCP\u2014session control protocol V 1.1. IBIBLIO Public Library. http:\/\/www.ibiblio.org\/ses\/scp.html"},{"key":"e_1_2_1_2_28_2","unstructured":"Tretmans J Brinksma H (2003) TorX: automated model-based testing. In: Hartman A Dussa-Ziegler K (eds) 1st Europ. Conf. on Model-Driven Softw. Engg. pp 31\u201343"},{"issue":"3","key":"e_1_2_1_2_29_2","first-page":"103","article-title":"Test generation with inputs, outputs and repetitive quiescence","volume":"17","author":"Tretmans J","year":"1996","journal-title":"Softw Concepts Tools"},{"key":"e_1_2_1_2_30_2","doi-asserted-by":"crossref","unstructured":"Tretmans J (2008) Model based testing with labelled transition systems. In: Formal methods and testing\u2014LNCS vol 4949 pp 1\u201338","DOI":"10.1007\/978-3-540-78917-8_1"},{"key":"e_1_2_1_2_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.456"},{"key":"e_1_2_1_2_32_2","first-page":"173","volume-title":"Model-based testing of reactive systems, Lecture Notes in Computer Science, vol 3472","author":"van der Bijl M","year":"2005"},{"key":"e_1_2_1_2_33_2","first-page":"1102","volume-title":"Formal Approaches to software testing, Lecture Notes in Computer Science, vol 2931","author":"Vander Bijl M","year":"2004"},{"key":"e_1_2_1_2_34_2","first-page":"181","volume-title":"Unifying theories of programming, Lecture Notes in Computer Science, vol 5713","author":"Weiglhofer M","year":"2010"},{"key":"e_1_2_1_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2009.06.008"},{"key":"e_1_2_1_2_36_2","doi-asserted-by":"crossref","unstructured":"Weiglhofer M Wotawa F (2009) Asynchronous input-output conformance testing. In: Computer software and applications conference 2009. COMPSAC \u201909. 33rd Annual IEEE. International vol 1 pp 154\u2013159","DOI":"10.1109\/COMPSAC.2009.194"},{"issue":"4","key":"e_1_2_1_2_37_2","first-page":"50","article-title":"Synthesis of test experiments in some classes of automata","volume":"24","author":"Yevtushenko N","year":"1990","journal-title":"Autom Control Comput Sci"},{"key":"e_1_2_1_2_38_2","unstructured":"Zurowska K Dingel J (2010) Model-based generation of test cases for reactive systems. Techn. Report 2010- 573 School of Computing\/Queen\u2019s University"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-015-0350-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-015-0350-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-015-0350-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T06:15:07Z","timestamp":1692166507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-015-0350-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1007\/s00165-015-0350-2"],"URL":"https:\/\/doi.org\/10.1007\/s00165-015-0350-2","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}