乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:46Z","timestamp":1743154306241,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005893"},{"type":"electronic","value":"9783642005909"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00590-9_20","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T12:05:58Z","timestamp":1238155558000},"page":"267-284","source":"Crossref","is-referenced-by-count":6,"title":["Minimization Algorithm for Symbolic Bisimilarity"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61604-7_53","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R.M. Amadio","year":"1996","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 147\u2013162. Springer, Heidelberg (1996)"},{"issue":"1","key":"20_CR2","first-page":"1","volume":"15","author":"P. Baldan","year":"2005","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. M.S.C.S\u00a015(1), 1\u201335 (2005)","journal-title":"M.S.C.S"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-73859-6_9","volume-title":"Algebra and Coalgebra in Computer Science","author":"P. Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R., K\u00f6nig, B.: Bisimilarity and behaviour-preserving reconfiguration of open petri nets. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 126\u2013142. Springer, Heidelberg (2007)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-78499-9_28","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Bonchi","year":"2008","unstructured":"Bonchi, F., Montanari, U.: Symbolic semantics revisited. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 395\u2013412. Springer, Heidelberg (2008)"},{"unstructured":"Bonchi, F., Montanari, U.: Minimization algorithm for symbolic bisimilarity. Technical Report TR-08-27, Department of Informatics, University of Pisa (2008)","key":"20_CR5"},{"issue":"1","key":"20_CR6","first-page":"177","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. T.C.S.\u00a0240(1), 177\u2013213 (2000)","journal-title":"T.C.S."},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-55179-4_18","volume-title":"Computer Aided Verification","author":"J.C. Fernandez","year":"1992","unstructured":"Fernandez, J.C., Mounier, L.: \u201con the fly\u201c verification of behavioural equivalences and preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 181\u2013191. Springer, Heidelberg (1992)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BFb0028772","volume-title":"Computer Aided Verification","author":"G.L. Ferrari","year":"1998","unstructured":"Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: Verifying mobile processes in the hal environment. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 511\u2013515. Springer, Heidelberg (1998)"},{"issue":"2","key":"20_CR9","first-page":"353","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. T.C.S.\u00a0138(2), 353\u2013389 (1995)","journal-title":"T.C.S."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP \u201991 European Conference on Object-Oriented Programming","author":"K. Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.\u00a0512, pp. 133\u2013147. Springer, Heidelberg (1991)"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: Ccs expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/3-540-45061-0_47","volume-title":"Automata, Languages and Programming","author":"M. Merro","year":"2003","unstructured":"Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for mobile ambients. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 584\u2013598. Springer, Heidelberg (2003)"},{"key":"20_CR13","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, i and ii. Information and Computation\u00a0100(1), 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-49059-0_18","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"U. Montanari","year":"1999","unstructured":"Montanari, U., Pistore, M.: Finite state verification for the asynchronous pi-calculus. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 255\u2013269. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: An introduction to history dependent automata. Electr. Notes Theor. Comput. Sci.\u00a010 (1997)","key":"20_CR16","DOI":"10.1016\/S1571-0661(05)80696-6"},{"issue":"1","key":"20_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1992-16206","volume":"16","author":"U. Montanari","year":"1992","unstructured":"Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for ccs. Fundamenta Informaticae\u00a016(1), 171\u2013199 (1992)","journal-title":"Fundamenta Informaticae"},{"issue":"6","key":"20_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.2000.2895","volume":"164","author":"M. Pistore","year":"2001","unstructured":"Pistore, M., Sangiorgi, D.: A partition refinement algorithm for the \u03c0-calculus. Information and Computation\u00a0164(2), 264\u2013321 (2001)","journal-title":"Information and Computation"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the \u03c0-calculus. Acta Informatica\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/3-540-58179-0_73","volume-title":"Computer Aided Verification","author":"B. Victor","year":"1994","unstructured":"Victor, B., Moller, F.: The mobility workbench - a tool for the pi-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 428\u2013440. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00590-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,3]],"date-time":"2021-10-03T17:47:45Z","timestamp":1633283265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00590-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005893","9783642005909"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00590-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}