{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:21:59Z","timestamp":1742973719643,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642272684"},{"type":"electronic","value":"9783642272691"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27269-1_19","type":"book-chapter","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T00:52:10Z","timestamp":1326761530000},"page":"295-299","source":"Crossref","is-referenced-by-count":3,"title":["Steps on the Road to Component Evolvability"],"prefix":"10.1007","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[]},{"given":"Cinzia","family":"Di Giusto","sequence":"additional","affiliation":[]},{"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"19_CR2","unstructured":"Bravetti, M., Giusto, C.D., P\u00e9rez, J.A., Zavattaro, G.: Adaptable Processes. Technical report, University of Bologna (2011), Draft in, \n                  \n                    http:\/\/www.japerez.phipages.com"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-03466-4_10","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"C. Di Giusto","year":"2009","unstructured":"Di Giusto, C., P\u00e9rez, J.A., Zavattaro, G.: On the expressiveness of forwarding in higher-order communication. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 155\u2013169. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","unstructured":"Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation congruences for homer \u2014 a calculus of higher order mobile embedded resources. Technical Report TR-2004-52, IT University of Copenhagen (2004)"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ic.2010.10.001","volume":"209","author":"I. Lanese","year":"2011","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. Inf. Comput.\u00a0209(2), 198\u2013226 (2011)","journal-title":"Inf. Comput."},{"key":"19_CR7","volume-title":"Comunication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Comunication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"19_CR8","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. Inf. Comput.\u00a0100(1), 1\u201340 (1992)","journal-title":"Inf. Comput."},{"key":"19_CR9","unstructured":"P\u00e9rez, J.A.: Higher-Order Concurrency: Expressiveness and Decidability Results. PhD thesis, University of Bologna (2010), Draft in, \n                  \n                    http:\/\/www.japerez.phipages.com"},{"key":"19_CR10","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST\u201399\u201393, University of Edinburgh, Dept. of Comp. Sci. (1992)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-31794-4_9","volume-title":"Global Computing","author":"A. Schmitt","year":"2005","unstructured":"Schmitt, A., Stefani, J.-B.: The kell calculus: A family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol.\u00a03267, pp. 146\u2013178. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27269-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:27:59Z","timestamp":1556137679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27269-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642272684","9783642272691"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27269-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}