{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:42:26Z","timestamp":1760820146086},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"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-04081-8_30","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"448-462","source":"Crossref","is-referenced-by-count":14,"title":["Howe\u2019s Method for Calculi with Passivation"],"prefix":"10.1007","author":[{"given":"Sergue\u00ef","family":"Lenglet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Bernard","family":"Stefani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Baldamus, M.: Semantics and Logic of Higher-Order Processes: Characterizing Late Context Bisimulation. PhD thesis, Berlin University of Technology (1998)"},{"key":"30_CR2","unstructured":"Baldamus, M., Frauenstein, T.: Congruence proofs for weak bisimulation equivalences on higher\u2013order process calculi. Technical report, Berlin University of Technology (1995)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and mobility control in boxed ambients. Information and Computation\u00a0202 (2005)","DOI":"10.1016\/j.ic.2005.06.002"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 140\u2013155. Springer, Heidelberg (1998)"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.11.005","volume":"201","author":"G. Castagna","year":"2005","unstructured":"Castagna, G., Vitek, J., Zappa Nardelli, F.: The Seal Calculus. Information and Computation\u00a0201(1), 1\u201354 (2005)","journal-title":"Information and Computation"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11590156_11","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"J.C.. Godskesen","year":"2005","unstructured":"Godskesen, J.C., Hildebrandt, T.: Extending howe\u2019s method to early bisimulations for typed mobile embedded resources with local names. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005, vol.\u00a03821, pp. 140\u2013151. Springer, Heidelberg (2005)"},{"key":"30_CR7","unstructured":"Gordon, A.D.: Bisimilarity as a theory of functional programming. Mini-course. Notes Series NS-95-3, BRICS, University of Cambridge Computer Laboratory, iv+59 pp. (July 1995)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Hennessy, M., Rathke, J., Yoshida, N.: Safedpi: a language for controlling mobile code. Acta Inf.\u00a042(4-5) (2005)","DOI":"10.1007\/s00236-005-0178-y"},{"key":"30_CR9","unstructured":"Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation congruences for Homer \u2014 a calculus of higher order mobile embedded resources. Technical Report ITU-TR-2004-52, IT University of Copenhagen (2004)"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation\u00a0124(2), 103\u2013112 (1996)","journal-title":"Information and Computation"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2004.03.005","volume":"323","author":"A. Jeffrey","year":"2004","unstructured":"Jeffrey, A., Rathke, J.: A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science\u00a0323, 1\u201348 (2004)","journal-title":"Theoretical Computer Science"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science\u00a01(1) (2005)","DOI":"10.2168\/LMCS-1(1:4)2005"},{"key":"30_CR13","unstructured":"Lenglet, S., Schmitt, A., Stefani, J.B.: Howe\u2019s method for early bisimilarities. Technical Report RR 6773, INRIA (2008)"},{"key":"30_CR14","unstructured":"Lenglet, S., Schmitt, A., Stefani, J.B.: Characterizing contextual equivalence in calculi with passivation (2009), \n                    \n                      http:\/\/sardes.inrialpes.fr\/~aschmitt\/papers\/hop_howe_long.pdf"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-642-00596-1_19","volume-title":"FoSSaCS 2009","author":"S. Lenglet","year":"2009","unstructured":"Lenglet, S., Schmitt, A., Stefani, J.-B.: Normal bisimulations in process calculi with passivation. In: FoSSaCS 2009. LNCS, vol.\u00a05504, pp. 257\u2013271. Springer, Heidelberg (2009)"},{"issue":"6","key":"30_CR16","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1145\/1101821.1101825","volume":"52","author":"M. Merro","year":"2005","unstructured":"Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. Journal of the ACM\u00a052(6), 961\u20131023 (2005)","journal-title":"Journal of the ACM"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623. Springer, Heidelberg (1992)"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11539452_25","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Mousavi","year":"2005","unstructured":"Mousavi, M., Gabbay, M.J., Reniers, M.A.: Sos for higher order processes (extended abstract). In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 308\u2013322. Springer, Heidelberg (2005)"},{"key":"30_CR19","series-title":"IFIP","first-page":"507","volume-title":"IFIP TCS","author":"J. Rathke","year":"2008","unstructured":"Rathke, J., Sobocinski, P.: Deconstructing behavioural theories of mobility. In: IFIP TCS. IFIP, vol.\u00a0273, pp. 507\u2013520. Springer, Heidelberg (2008)"},{"key":"30_CR20","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh (1992)"},{"issue":"2","key":"30_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation\u00a0131(2), 141\u2013178 (1996)","journal-title":"Information and Computation"},{"key":"30_CR22","first-page":"293","volume-title":"LICS 2007","author":"D. Sangiorgi","year":"2007","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS 2007, pp. 293\u2013302. IEEE Computer Society, Los Alamitos (2007)"},{"key":"30_CR23","volume-title":"The Pi-Calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"30_CR24","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":"A.\u00a0Schmitt and J.-B. Stefani. The Kell Calculus: A Family of Higher-Order Distributed Process Calculi. In Global Computing 2004 workshop, volume 3267 of LNCS, 2004."},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Sewell, P., Leifer, J., Wansbrough, K., Zappa Nardelli, F., Allen-Willians, M., Habouzit, P., Vafeiadis, V.: Acute: High-level programming language design for distributed computation. Journal of Functional Programming\u00a017(4-5) (2007)","DOI":"10.1017\/S0956796807006442"},{"issue":"1","key":"30_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B. Thomsen","year":"1993","unstructured":"Thomsen, B.: Plain chocs: A second generation calculus for higher order processes. Acta Informatica\u00a030(1), 1\u201359 (1993)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:28:10Z","timestamp":1552130890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}