{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:31Z","timestamp":1760079331469},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747918"},{"type":"electronic","value":"9783540747925"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74792-5_6","type":"book-chapter","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T12:32:45Z","timestamp":1201609965000},"page":"127-151","source":"Crossref","is-referenced-by-count":23,"title":["Learning Meets Verification"],"prefix":"10.1007","author":[{"given":"Martin","family":"Leucker","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-540-45069-6_25","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., d\u2019Orso, J.: Algorithmic improvements in regular model checking. In: Hunt, Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 236\u2013248. Springer, Heidelberg (2003)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 35\u201348. Springer, Heidelberg (2004)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/1040305.1040314","volume-title":"POPL","author":"R. Alur","year":"2005","unstructured":"Alur, R., Cern\u00fd, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for java classes. In: Palsberg, J., Abadi, M. (eds.) POPL, pp. 98\u2013109. ACM Press, New York (2005)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/11513988_52","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2005","unstructured":"Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 548\u2013562. Springer, Heidelberg (2005)"},{"issue":"2","key":"6_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. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"K.R. Apt","year":"1986","unstructured":"Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett.\u00a022(6), 307\u2013309 (1986)","journal-title":"Inf. Process. Lett."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-1-4613-3394-4_2","volume-title":"Advances in Algorithms, Languages, and Complexity","author":"J.L. Balc\u00e1zar","year":"1997","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gavald\u00e1, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53\u201372. Kluwer, Dordrecht (1997)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","first-page":"27","volume-title":"Fundamental Approaches to Software Engineering","year":"2006","unstructured":"Baresi, L., Heckel, R. (eds.): FASE 2006 and ETAPS 2006. LNCS, vol.\u00a03922, pp. 27\u201328. Springer, Heidelberg (2006)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Berg, T., Jonsson, B., Leucker, M., Saksena, M.: Insights to Angluin\u2019s learning. In: Proceedings of the International Workshop on Software Verification and Validation (SVV 2003). Electronic Notes in Theoretical Computer Science, vol. 118, pp. 3\u201318 (December 2003)","DOI":"10.1016\/j.entcs.2004.12.015"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi and Heckel [9], pp. 107\u2013121","DOI":"10.1007\/11693017_10"},{"key":"6_CR13","unstructured":"Berg, T., Raffelt, H.: Model checking. In: Broy et\u00a0al. [16]"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"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 behaviour. IEEE Transactions on Computers\u00a021, 592\u2013597 (1972)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"ETAPS 2007 and TACAS 2007","author":"B. Bollig","year":"2007","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Replaying play in and play out: Synthesis of design models from scenarios by learning. In: Grumberg, O., Huth, M. (eds.) ETAPS 2007 and TACAS 2007. LNCS, vol.\u00a04424, Springer, Heidelberg (2007)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Model-Based Testing of Reactive Systems","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472. Springer, Heidelberg (2005)"},{"key":"6_CR17","first-page":"688","volume-title":"Proceedings of the 22nd ACM\/IEEE Design Automation Conference","author":"R.E. Bryant","year":"1985","unstructured":"Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: Proceedings of the 22nd ACM\/IEEE Design Automation Conference, pp. 688\u2013694. IEEE Computer Society Press, Los Alamitos, CA (1985)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1007\/11513988_51","volume-title":"Computer Aided Verification","author":"S. Chaki","year":"2005","unstructured":"Chaki, S., Clarke, E.M., Sinha, N., Thati, P.: Automated assume-guarrantee reasoning for simulation conformance. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 534\u2013547. Springer, Heidelberg (2005)"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"T.S. Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering\u00a04(3), 178\u2013187 (1978) (Special collection based on COMPSAC)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"2002","unstructured":"Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, Springer, Heidelberg (2002)"},{"key":"6_CR21","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge, Massachusetts (1999)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/978-3-540-28644-8_18","volume-title":"CONCUR 2004 - Concurrency Theory","author":"E.M. Clarke","year":"2004","unstructured":"Clarke, E.M., Talupur, M., Touili, T., Veith, H.: Verification by network decomposition. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 276\u2013291. Springer, Heidelberg (2004)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11609773_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E.M. Clarke","year":"2005","unstructured":"Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 126\u2013141. Springer, Heidelberg (2005)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.M. Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/11901433_29","volume-title":"Formal Methods and Software Engineering","author":"A. Dimovski","year":"2006","unstructured":"Dimovski, A., Lazic, R.: Assume-guarantee software verification based on game semantics. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol.\u00a04260, pp. 529\u2013548. Springer, Heidelberg (2006)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-45007-6_22","volume-title":"Developments in Language Theory","author":"F. Drewes","year":"2003","unstructured":"Drewes, F., H\u00f6gberg, J.: Learning a regular tree language from a teacher. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 279\u2013291. Springer, Heidelberg (2003)"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1142\/S0129054103001923","volume":"14","author":"D. D\u2019Souza","year":"2003","unstructured":"D\u2019Souza, D.: A logical characterisation of event clock automata. International Journal of Foundations of Computer Science (IJFCS)\u00a014(4), 625\u2013639 (2003)","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"CADE 2000","author":"E. Emerson","year":"2000","unstructured":"Emerson, E., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Emerson, E., Namjoshi, K.: Reasoning about rings. In: Proc. 22th ACM Symp. on Principles of Programming Languages (1995)","DOI":"10.1145\/199448.199468"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"3","key":"6_CR31","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"6_CR32","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"6th International Workshop on Verification of Infinite-State Systems","author":"O. Grinchtein","year":"2004","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Inference of timed transition systems. In: 6th International Workshop on Verification of Infinite-State Systems. Electronic Notes in Theoretical Computer Science, vol.\u00a0138\/4, Elsevier Science Publishers, Amsterdam (2004)"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O. Grinchtein","year":"2004","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, Springer, Heidelberg (2004)"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11817949_29","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"O. Grinchtein","year":"2006","unstructured":"Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 435\u2013449. Springer, Heidelberg (2006)"},{"key":"6_CR35","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_40","volume-title":"Automated Reasoning","author":"O. Grinchtein","year":"2006","unstructured":"Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, Springer, Heidelberg (2006)"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-46002-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Groce","year":"2002","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, p. 357. Springer, Heidelberg (2002)"},{"issue":"3","key":"6_CR37","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.entcs.2005.01.044","volume":"138","author":"P. Habermehl","year":"2005","unstructured":"Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. Electr. Notes Theor. Comput. Sci.\u00a0138(3), 21\u201336 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Proc. 15th Int. Conf. on Computer Aided Verification (2003)","DOI":"10.1007\/978-3-540-45069-6_31"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46419-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Jonsson","year":"2000","unstructured":"Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Schwartzbach, M.I., Graf, S. (eds.) ETAPS 2000 and TACAS 2000. LNCS, vol.\u00a01785, Springer, Heidelberg (2000)"},{"issue":"1","key":"6_CR40","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ic.2005.01.006","volume":"200","author":"Y. Kesten","year":"2005","unstructured":"Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace inclusion. Information and Computation\u00a0200(1), 35\u201361 (2005)","journal-title":"Information and Computation"},{"issue":"4","key":"6_CR41","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s100090050040","volume":"2","author":"Y. Kesten","year":"2000","unstructured":"Kesten, Y., Pnueli, A.: Control and data abstraction: The cornerstones of practical formal verification. Software Tools for Technology Transfer\u00a02(4), 328\u2013342 (2000)","journal-title":"Software Tools for Technology Transfer"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45694-5_8","volume-title":"CONCUR 2002 - Concurrency Theory","author":"Y. Kesten","year":"2002","unstructured":"Kesten, Y., Pnueli, A., Shahar, E., Zuck, L.: Network invariants in action. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, Springer, Heidelberg (2002)"},{"issue":"1","key":"6_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1024","volume":"117","author":"R.P. Kurshan","year":"1995","unstructured":"Kurshan, R.P., McMillan, K.L.: A structural induction theorem for processes. Information and Computation\u00a0117(1), 1\u201311 (1995)","journal-title":"Information and Computation"},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Lang, K.J.: Random dfa\u2019s can be approximately learned from sparse uniform examples. In: COLT, pp. 45\u201352 (1992)","DOI":"10.1145\/130385.130390"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets, Esprit Basic Reasearch Action No 3096 (1991)","DOI":"10.1016\/B978-1-55860-213-7.50015-8"},{"key":"6_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/10722167_14","volume-title":"Computer Aided Verification","author":"K.S. Namjoshi","year":"2000","unstructured":"Namjoshi, K.S., Trefler, R.J.: On the competeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 139\u2013153. Springer, Heidelberg (2000)"},{"issue":"1\/2","key":"6_CR47","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1010828029885","volume":"44","author":"A.L. Oliveira","year":"2001","unstructured":"Oliveira, A.L., Silva, J.P.M.: Efficient algorithms for the inference of minimum size dfas. Machine Learning\u00a044(1\/2), 93\u2013119 (2001)","journal-title":"Machine Learning"},{"key":"6_CR48","series-title":"Series in Machine Perception and Artificial Intelligence","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/9789812797902_0004","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: de la Blanca, N.P., Sanfeliu, A., Vidal, E. (eds.) Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol.\u00a01, pp. 49\u201361. World Scientific, Singapore (1992)"},{"key":"6_CR49","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-0-387-35578-8_13","volume-title":"Formal Methods for Protocol Engineering and Distributed Systems, FORTE\/PSTV","author":"D. Peled","year":"1999","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE\/PSTV, pp. 225\u2013240. Kluwer, Beijing, China (1999)"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Pena, J.M., Oliveira, A.L.: A new algorithm for the reduction of incompletely specified finite state machines. In: ICCAD, pp. 482\u2013489 (1998)","DOI":"10.1145\/288548.289075"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/10722167_26","volume-title":"Computer Aided Verification","author":"A. Pnueli","year":"2000","unstructured":"Pnueli, A., Shahar, E.: Liveness and acceleration in parameterized verification. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 328\u2013343. Springer, Heidelberg (2000)"},{"key":"6_CR52","doi-asserted-by":"crossref","unstructured":"Raffelt, H., Steffen, B.: Learnlib: A library for automata learning and experimentation. In: Baresi and Heckel [9], pp. 377\u2013380","DOI":"10.1145\/1081180.1081189"},{"key":"6_CR53","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, ch. 4","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol.\u00a0B, pp. 133\u2013191. Elsevier Science Publishers B. V, Amsterdam (1990)"},{"key":"6_CR54","volume-title":"Finite automata: behaviour and synthesis","author":"B. Trakhtenbrot","year":"1973","unstructured":"Trakhtenbrot, B., Barzdin, J.: Finite automata: behaviour and synthesis. North-Holland, Amsterdam (1973)"},{"key":"6_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/978-3-540-30538-5_41","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"A. Vardhan","year":"2004","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Actively learning to verify safety for fifo automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 494\u2013505. Springer, Heidelberg (2004)"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-540-30482-1_26","volume-title":"Formal Methods and Software Engineering","author":"A. Vardhan","year":"2004","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Learning to verify safety properties. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol.\u00a03308, pp. 274\u2013289. Springer, Heidelberg (2004)"},{"key":"6_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-540-31980-1_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Vardhan","year":"2005","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Using language inference to verify omega-regular properties. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 45\u201360. Springer, Heidelberg (2005)"},{"key":"6_CR58","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/1101908.1101961","volume-title":"ASE","author":"A. Vardhan","year":"2005","unstructured":"Vardhan, A., Viswanathan, M.: Learning to verify branching time properties. In: Redmiles, D.F., Ellman, T., Zisman, A. (eds.) ASE, pp. 325\u2013328. ACM, New York (2005)"},{"issue":"4","key":"6_CR59","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/BF01068590","volume":"9","author":"M.P. Vasilevski","year":"1973","unstructured":"Vasilevski, M.P.: Failure diagnosis of automata. Cybernetic\u00a09(4), 653\u2013665 (1973)","journal-title":"Cybernetic"},{"key":"6_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-52148-8_6","volume-title":"Automatic Verification Methods for Finite State Systems","author":"P. Wolper","year":"1990","unstructured":"Wolper, P., Lovinfosse, V.: Verifying properties of large sets of processes with network invariants. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol.\u00a0407, pp. 68\u201380. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74792-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T12:57:15Z","timestamp":1557233835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74792-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540747918","9783540747925"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74792-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}