{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:51:33Z","timestamp":1743108693852,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030409135"},{"type":"electronic","value":"9783030409142"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-40914-2_4","type":"book-chapter","created":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T21:03:52Z","timestamp":1581541432000},"page":"72-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing Characterizing Sets"],"prefix":"10.1007","author":[{"given":"Kadir","family":"Bulut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6067-6545","authenticated-orcid":false,"given":"Guy Vincent","family":"Jourdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5976-1945","authenticated-orcid":false,"given":"Uraz Cengiz","family":"T\u00fcrker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,13]]},"reference":[{"key":"4_CR1","unstructured":"Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.U.: An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. In: Protocol Specification, Testing, and Verification, North-Holland, Atlantic City, vol. VIII, pp. 75\u201386. Elsevier (1988)"},{"key":"4_CR2","unstructured":"Aho, A., Sethi, R., Ullman, J.: Compilers, Principles, Techniques, and Tools. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company (1986)"},{"key":"4_CR3","unstructured":"Betin-Can, A., Bultan, T.: Verifiable concurrent programming using concurrency controllers. In: Proceedings of the 19th IEEE International Conference on Automated Software Engineering, pp. 248\u2013257. IEEE Computer Society (2004)"},{"key":"4_CR4","unstructured":"Binder, R.V.: Testing Object-Oriented Systems: Models, Patterns, and Tools. Addison-Wesley (1999)"},{"key":"4_CR5","unstructured":"Brglez, F.: ACM\/SIGMOD benchmark dataset. http:\/\/www.cbl.ncsu.edu\/benchmarks\/Benchmarks-upto-1996.html (1996). Accessed 12 Feb 2014"},{"key":"4_CR6","unstructured":"Brinksma, E.: A theory for the derivation of tests. In: Proceedings of Protocol Specification, Testing, and Verification, North-Holland, Atlantic City, vol. VIII, pp. 63\u201374 (1988)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"TS Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modelled by finite state machines. IEEE Trans. Softw. Eng. 4, 178\u2013187 (1978)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"8","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/5.58319","volume":"78","author":"A Dahbura","year":"1990","unstructured":"Dahbura, A., Sabnani, K., Uyar, M.: Formal methods for generating protocol conformance test sequences. Proc. IEEE 78(8), 1317\u20131326 (1990). https:\/\/doi.org\/10.1109\/5.58319","journal-title":"Proc. IEEE"},{"issue":"12","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1016\/j.infsof.2010.07.001","volume":"52","author":"R Dorofeeva","year":"2010","unstructured":"Dorofeeva, R., El-Fakih, K., Maag, S., Cavalli, A.R., Yevtushenko, N.: FSM-based conformance testing methods: a survey annotated with experimental evaluation. Inf. Softw. Technol. 52(12), 1286\u20131297 (2010)","journal-title":"Inf. Softw. Technol."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11562436_16","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"R Dorofeeva","year":"2005","unstructured":"Dorofeeva, R., El-Fakih, K., Yevtushenko, N.: An improved conformance testing method. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 204\u2013218. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562436_16"},{"key":"4_CR11","unstructured":"Friedman, A., Menon, P.: Fault Detection in Digital Circuits. Computer Applications in Electrical Engineering Series. Prentice-Hall (1971)"},{"key":"4_CR12","unstructured":"Friedman, A.D., Menon, P.R. (eds.): Fault Detection in Digital Circuits. Prentice-Hall Englewood Cliffs, N.J (1971)"},{"issue":"6","key":"4_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/32.87284","volume":"17","author":"S Fujiwara","year":"1991","unstructured":"Fujiwara, S., Bochmann, G.V., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. Softw. Eng. 17(6), 591\u2013603 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"4_CR14","volume-title":"Introduction to the Theory of Finite State Machines","author":"A Gill","year":"1962","unstructured":"Gill, A.: Introduction to the Theory of Finite State Machines. McGraw-Hill, New York (1962)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/T-C.1970.222975","volume":"19","author":"G Gonenc","year":"1970","unstructured":"Gonenc, G.: A method for the design of fault detection experiments. IEEE Trans. Comput. 19, 551\u2013558 (1970)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/stvr.427","volume":"21","author":"W Grieskamp","year":"2011","unstructured":"Grieskamp, W., Kicillof, N., Stobie, K., Braberman, V.A.: Model-based quality assurance of protocol documentation: tools and methodology. Softw. Test. Verif. Reliab. 21(1), 55\u201371 (2011). https:\/\/doi.org\/10.1002\/stvr.427","journal-title":"Softw. Test. Verif. Reliab."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-1-4471-2155-8_62","volume-title":"Computer and Information Sciences II","author":"C G\u00fcni\u00e7en","year":"2011","unstructured":"G\u00fcni\u00e7en, C., T\u00fcrker, U.C., Ural, H., Yenig\u00fcn, H.: Generating preset distinguishing sequences using SAT. In: Gelenbe, E., Lent, R., Sakellari, G. (eds.) Computer and Information Sciences II, pp. 487\u2013493. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-1-4471-2155-8_62"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-30232-2_8","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"M Haydar","year":"2004","unstructured":"Haydar, M., Petrenko, A., Sahraoui, H.: Formal verification of web applications modeled by communicating automata. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 115\u2013132. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30232-2_8"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Hennie, F.C.: Fault-detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pp. 95\u2013110. Princeton, New Jersey, November 1964","DOI":"10.1109\/SWCT.1964.8"},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ipl.2004.03.003","volume":"90","author":"RM Hierons","year":"2004","unstructured":"Hierons, R.M.: Minimizing the number of resets when testing from a finite state machine. Inf. Process. Lett. 90(6), 287\u2013292 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"4_CR21","doi-asserted-by":"publisher","first-page":"3370","DOI":"10.1109\/TC.2016.2532869","volume":"65","author":"RM Hierons","year":"2016","unstructured":"Hierons, R.M., T\u00fcrker, U.C.: Parallel algorithms for generating harmonised state identifiers and characterising sets. IEEE Trans. Comput. 65(11), 3370\u20133383 (2016). https:\/\/doi.org\/10.1109\/TC.2016.2532869","journal-title":"IEEE Trans. Comput."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The theory of Machines and Computation, pp. 189\u2013196. Academic Press (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/T-C.1971.223100","volume":"20","author":"EP Hsieh","year":"1971","unstructured":"Hsieh, E.P.: Checking experiments for sequential machines. IEEE Trans. Comput. 20, 1152\u20131166 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR24","volume-title":"Switching and Finite State Automata Theory","author":"Z Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and Finite State Automata Theory. McGraw-Hill, New York (1978)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Koufareva, I., Dorofeeva, M.: A novel modification of w-method. Joint Bull. Novosibirsk Comput. 69\u201381 (2002)","DOI":"10.1016\/S1297-319X(01)00347-5"},{"issue":"5","key":"4_CR26","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/26.494307","volume":"44","author":"D Lee","year":"1996","unstructured":"Lee, D., Sabnani, K., Kristol, D., Paul, S.: Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach. IEEE Trans. Commun. 44(5), 631\u2013640 (1996). https:\/\/doi.org\/10.1109\/26.494307","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/12.272431","volume":"43","author":"D Lee","year":"1994","unstructured":"Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite-state machines - a survey. Proc. IEEE 84(8), 1089\u20131123 (1996)","journal-title":"Proc. IEEE"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Low, S.: Probabilistic conformance testing of protocols with unobservable transitions. In: 1993 International Conference on Network Protocols, pp. 368\u2013375 (Oct). https:\/\/doi.org\/10.1109\/ICNP.1993.340890","DOI":"10.1109\/ICNP.1993.340890"},{"key":"4_CR30","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-0-387-34883-4_6","volume-title":"Protocol Test Systems","author":"G Luo","year":"1995","unstructured":"Luo, G., Petrenko, A., v. Bochmann, G.: Selecting test sequences for partially-specified nondeterministic finite state machines. In: Mizuno, T., Higashino, T., Shiratori, N. (eds.) Protocol Test Systems. ITIFIP, pp. 95\u2013110. Springer, Boston, MA (1995). https:\/\/doi.org\/10.1007\/978-0-387-34883-4_6"},{"key":"4_CR31","unstructured":"Petrenko, A., Bochmann, G.V., Dssouli, R.: Conformance relations and test derivation. In: Proceedings of Protocol Test Systems VI (C-19), pp. 157\u2013178 (1993)"},{"issue":"9","key":"4_CR32","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1109\/TC.2005.152","volume":"54","author":"A Petrenko","year":"2005","unstructured":"Petrenko, A., Yevtushenko, N.: Testing from partial deterministic FSM specifications. IEEE Trans. Comput. 54(9), 1154\u20131165 (2005)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"4_CR33","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/12.599899","volume":"46","author":"I Pomeranz","year":"1997","unstructured":"Pomeranz, I., Reddy, S.M.: Test generation for multiple state-table faults in finite-state machines. IEEE Trans. Comput. 46(7), 783\u2013794 (1997)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"4_CR34","first-page":"285","volume":"15","author":"K Sabnani","year":"1988","unstructured":"Sabnani, K., Dahbura, A.: A protocol test generation procedure. Comput. Netw. 15(4), 285\u2013297 (1988)","journal-title":"Comput. Netw."},{"issue":"4","key":"4_CR35","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/32.16602","volume":"15","author":"DP Sidhu","year":"1989","unstructured":"Sidhu, D.P., Leung, T.K.: Formal methods for protocol testing: a detailed study. IEEE Trans. Software Eng. 15(4), 413\u2013426 (1989)","journal-title":"IEEE Trans. Software Eng."},{"key":"4_CR36","unstructured":"Teetor, P.: R Cookbook, 1st edn. O\u2019Reilly (2011). http:\/\/oreilly.com\/catalog\/9780596809157"},{"issue":"3","key":"4_CR37","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/90.234857","volume":"1","author":"H Ural","year":"1993","unstructured":"Ural, H., Zhu, K.: Optimal length test sequence generation using distinguishing sequences. IEEE\/ACM Trans. Netw. 1(3), 358\u2013371 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"4_CR38","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0140-3664(92)90092-S","volume":"15","author":"H Ural","year":"1992","unstructured":"Ural, H.: Formal methods for test sequence generation. Comput. Commun. 15(5), 311\u2013325 (1992). https:\/\/doi.org\/10.1016\/0140-3664(92)90092-S","journal-title":"Comput. Commun."},{"issue":"5","key":"4_CR39","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/stvr.456","volume":"22","author":"M Utting","year":"2012","unstructured":"Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Softw. Test. Verif. Reliab. 22(5), 297\u2013312 (2012)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"4_CR40","first-page":"653","volume":"4","author":"MP Vasilevskii","year":"1973","unstructured":"Vasilevskii, M.P.: Failure diagnosis of automata. Cybernetics 4, 653\u2013665 (1973)","journal-title":"Cybernetics"},{"key":"4_CR41","unstructured":"Vuong, S.T., Chan, W.W.L., Ito, M.R.: The UIOv-method for protocol test sequence generation. In: The 2nd International Workshop on Protocol Test Systems, Berlin (1989)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40914-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T11:11:07Z","timestamp":1665832267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-40914-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030409135","9783030409142"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40914-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FACS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Aspects of Component Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"facs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/facs2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 other accepted papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}