{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:11:44Z","timestamp":1775873504327,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434191","type":"print"},{"value":"9783540460022","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46002-0_25","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:59Z","timestamp":1193552999000},"page":"357-370","source":"Crossref","is-referenced-by-count":71,"title":["Adaptive Model Checking"],"prefix":"10.1007","author":[{"given":"Alex","family":"Groce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1978","unstructured":"D. Angluin, Learning Regular Sets from Queries and Counterexamples, Information and Computation, 75, 87\u2013106 (1978).","journal-title":"Information and Computation"},{"key":"25_CR2","unstructured":"G. Birtwistle, F. Moller, Ch. Tofts, The verification of a COMA cache coherence protocol, IEEE Workshop on Formal Methods in Software Practice (FMSP\u201996)."},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"SE-4","author":"T. S. Chow","year":"1978","unstructured":"T. S. Chow, Testing software design modeled by finite-state machines, IEEE transactions on software engineering, SE-4, 3, 1978, 178\u2013187.","journal-title":"IEEE transactions on software engineering"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement, CAV 2000, 154\u2013169.","DOI":"10.1007\/10722167_15"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, B. Steffen, The Concurrency Workbench: a semantic-based tool for the verification of concurrent systems, TOPLAS 15(1993), 36\u201372.","journal-title":"TOPLAS"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M., Memory efficient algorithms for the verification of temporal properties, Formal Methods in System Design 1(1992), pp. 275\u2013288.","journal-title":"Formal Methods in System Design"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The theory of Machines and Computation","author":"J.E. Hopcroft","year":"1971","unstructured":"J.E. Hopcroft, An n log n algorithm for minimizing the states in infinite automata, The theory of Machines and Computation, Academic Press, New York, 189\u2013196, 1971."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"D. Lee, M. Yannakakis, Principles and methods of testing finite state machines\u2014a survey, Proceedings of the IEEE, 84(8), 1090\u20131126, 1996.","DOI":"10.1109\/5.533956"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"D. Peled, M. Y. Vardi, M. Yannakakis, Black Box Checking, Black Box Checking, FORTE\/PSTV 1999, Beijing, China.","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"25_CR10","unstructured":"M. P. Vasilevskii, Failure diagnosis of automata, Kibertetika, no 4, 1973, 98\u2013108."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46002-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:56Z","timestamp":1556936936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46002-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434191","9783540460022"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46002-0_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}