{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:52:25Z","timestamp":1771703545731,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030024499","type":"print"},{"value":"9783030024505","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-02450-5_22","type":"book-chapter","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T08:54:57Z","timestamp":1539161697000},"page":"373-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Formalising Extended Finite State Machine Transition Merging"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8233-9873","authenticated-orcid":false,"given":"Michael","family":"Foster","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4036-7590","authenticated-orcid":false,"given":"Ramsay G.","family":"Taylor","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6355-1200","authenticated-orcid":false,"given":"Achim D.","family":"Brucker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6631-8914","authenticated-orcid":false,"given":"John","family":"Derrick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75, 87\u2013106 (1987). \nhttps:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"issue":"6","key":"22_CR2","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"C-21","author":"A. W. Biermann","year":"1972","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. C-21(6), 592\u2013597 (1972). \nhttps:\/\/doi.org\/10.1109\/TC.1972.5009015","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18216-7","volume-title":"Abstract State Machines","author":"E B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E., St\u00e4rk, R.: Abstract State Machines. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-642-18216-7"},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Cheng, K.T., Krishnakumar, A.S.: Automatic functional test generation using the extended finite state machine model. In: International Design Automation Conference (DAC), pp. 86\u201391. ACM Press, New York (1993). \nhttps:\/\/doi.org\/10.1145\/157485.164585","DOI":"10.1145\/157485.164585"},{"issue":"12","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/TSE.2005.138","volume":"31","author":"C Damas","year":"2005","unstructured":"Damas, C., Lambeau, B., Dupont, P., Van Lamsweerde, A.: Generating annotated behavior models from end-user scenarios. IEEE Trans. Softw. Eng. 31(12), 1056\u20131073 (2005). \nhttps:\/\/doi.org\/10.1109\/TSE.2005.138","journal-title":"IEEE Trans. Softw. Eng."},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5355-9","volume-title":"Refinement in Z and Object-Z","author":"J Derrick","year":"2014","unstructured":"Derrick, J., Boiten, E.A.: Refinement in Z and Object-Z, 2nd edn. Springer, London (2014). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5355-9","edition":"2"},{"issue":"1\u20132","key":"22_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/08839510701853200","volume":"22","author":"P Dupont","year":"2008","unstructured":"Dupont, P., Lambeau, B., Damas, C., Van Lamsweerde, A.: The QSM algorithm and its application to software behavior model induction. Appl. Artif. Intell. 22(1\u20132), 77\u2013115 (2008). \nhttps:\/\/doi.org\/10.1080\/08839510701853200","journal-title":"Appl. Artif. Intell."},{"key":"22_CR8","volume-title":"Automata, Languages, and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press Inc., Orlando (1974)"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/32.908957","volume":"27","author":"MD Ernst","year":"2001","unstructured":"Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. IEEE Trans. Softw. Eng. 27(2), 99\u2013123 (2001). \nhttps:\/\/doi.org\/10.1109\/32.908957","journal-title":"IEEE Trans. Softw. Eng."},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Fraser, G., Walkinshaw, N.: Behaviourally adequate software testing. In: International Conference on Software Testing, Verification and Validation, pp. 300\u2013309, April 2012. \nhttps:\/\/doi.org\/10.1109\/ICST.2012.110","DOI":"10.1109\/ICST.2012.110"},{"issue":"5","key":"22_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"KJ Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 1\u201312. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0054059"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Lorenzoli, D., Mariani, L., Pezz\u00e8, M.: Inferring state-based behavior models. In: International Workshop on Dynamic Systems Analysis (WODA), p. 25. ACM Press, New York (2006). \nhttps:\/\/doi.org\/10.1145\/1138912.1138919","DOI":"10.1145\/1138912.1138919"},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Lorenzoli, D., Mariani, L., Pezz\u00e8, M.: Automatic generation of software behavioral models. In: International Conference on Software Engineering (ICSE), p. 501. ACM Press, New York (2008). \nhttps:\/\/doi.org\/10.1145\/1368088.1368157","DOI":"10.1145\/1368088.1368157"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45949-9"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TSE.2004.1265734","volume":"30","author":"A Petrenko","year":"2004","unstructured":"Petrenko, A., Boroday, S., Groz, R.: Confirming configurations in EFSM testing. IEEE Trans. Softw. Eng. 30(1), 29\u201342 (2004). \nhttps:\/\/doi.org\/10.1109\/TSE.2004.1265734","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10664-012-9210-3","volume":"18","author":"N Walkinshaw","year":"2013","unstructured":"Walkinshaw, N., Lambeau, B., Damas, C., Bogdanov, K., Dupont, P.: STAMINA: a competition to encourage the development and assessment of software model inference techniques. Empir. Softw. Eng. 18(4), 791\u2013824 (2013). \nhttps:\/\/doi.org\/10.1007\/s10664-012-9210-3","journal-title":"Empir. Softw. Eng."},{"issue":"3","key":"22_CR19","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10664-015-9367-7","volume":"21","author":"N Walkinshaw","year":"2016","unstructured":"Walkinshaw, N., Taylor, R., Derrick, J.: Inferring extended finite state machine models from software executions. Empir. Softw. Eng. 21(3), 811\u2013853 (2016). \nhttps:\/\/doi.org\/10.1007\/s10664-015-9367-7","journal-title":"Empir. Softw. Eng."},{"issue":"4","key":"22_CR20","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1145\/69575.357231","volume":"5","author":"EJ Weyuker","year":"1983","unstructured":"Weyuker, E.J.: Assessing test data adequacy through program inference. ACM Trans. Program. Lang. Syst. 5(4), 641\u2013655 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02450-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T09:10:01Z","timestamp":1539162601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02450-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030024499","9783030024505"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02450-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.formal-analysis.com\/icfem\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"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"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}