{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T07:10:04Z","timestamp":1737184204093,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_10","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"129-143","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation"],"prefix":"10.1007","author":[{"given":"Gianluigi","family":"Ferrari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Pistore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"P. Aczel, N. Mendler, A Final Coalgebra Theorem, in Category Theory and Computer Science, LNCS 389, 1989."},{"key":"10_CR2","unstructured":"A. Corradini, R. Heckel, U. Montanari, Compositional SOS and Beyond: A Coalgebraic View of Open Systems, Theoretical Computer Science, to appear."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"E. Clarke and J. Wing Eds. Formal Methods: State of the Art and Future Directions. ACM Comp. Surv., December 1996.","DOI":"10.1145\/242223.242257"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(96)00325-8","volume":"183","author":"M. Dam","year":"1997","unstructured":"M. Dam, On the decidabilityof process equivalences for the \u03c0-calculus. Theoretical Computer Science, 183(2):215\u2013228, 1997.","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"B. Jacobs, J. Rutten A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 62, 222\u2013259, 1997.","journal-title":"Bulletin of EATCS"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J.-C. Fernandez","year":"1990","unstructured":"J.-C., Fernandez, An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming 13, 219\u2013236, 1990.","journal-title":"Science of Computer Programming"},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","volume-title":"TACAS\u201997","author":"G. Ferrari","year":"1997","unstructured":"G. Ferrari, G. Ferro, S. Gnesi, U. Montanari, M. Pistore, G. Ristori. An Automatabased Verification Environment for Mobile Processes In TACAS\u201997, LNCS 1217, 1997."},{"key":"10_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0018521","volume-title":"CAV\u201998","author":"G. Ferrari","year":"1998","unstructured":"G. Ferrari, S. Gnesi, U. Montanari, M. Pistore, G. Ristori, Verifying Mobile Processes in the HAL Environment. CAV\u201998, LNCS 1427, 1998."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kannellakis","year":"1990","unstructured":"P. Kannellakis, S. Smolka, CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86, 43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"C. Meadows Open Issues in Formal Methods for Cryptographic Protocol Analysis, Proceedings of DISCEX 2000, IEEE Press, 237\u2013250, 2000.","DOI":"10.21236\/ADA385327"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Part I and II. Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"10_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60299-2","volume-title":"Proc. CONCUR\u201995","author":"U. Montanari","year":"1995","unstructured":"U. Montanari and M. Pistore. Checking bisimilarityfor finitary \u03c0-calculus. In Proc. CONCUR\u201995, LNCS 962. Springer Verlag, 1995."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"U. Montanari and M. Pistore. Historydep endent verification for partial order systems. In Partial Order Methods in Verification, DIMACS Series, Vol. 29. American Mathematical Society, 1997.","DOI":"10.1090\/dimacs\/029\/14"},{"key":"10_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-61604-7","volume-title":"Proc. ESOP\u201996","author":"U. Montanari","year":"1996","unstructured":"U. Montanari, M. Pistore and D. Yankelevich. Efficient minimization up to location equivalence. In Proc. ESOP\u201996, LNCS 1058. Springer Verlag, 1996."},{"key":"10_CR15","unstructured":"U. Montanari and M. Pistore. History-Dependent Automata. IRST Technical Report 0112-14, Istituto Trentino di Cultura, December 2001."},{"key":"10_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45022-X","volume-title":"Proc. MFCS\u20192000","author":"U. Montanari","year":"2000","unstructured":"U. Montanari and M. Pistore. \u03c0-calculus, structured coalgebras and minimal HDautomata. In Proc. MFCS\u20192000, LNCS 1893, Springer Verlag, 2000."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1006\/inco.2000.2895","volume":"164","author":"M. Pistore","year":"2001","unstructured":"M. Pistore and D. Sangiorgi, A partition refinement algorithm for the \u03c0-calculus. Information and Computation 164, 263\u2013321, 2001.","journal-title":"Information and Computation"},{"issue":"6","key":"10_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige, R.E. Tarjan. Three partition refinement algorithms, SIAM Journal on Computing 16(6) 973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"10_CR19","unstructured":"J.J.M.M. Rutten. Universal coalgebra: a theoryof systems. Technical Report CSR9652, CWI, 1996. To appear in Theoretical Computer Science."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"D. Turi, G.D. Plotkin, Towards a Mathematical Operational Semantics, In Proc. Logic in Computer Science 97, IEEE Press, 280\u2013291, 1997.","DOI":"10.1109\/LICS.1997.614955"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"J. Warell, Terminal Sequences for Accessible Endofunctors, In Proc. CMCS\u201999, ENCTS 19, 1999.","DOI":"10.1016\/S1571-0661(05)80267-1"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:20:11Z","timestamp":1737087611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}