{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:49:41Z","timestamp":1777099781620,"version":"3.51.4"},"reference-count":29,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","funder":[{"DOI":"10.13039\/100007655","name":"Vysok\u00e1 \u0161kola chemicko-technologick\u00e1 v Praze","doi-asserted-by":"publisher","award":["SGS20\/177\/OHK3\/3T\/13"],"award-info":[{"award-number":["SGS20\/177\/OHK3\/3T\/13"]}],"id":[{"id":"10.13039\/100007655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018240","name":"Research Center for Informatics, Czech Technical University in Prague","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"]}],"id":[{"id":"10.13039\/100018240","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Knowledge Foundation of Sweden","award":["20200067"],"award-info":[{"award-number":["20200067"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:p> Finite State Machine is a popular modeling notation for various systems, especially software and electronic. Test paths (TPs) can be automatically generated from the system model to test such systems using a suitable algorithm. This paper presents a strategy that generates TPs and allows to start and end TPs only in defined states of the finite state machine. The strategy also simultaneously supports generating TPs only of length in a given range. For this purpose, alternative system models, test coverage criteria, and a set of algorithms are developed. The strategy is compared with the best alternative based on the reduction of the test set generated by the established N-switch coverage approach on a mix of 171 industrial and artificially generated problem instances. The proposed strategy outperforms the compared variant in a smaller number of TP steps. The extent varies with the used test coverage criterion and preferred TP length range from none to two and half fold difference. Moreover, the proposed technique detected up to 30% more simple artificial defects inserted into experimental SUT models per one test step than the compared alternative technique. The proposed strategy is well applicable in situations where a possible TP starts and ends in a state machine needs to be reflected and, concurrently, the length of the TPs has to be in a defined range. <\/jats:p>","DOI":"10.1142\/s0218194022500474","type":"journal-article","created":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T01:02:08Z","timestamp":1658883728000},"page":"1247-1278","source":"Crossref","is-referenced-by-count":2,"title":["Novel Strategy Generating Variable-Length State Machine Test Paths"],"prefix":"10.1142","volume":"32","author":[{"given":"Vaclav","family":"Rechtberger","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo namesti 13, 121 35, Prague, Czechia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2994-7826","authenticated-orcid":false,"given":"Miroslav","family":"Bures","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo namesti 13, 121 35, Prague, Czechia"}]},{"given":"Bestoun S.","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Karlstad University, Universitetsgatan 2, 65188, Karlstad, Sweden"},{"name":"Department of Computer Science, FEE, Czech Technical University, Prague, Czech Republic"}]},{"given":"Hynek","family":"Schvach","sequence":"additional","affiliation":[{"name":"Faculty of Military Health Sciences, Department of Military Medical Service Organisation and Management, University of Defence, Trebesska 1575, 500 01, Hradec Kralove, Czechia"}]}],"member":"219","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"S0218194022500474BIB001","doi-asserted-by":"publisher","DOI":"10.1017\/9781316771273"},{"key":"S0218194022500474BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.456"},{"key":"S0218194022500474BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2019.07.001"},{"key":"S0218194022500474BIB004","first-page":"77","volume-title":"Int. Conf. Tools and Methods for Program Analysis","author":"Li W.","year":"2017"},{"key":"S0218194022500474BIB005","doi-asserted-by":"publisher","DOI":"10.1049\/iet-sen.2008.0018"},{"key":"S0218194022500474BIB006","volume-title":"The Economics of Software Quality","author":"Jones C.","year":"2011"},{"key":"S0218194022500474BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-009-0057-9"},{"key":"S0218194022500474BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2009.29"},{"key":"S0218194022500474BIB009","volume-title":"TMap NEXT: For Result-Driven Testing","author":"Vroon M.","year":"2013"},{"key":"S0218194022500474BIB010","doi-asserted-by":"publisher","DOI":"10.1201\/9780429184185"},{"key":"S0218194022500474BIB011","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568455"},{"key":"S0218194022500474BIB012","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"2006","edition":"3"},{"key":"S0218194022500474BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/ISADS.2013.6513433"},{"key":"S0218194022500474BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR.2014.111"},{"key":"S0218194022500474BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2004.1342735"},{"key":"S0218194022500474BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2009.30"},{"key":"S0218194022500474BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2010.135"},{"key":"S0218194022500474BIB018","doi-asserted-by":"publisher","DOI":"10.1145\/2647908.2655971"},{"key":"S0218194022500474BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2006.32"},{"key":"S0218194022500474BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2872774"},{"key":"S0218194022500474BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2010.21"},{"key":"S0218194022500474BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/QRS-C.2019.00044"},{"key":"S0218194022500474BIB024","doi-asserted-by":"publisher","DOI":"10.1109\/QRS-C.2018.00103"},{"key":"S0218194022500474BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2017.7960106"},{"key":"S0218194022500474BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2941429"},{"key":"S0218194022500474BIB027","doi-asserted-by":"publisher","DOI":"10.1109\/ICSESS.2018.8663746"},{"key":"S0218194022500474BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2017.221"},{"key":"S0218194022500474BIB029","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16486-1_78"},{"key":"S0218194022500474BIB030","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-4154-9_67"}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194022500474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T08:15:38Z","timestamp":1663748138000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218194022500474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":29,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10.1142\/S0218194022500474"],"URL":"https:\/\/doi.org\/10.1142\/s0218194022500474","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"value":"0218-1940","type":"print"},{"value":"1793-6403","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}