{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:49:05Z","timestamp":1725702545116},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340253"},{"type":"electronic","value":"9783642340260"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","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-34026-0_20","type":"book-chapter","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T21:07:20Z","timestamp":1348607240000},"page":"269-283","source":"Crossref","is-referenced-by-count":2,"title":["Towards the Verification of Adaptable Processes"],"prefix":"10.1007","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cinzia","family":"Di Giusto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"20_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":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-12032-9_11","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Acciai","year":"2010","unstructured":"Acciai, L., Boreale, M., Zavattaro, G.: On the Relationship between Spatial Logics and Behavioral Simulations. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 146\u2013160. Springer, Heidelberg (2010)"},{"key":"20_CR3","unstructured":"Amazon Web Services. Autoscaling (2011), \n                    \n                      http:\/\/aws.amazon.com\/autoscaling\/"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bravetti, M., Di Giusto, C., P\u00e9rez, J.A., Zavattaro, G.: Adaptable processes. Technical report, University of Bologna (2011), \n                    \n                      http:\/\/www.cs.unibo.it\/~perez\/ap\/","DOI":"10.2168\/LMCS-8(4:13)2012"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-21461-5_6","volume-title":"Formal Techniques for Distributed Systems","author":"M. Bravetti","year":"2011","unstructured":"Bravetti, M., Di Giusto, C., P\u00e9rez, J.A., Zavattaro, G.: Adaptable Processes (Extended Abstract). In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol.\u00a06722, pp. 90\u2013105. Springer, Heidelberg (2011)"},{"key":"20_CR6","unstructured":"Bundgaard, M., Godskesen, J.C., Hildebrandt, T.: Bisimulation congruences for homer \u2014 a calculus of higher order mobile embedded resources. Technical Report TR-2004-52, IT University of Copenhagen (2004)"},{"issue":"1-2","key":"20_CR7","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":"20_CR8","unstructured":"Milner, R.: Comunication and Concurrency. Prentice Hall (1989)"},{"issue":"1","key":"20_CR9","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":"20_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":"20_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","Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34026-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:31:21Z","timestamp":1558301481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34026-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340253","9783642340260"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34026-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}