{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:31Z","timestamp":1740108331235,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T00:00:00Z","timestamp":1599609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004253","name":"Quaid-i-Azam University","doi-asserted-by":"publisher","award":["FNS \/16-1723"],"award-info":[{"award-number":["FNS \/16-1723"]}],"id":[{"id":"10.13039\/501100004253","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00236-020-00387-2","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T11:42:31Z","timestamp":1599738151000},"page":"611-651","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["DKL: an efficient algorithm for learning deterministic Kripke structures"],"prefix":"10.1007","volume":"58","author":[{"given":"Rabia","family":"Mazhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3411-9224","authenticated-orcid":false,"given":"Muddassar Azam","family":"Sindhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,9]]},"reference":[{"issue":"1","key":"387_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Inf. Control 51(1), 76\u201387 (1981)","journal-title":"Inf. Control"},{"issue":"1","key":"387_CR2","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(1), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"387_CR3","unstructured":"Bohlin, T., Jonsson, B.: Regular inference for communication protocol entities. In: Technical Report 2008-024, Dept. of Information Technology, Uppsala University (2008)"},{"issue":"5","key":"387_CR4","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"Edmund M Clarke","year":"2003","unstructured":"Clarke, Edmund M., Grumberg, Orna., Jha, Somesh., Yuan, Lu, Veith, Helmut: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"key":"387_CR5","doi-asserted-by":"crossref","unstructured":"Dupont, P.: Incremental regular inference. In: Proceedings of the Third ICGI-96, Number 1147 in LNAI (1996)","DOI":"10.1007\/BFb0033357"},{"key":"387_CR6","doi-asserted-by":"crossref","unstructured":"Feng, L., Lundmark, S., Meinke, K., Niu, F., Sindhu, M.\u00a0A., Wong, P.Y.H.: Case studies in learning-based testing. In: Yenig\u00fcn, H., Yilmaz, C., Ulrich, A. (eds.) Testing Software and Systems, pp. 164\u2013179. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-41707-8_11"},{"key":"387_CR7","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, 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"387_CR8","doi-asserted-by":"crossref","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.) Runtime Verification, pp. 307\u2013322. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-11164-3_26"},{"key":"387_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"387_CR10","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley, Boston (1997)","edition":"3"},{"key":"387_CR11","doi-asserted-by":"crossref","unstructured":"Luecker, M.: Learning meets verification. In: de\u00a0Boer, F.\u00a0S., et al. (eds.) FMCO, volume 4709 of Lecture Notes in Computer Science, pp. 127\u2013151. Springer (2006)","DOI":"10.1007\/978-3-540-74792-5_6"},{"key":"387_CR12","doi-asserted-by":"crossref","unstructured":"Meinke, K., Sindhu, M.A.: Incremental learning-based testing for reactive systems. In: Gogolla, M., Wolff, B. (eds.) Tests and Proofs, volume 6706 of Lecture Notes in Computer Science, pp. 134\u2013151. Springer (2011)","DOI":"10.1007\/978-3-642-21768-5_11"},{"key":"387_CR13","doi-asserted-by":"crossref","unstructured":"Meinke, K., Sindhu, M.\u00a0A.: Lbtest: A learning-based testing tool for reactive systems. In: 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation, pp. 447\u2013454 (2013)","DOI":"10.1109\/ICST.2013.62"},{"key":"387_CR14","doi-asserted-by":"crossref","unstructured":"Meinke, K.., Niu, F., Sindhu, M.A.: Learning-based software testing: a tutorial. In: Proc. Fourth Int. ISoLA workshop on Machine Learning for Software Construction, Number 336 in CCIS, pp. 200\u2013219. Springer (2012)","DOI":"10.1007\/978-3-642-34781-8_16"},{"key":"387_CR15","unstructured":"Norton, D.A.: Algorithms for testing equivalence of finite state automata, with a grading tool for jflap. Technical report, Rochester Institute of Technology, Department of Computer Science (2009)"},{"key":"387_CR16","unstructured":"Oliver Niese. An integrated approach to testing complex systems. PhD thesis (2003)"},{"key":"387_CR17","doi-asserted-by":"crossref","unstructured":"Parekh R.G., Nichitiu, C., Honavar, V.G.: A polynomial time incremental algorithm for regular grammar inference. In: Proc. Fourth Int. Colloq. on Grammatical Inference (ICGI 98), LNAI. Springer (1998)","DOI":"10.1007\/BFb0054062"},{"key":"387_CR18","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M.\u00a0Y., Yannakakis, M.: Black box checking. In: FORTE, pp. 225\u2013240 (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"387_CR19","first-page":"109","volume":"7","author":"Sara Porat","year":"1991","unstructured":"Porat, Sara, Feldman, Jerome A.: Learning automata from ordered examples. Mach. Learn. 7, 109\u2013138 (1991)","journal-title":"Mach. Learn."},{"key":"387_CR20","doi-asserted-by":"crossref","unstructured":"Raffelt, H., Steffen, B., Margaria, T.: Dynamic testing via automata learning. In: Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing, HVC\u201907, pp.136\u2013152, Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-77966-7_13"},{"key":"387_CR21","unstructured":"Sindhu, M.A., Meinke, K.: IDS: an incremental learning algorithm for finite automata. CoRR"},{"key":"387_CR22","unstructured":"Sindhu, M.: Algorithms and Tools for Learning-based Testing of Reactive Systems. PhD thesis, KTH, Theoretical Computer Science, TCS. QC 20130312 (2013)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-020-00387-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-020-00387-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-020-00387-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T03:41:08Z","timestamp":1634787668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-020-00387-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,9]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s00236-020-00387-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2020,9,9]]},"assertion":[{"value":"29 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}