Abstract
We show how to apply Howe’s method for the proof of congruence of early bisimilarities in a higher-order process calculus with passivation. This involves the introduction of a proof technique based on a new kind of transition system and bisimilarity, called complementary semantics. We show that complementary semantics is equivalent to contextual semantics, originally introduced by Sangiorgi, that relies on classical transition systems for higher-order calculi and context bisimilarity. We apply this technique to obtain the first characterization of weak barbed congruence for such a higher-order calculus with passivation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldamus, M.: Semantics and Logic of Higher-Order Processes: Characterizing Late Context Bisimulation. PhD thesis, Berlin University of Technology (1998)
Baldamus, M., Frauenstein, T.: Congruence proofs for weak bisimulation equivalences on higher–order process calculi. Technical report, Berlin University of Technology (1995)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and mobility control in boxed ambients. Information and Computation 202 (2005)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Castagna, G., Vitek, J., Zappa Nardelli, F.: The Seal Calculus. Information and Computation 201(1), 1–54 (2005)
Godskesen, J.C., Hildebrandt, T.: Extending howe’s method to early bisimulations for typed mobile embedded resources with local names. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005, vol. 3821, pp. 140–151. Springer, Heidelberg (2005)
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)
Hennessy, M., Rathke, J., Yoshida, N.: Safedpi: a language for controlling mobile code. Acta Inf. 42(4-5) (2005)
Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation congruences for Homer — a calculus of higher order mobile embedded resources. Technical Report ITU-TR-2004-52, IT University of Copenhagen (2004)
Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation 124(2), 103–112 (1996)
Jeffrey, A., Rathke, J.: A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science 323, 1–48 (2004)
Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science 1(1) (2005)
Lenglet, S., Schmitt, A., Stefani, J.B.: Howe’s method for early bisimilarities. Technical Report RR 6773, INRIA (2008)
Lenglet, S., Schmitt, A., Stefani, J.B.: Characterizing contextual equivalence in calculi with passivation (2009), http://sardes.inrialpes.fr/~aschmitt/papers/hop_howe_long.pdf
Lenglet, S., Schmitt, A., Stefani, J.-B.: Normal bisimulations in process calculi with passivation. In: FoSSaCS 2009. LNCS, vol. 5504, pp. 257–271. Springer, Heidelberg (2009)
Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. Journal of the ACM 52(6), 961–1023 (2005)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623. Springer, Heidelberg (1992)
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. 3653, pp. 308–322. Springer, Heidelberg (2005)
Rathke, J., Sobocinski, P.: Deconstructing behavioural theories of mobility. In: IFIP TCS. IFIP, vol. 273, pp. 507–520. Springer, Heidelberg (2008)
Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh (1992)
Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation 131(2), 141–178 (1996)
Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS 2007, pp. 293–302. IEEE Computer Society, Los Alamitos (2007)
Sangiorgi, D., Walker, D.: The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
A. Schmitt 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.
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 17(4-5) (2007)
Thomsen, B.: Plain chocs: A second generation calculus for higher order processes. Acta Informatica 30(1), 1–59 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenglet, S., Schmitt, A., Stefani, JB. (2009). Howe’s Method for Calculi with Passivation. In: Bravetti, M., Zavattaro, G. (eds) CONCUR 2009 - Concurrency Theory. CONCUR 2009. Lecture Notes in Computer Science, vol 5710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04081-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-04081-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04080-1
Online ISBN: 978-3-642-04081-8
eBook Packages: Computer ScienceComputer Science (R0)