{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:31:03Z","timestamp":1768264263007,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540371878","type":"print"},{"value":"9783540371885","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814771_40","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T15:44:21Z","timestamp":1160063061000},"page":"483-497","source":"Crossref","is-referenced-by-count":39,"title":["Inferring Network Invariants Automatically"],"prefix":"10.1007","author":[{"given":"Olga","family":"Grinchtein","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"40_CR1","first-page":"307","volume":"22","author":"R. Krzysztof","year":"1986","unstructured":"Krzysztof, R.: Apt and Dexter Kozen. Limits for automatic verification of finite-state concurrent systems. IPL\u00a022(6), 307\u2013309 (1986)","journal-title":"Limits for automatic verification of finite-state concurrent systems. IPL"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"40_CR3","first-page":"87","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regaular sets from queries and counterexamples. IC\u00a075, 87\u2013106 (1987)","journal-title":"IC"},{"key":"40_CR4","first-page":"592","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 TOC\u00a021, 592\u2013597 (1972)","journal-title":"IEEE TOC"},{"key":"40_CR5","unstructured":"Berg, T., Jonsson, B., Leucker, M., Saksena, M.: Insights to Angluin\u2019s learning. TR 2003-039, Uppsala University (2003)"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"40_CR8","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":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"E.A. Emerson","year":"2000","unstructured":"Emerson, E.A., 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":"40_CR10","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: POPL (1995)","DOI":"10.1145\/199448.199468"},{"issue":"3","key":"40_CR11","first-page":"302","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. IC\u00a037(3), 302\u2013320 (1978)","journal-title":"IC"},{"issue":"3","key":"40_CR12","first-page":"21","volume":"138","author":"P. Habermehl","year":"2005","unstructured":"Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. ENTCS\u00a0138(3), 21\u201336 (2005)","journal-title":"ENTCS"},{"key":"40_CR13","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":"40_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/icar.1995.1139","volume":"117","author":"R.P. Kurshan","year":"1995","unstructured":"Kurshan, R.P., McMillan, K.L.: A structural induction theorem for processes. IC\u00a0117(1), 1\u201311 (1995)","journal-title":"IC"},{"issue":"4","key":"40_CR15","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. STTT\u00a02(4), 328\u2013342 (2000)","journal-title":"STTT"},{"issue":"1","key":"40_CR16","first-page":"35","volume":"200","author":"Y. Kesten","year":"2005","unstructured":"Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace inclusion. IC\u00a0200(1), 35\u201361 (2005)","journal-title":"IC"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2002","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, p. 2002. Springer, Heidelberg (2002)"},{"key":"40_CR18","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":"40_CR19","doi-asserted-by":"crossref","unstructured":"Lesens, D., Halbwachs, N., Raymond, P.: Automatic verification of parameterized linear networks of processes. In: 24th POPL (1997)","DOI":"10.1145\/263699.263747"},{"key":"40_CR20","first-page":"530","volume-title":"DAC","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: DAC, pp. 530\u2013535. ACM Press, New York (2001)"},{"key":"40_CR21","series-title":"Series in Machine Perception and AI","doi-asserted-by":"publisher","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: Pattern Recognition and Image Analysis. Series in Machine Perception and AI, vol.\u00a01, pp. 49\u201361. World Scientific, Singapore (1992)"},{"issue":"1\/2","key":"40_CR22","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":"40_CR23","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":"40_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-61474-5_68","volume-title":"Computer Aided Verification","author":"A. Pnueli","year":"1996","unstructured":"Pnueli, A., Shahar, E.: A platform for combining deductive with algorithmic verification. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 184\u2013195. Springer, Heidelberg (1996)"},{"key":"40_CR25","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":"40_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"40_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"40_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2005)"},{"key":"40_CR29","series-title":"Lecture Notes in Computer Science","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.) CAV 1989. LNCS, vol.\u00a0407, Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:37Z","timestamp":1605644077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11814771_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}