{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:37:43Z","timestamp":1732034263065},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_18","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T16:47:02Z","timestamp":1346518022000},"page":"240-255","source":"Crossref","is-referenced-by-count":9,"title":["A Theory of History Dependent Abstractions for Learning Interface Automata"],"prefix":"10.1007","author":[{"given":"Fides","family":"Aarts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faranak","family":"Heidarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata Learning through Counterexample-Guided Abstraction Refinement. In: Proc. FM 2012. LNCS. Springer (to appear, 2012)","key":"18_CR1"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-16573-3_14","volume-title":"Testing Software and Systems","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Jonsson, B., Uijen, J.: Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 188\u2013204. Springer, Heidelberg (2010)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-16558-0_54","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Schmaltz, J., Vaandrager, F.: Inference and Abstraction of the Biometric Passport. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol.\u00a06415, pp. 673\u2013686. Springer, Heidelberg (2010)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-15375-4_6","volume-title":"CONCUR 2010 - Concurrency Theory","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Vaandrager, F.: Learning I\/O Automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 71\u201385. Springer, Heidelberg (2010)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating Refinement Relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"issue":"2","key":"18_CR6","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.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., van Beek, D.A., Luttik, B., Markovski, J., Rooda, J.E.: A process-theoretic approach to supervisory control theory. In: ACC 2011, pp. 4496\u20134501(2011)","key":"18_CR7","DOI":"10.1109\/ACC.2011.5990831"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Global renaming operators in concrete process algebra. Information and Computation\u00a078(3), 205\u2013245 (1988)","journal-title":"Information and Computation"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-31984-9_14","volume-title":"Fundamental Approaches to Software Engineering","author":"T. Berg","year":"2005","unstructured":"Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the Correspondence Between Conformance Testing and Regular Inference. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 175\u2013189. Springer, Heidelberg (2005)"},{"unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland (2001)","key":"18_CR10"},{"doi-asserted-by":"crossref","unstructured":"Cho, C.Y., Babic, D., Shin, E.C.R., Song, D.: Inference and analysis of formal models of botnet command and control protocols. In: ACM Conference on Computer and Communications Security, pp. 426\u2013439. ACM (2010)","key":"18_CR11","DOI":"10.1145\/1866307.1866355"},{"doi-asserted-by":"crossref","unstructured":"Comparetti, P., Wondracek, G., Kr\u00fcgel, C., Kirda, E.: Prospex: Protocol specification extraction. In: IEEE Symposium on Security and Privacy, pp. 110\u2013125. IEEE (2009)","key":"18_CR12","DOI":"10.1109\/SP.2009.14"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. POPL, pp. 238\u2013252 (1977)","key":"18_CR13","DOI":"10.1145\/512950.512973"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"19","author":"D. Dams","year":"1997","unstructured":"Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM TOPLS\u00a019(2), 253\u2013291 (1997)","journal-title":"ACM TOPLS"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/503271.503226","volume":"26","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. SIGSOFT Softw. Eng. Notes\u00a026, 109\u2013120 (2001)","journal-title":"SIGSOFT Softw. Eng. Notes"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/990010.990013","volume":"12","author":"G. Ferrari","year":"2003","unstructured":"Ferrari, G., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM TOSEM\u00a012(4), 440\u2013473 (2003)","journal-title":"ACM TOSEM"},{"doi-asserted-by":"crossref","unstructured":"de la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press (April 2010)","key":"18_CR17","DOI":"10.1017\/CBO9781139194655"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-642-16558-0_55","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Howar","year":"2010","unstructured":"Howar, F., Steffen, B., Merten, M.: From ZULU to RERS. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol.\u00a06415, pp. 687\u2013704. Springer, Heidelberg (2010)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18275-4_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M.: Automata Learning with Automated Alphabet Abstraction Refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 263\u2013277. Springer, Heidelberg (2011)"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Computer Aided Verification","author":"H. Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-Specific Optimization in Automata Learning. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 315\u2013327. Springer, Heidelberg (2003)"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10009-004-0153-x","volume":"7","author":"C. Jard","year":"2005","unstructured":"Jard, C., J\u00e9ron, T.: TGV: theory, principles and algorithms. STTT\u00a07(4), 297\u2013315 (2005)","journal-title":"STTT"},{"unstructured":"Lamport, L.: Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley Longman Publishing Co., Inc. (2002)","key":"18_CR22"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-74792-5_6","volume-title":"Formal Methods for Components and Objects","author":"M. Leucker","year":"2007","unstructured":"Leucker, M.: Learning Meets Verification. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol.\u00a04709, pp. 127\u2013151. Springer, Heidelberg (2007)"},{"issue":"1","key":"18_CR24","first-page":"11","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Boujjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. FMSD\u00a06(1), 11\u201344 (1995)","journal-title":"FMSD"},{"issue":"3","key":"18_CR25","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch, N., Tuttle, M.: An introduction to input\/output automata. CWI Quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N. Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations, I: Untimed systems. Inf. Comput.\u00a0121(2), 214\u2013233 (1995)","journal-title":"Inf. Comput."},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-19835-9_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Merten","year":"2011","unstructured":"Merten, M., Steffen, B., Howar, F., Margaria, T.: Next Generation LearnLib. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 220\u2013223. Springer, Heidelberg (2011)"},{"unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall (1989)","key":"18_CR28"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-60218-6_4","volume-title":"CONCUR \u201995 Concurrency Theory","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Checking Bisimilarity for Finitary Pi-Calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 42\u201356. Springer, Heidelberg (1995)"},{"issue":"5","key":"18_CR30","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10009-009-0111-8","volume":"11","author":"H. Raffelt","year":"2009","unstructured":"Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: a framework for extrapolating behavioral models. STTT\u00a011(5), 393\u2013407 (2009)","journal-title":"STTT"},{"doi-asserted-by":"crossref","unstructured":"Rivest, R., Schapire, R.: Inference of finite automata using homing sequences. In: Proc. STOC, pp. 411\u2013420. ACM (1989)","key":"18_CR31","DOI":"10.1145\/73007.73047"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-40911-4_20","volume-title":"Integrated Formal Methods","author":"V. Rusu","year":"2000","unstructured":"Rusu, V., du Bousquet, L., J\u00e9ron, T.: An Approach to Symbolic Test Generation. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol.\u00a01945, pp. 338\u2013357. Springer, Heidelberg (2000)"},{"key":"18_CR33","first-page":"103","volume":"17","author":"J. Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs, and repetitive quiescence. Software\u2013Concepts and Tools\u00a017, 103\u2013120 (1996)","journal-title":"Software\u2013Concepts and Tools"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78917-8_1","volume-title":"Formal Methods and Testing","author":"J. Tretmans","year":"2008","unstructured":"Tretmans, J.: Model Based Testing with Labelled Transition Systems. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) FORTEST 2008. LNCS, vol.\u00a04949, pp. 1\u201338. Springer, Heidelberg (2008)"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-03466-4_21","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"M. Veanes","year":"2009","unstructured":"Veanes, M., Bj\u00f8rner, N.: Input-Output Model Programs. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 322\u2013335. Springer, Heidelberg (2009)"},{"unstructured":"de Vries, R.G., Tretmans, J.: Towards Formal Test Purposes. In: FATES 2001, BRICS Notes NS-01-4, pp. 61\u201376. Univ. Aarhus (2001)","key":"18_CR36"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:49:33Z","timestamp":1620114573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}