{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:09Z","timestamp":1725545049964},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_3","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"31-42","source":"Crossref","is-referenced-by-count":11,"title":["Minimization of Non-deterministic Automata with Large Alphabets"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Deneux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Kaati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Nilsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/BFb0028770","volume-title":"Computer Aided Verification","author":"A. Bouali","year":"1998","unstructured":"Bouali, A.: Xeve, an esterel verification environment. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 500\u2013504. Springer, Heidelberg (1998)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-61474-5_87","volume-title":"Computer Aided Verification","author":"R. Cleaveland","year":"1996","unstructured":"Cleaveland, R., Sims, S.: The NCSU concurrency workbench. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 394\u2013397. Springer, Heidelberg (1996)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"J.C. Fernandez","year":"1996","unstructured":"Fernandez, J.C., Garavel, H., Kerbrat, A., Mateescu, R., Mounier, L., Sighireanu, M.: CADP: A Protocol Validation and Verification Toolbox. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, Springer, Heidelberg (1996)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P. Abdulla","year":"2004","unstructured":"Abdulla, P., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 348\u2013360. Springer, Heidelberg (2004)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"3_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n logn algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretical Computer Science\u00a040, 67\u201384 (1985)","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR9","volume-title":"Design and Validation of Computer Protocols","author":"G. Holzmann","year":"1991","unstructured":"Holzmann, G.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1991)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science\u00a0311, 221\u2013256 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers\u00a0C-35, 677\u2013691 (1986)","journal-title":"IEEE Trans. on Computers"},{"key":"3_CR12","first-page":"188","volume-title":"ICCAD 1993: Proc. of the 1993 IEEE\/ACM international conference on Computer-aided design","author":"R.I. Bahar","year":"1993","unstructured":"Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. In: ICCAD 1993: Proc. of the 1993 IEEE\/ACM international conference on Computer-aided design, pp. 188\u2013191. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Fernandez, J.C.: An implementation of an efficient algorithm for bisimulation equivalence. Sci. Comput. Program. 13 (1989)","DOI":"10.1016\/0167-6423(90)90071-K"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-56496-9_9","volume-title":"Computer Aided Verification","author":"A. Bouali","year":"1993","unstructured":"Bouali, A., de Simone, R.: Symbolic bisimulation minimisation. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 96\u2013108. Springer, Heidelberg (1993)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jagm.1999.1013","volume":"32","author":"N. Klarlund","year":"1999","unstructured":"Klarlund, N.: An n logn algorithm for online bdd refinement. J. Algorithms\u00a032, 133\u2013154 (1999)","journal-title":"J. Algorithms"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Fisler, K., Vardi, M.Y.: Bisimulation and model checking. In: Conference on Correct Hardware Design and Verification Methods, pp. 338\u2013341 (1999)","DOI":"10.1007\/3-540-48153-2_29"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Fernandez, J., Halbwachs, N.: Minimal model generation (manuscript, 1990)","DOI":"10.1090\/dimacs\/003\/08"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Lee, D., Yannakakis, M.: Online minimization of transition systems. In: Proc. 24 ACM Symp. on Theory of Computing (1992)","DOI":"10.1145\/129712.129738"},{"key":"3_CR19","unstructured":"Andersen, H.R.: An introduction to binary decision diagrams. Technical Report DK-2800, Department of Information Technology, Technical University of Denmark (1998)"},{"key":"3_CR20","unstructured":"Somenzi, F.: Binary decision diagrams (1999)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems\u00a015 (1993)","DOI":"10.1145\/151646.151648"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kanellakis","year":"1990","unstructured":"Kanellakis, P., Smolka, S.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086, 43\u201368 (1990)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:22Z","timestamp":1619507122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11605157_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}