{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T08:09:30Z","timestamp":1672992570587},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003489","type":"print"},{"value":"9783540363842","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36384-x_3","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T14:21:13Z","timestamp":1196346073000},"page":"5-19","source":"Crossref","is-referenced-by-count":17,"title":["Behavior-Based Model Construction"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Steffen","sequence":"first","affiliation":[]},{"given":"Hardi","family":"Hungar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"issue":"75","key":"3_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"2","author":"D. Angluin","year":"1987","unstructured":"D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 2(75):87\u2013106, 1987.","journal-title":"Information and Computation"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"T.S. Chow","year":"1978","unstructured":"T.S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3):178\u2013187, 1978.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of theoretical computer science. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-46002-0_25","volume-title":"Proc. of the 8th Int. Conference for Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Groce","year":"2002","unstructured":"A. Groce, D. Peled, and M. Yannakakis. Adaptive model checking. In J.-P. Katoen and P. Stevens, editors, Proc. of the 8th Int. Conference for Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 357\u2013370. Springer Verlag, 2002."},{"key":"3_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-45923-5_6","volume-title":"Proc. of the 5th Int. Conference on Fundamental Approaches to Software Engineering (FASE\u2019 02)","author":"A. Hagerer","year":"2002","unstructured":"A. Hagerer, H. Hungar, O. Niese, and B. Steffen. Model generation by moderated regular extrapolation. In R. Kutsche and H. Weber, editors, Proc. of the 5th Int. Conference on Fundamental Approaches to Software Engineering (FASE\u2019 02), volume 2306 of Lecture Notes in Computer Science, pages 80\u201395. Springer Verlag, 2002."},{"key":"3_CR6","unstructured":"A. Hagerer, T. Margaria, O. Niese, B. Steffen, G. Brune, and H. Ide. Efficient regression testing of CTI-systems: Testing a complex call-center solution. In Annual Review of Communication, volume 55. Int. Engineering Consortium (IEC), 2001."},{"key":"3_CR7","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In Proc. 4th International Colloquium on Grammatical Inference-ICGI\u2019 98, LNAI 1433, pages 1\u201312. Springer, 1998.","DOI":"10.1007\/BFb0054059"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"D. Lee and M. Yannakakis. Principles and methods of testing finite state machines-A survey. In Proc. of the IEEE, volume 84, pages 1090\u20131123, 1996.","DOI":"10.1109\/5.533956"},{"key":"3_CR11","first-page":"279","volume-title":"Lect Notes Comput Sci","author":"A. Mazurkiewicz","year":"1987","unstructured":"A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, volume 255 of Lecture Notes in Computer Science, pages 279\u2013324. Springer Verlag, 1987."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"E.F. Moore. Gedanken-experiments on sequential machines. Annals of Mathematics Studies (34), Automata Studies, pages 129\u2013153, 1956.","DOI":"10.1515\/9781400882618-006"},{"key":"3_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45314-8_17","volume-title":"Proc. of the 4th Int. Conference on Fundamental Approaches to Software Engineering (FASE\u2019 01)","author":"O. Niese","year":"2001","unstructured":"O. Niese, B. Steffen, T. Margaria, A. Hagerer, G. Brune, and H. Ide. Library-based design and consistency checks of system-level industrial test cases. In H. Hu\\mann, editor, Proc. of the 4th Int. Conference on Fundamental Approaches to Software Engineering (FASE\u2019 01), volume 2029 of Lecture Notes in Computer Science, pages 233\u2013248. Springer Verlag, 2001."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"D. Peled, M.Y. Vardi, and M. Yannakakis. Black box checking. In Jianping Wu, Samuel T. Chanson, and Qiang Gao, editors, Proc. of the Joint Int. Conference on Formal Description Techniques for Distributed System and Communication\/Protocols and Protocol Specification, Testing and Verification (FORTE\/PSTV\u2019 99), pages 225\u2013240. Kluwer Academic Publishers, 199","DOI":"10.1007\/978-0-387-35578-8_13"},{"issue":"11","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, 1984.","journal-title":"Communications of the ACM"},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-56922-7_33","volume-title":"On-the-fly verification with stubborn sets","author":"A. Valmari","year":"1993","unstructured":"A. Valmari. On-the-fly verification with stubborn sets. In Proc. of the 5th Int. Conference on Computer Aided Verification (CAV\u2019 93), volume 697 of Lecture Notes in Computer Science, pages 397\u2013408. Springer Verlag, 1993."},{"key":"3_CR17","first-page":"98","volume":"4","author":"M.P. Vasilevskii","year":"1973","unstructured":"M.P. Vasilevskii. Failure diagnosis of automata. Kibernetika, 4:98\u2013108, 1973.","journal-title":"Kibernetika"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36384-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:08:58Z","timestamp":1588115338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36384-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,16]]},"ISBN":["9783540003489","9783540363842"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-36384-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2002,12,16]]}}}