{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:06:07Z","timestamp":1776305167930,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540708438","type":"print"},{"value":"9783540708445","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70844-5_17","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T05:19:29Z","timestamp":1216703969000},"page":"161-170","source":"Crossref","is-referenced-by-count":19,"title":["Five Determinisation Algorithms"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]},{"given":"Bas","family":"Ploeger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","volume":"24","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming\u00a024(3), 189\u2013220 (1995)","journal-title":"Science of Computer Programming"},{"key":"17_CR2","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"J.A. Brzozowski","year":"1963","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn (1963)"},{"key":"17_CR3","unstructured":"CWI: \u03bcCRL Toolset Home Page, http:\/\/www.cwi.nl\/~mcrl\/"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-55179-4_25","volume-title":"Computer Aided Verification","author":"D.L. Dill","year":"1992","unstructured":"Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simulation preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 255\u2013265. Springer, Heidelberg (1992)"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1027328830731","volume":"31","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. Journal of Automated Reasoning\u00a031(1), 73\u2013103 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 20th Int. Conf. on Computer Aided Verification","author":"R.J. Glabbeek van","year":"2008","unstructured":"van Glabbeek, R.J., Ploeger, B.: Correcting a space-efficient simulation algorithm. In: Proc. 20th Int. Conf. on Computer Aided Verification. LNCS. Springer, Heidelberg (to appear, 2008)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J., Ploeger, B.: Five Determinisation Algorithms. CS-Report 08-14, Eindhoven University of Technology (2008)","DOI":"10.1007\/978-3-540-70844-5_17"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/B978-044482830-9\/50035-7","volume-title":"Handbook of Process Algebra","author":"J.F. Groote","year":"2001","unstructured":"Groote, J.F., Reniers, M.A.: Algebraic process verification. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 1151\u20131208. Elsevier, Amsterdam (2001)"},{"key":"17_CR9","first-page":"453","volume-title":"36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 453\u2013462. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n logn algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"17_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proceedings 5th GI-Conference on Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Proceedings 5th GI-Conference on Theoretical Computer Science. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/800125.804029","volume-title":"Proc.\u00a05th Annual ACM Symposium on Theory of Computing (STOC 1973)","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc.\u00a05th Annual ACM Symposium on Theory of Computing (STOC 1973), pp. 1\u20139. ACM, New York (1973)"},{"issue":"1-3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0304-3975(02)00413-9","volume":"295","author":"K. Sutner","year":"2003","unstructured":"Sutner, K.: The size of power automata. Theor.\u00a0Comput.\u00a0Sci.\u00a0295(1-3), 371\u2013386 (2003)","journal-title":"Theor.\u00a0Comput.\u00a0Sci."},{"key":"17_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11591191_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Tabakov","year":"2005","unstructured":"Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 396\u2013411. Springer, Heidelberg (2005)"},{"key":"17_CR16","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Technische Universiteit Eindhoven (1995)"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01217347","volume":"96","author":"S. Wolfram","year":"1984","unstructured":"Wolfram, S.: Computation theory of cellular automata. Communications in Mathematical Physics\u00a096(1), 15\u201357 (1984)","journal-title":"Communications in Mathematical Physics"},{"key":"17_CR18","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram Media, Inc. (2002)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Applications of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70844-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T17:12:30Z","timestamp":1557681150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70844-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540708438","9783540708445"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70844-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}