Normal Bisimulations in Calculi with Passivation

Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the *** -calculus. In particular, effective coinductive characterizations of barbed congruence, such as the notion of normal bisimulation developed by Sangiorgi for the higher-order *** -calculus, are difficult to obtain. In this paper, we study bisimulations in two simple higher-order calculi with a passivation operator, that allows the interruption and thunkification of a running process. We develop a normal bisimulation that characterizes barbed congruence, in the strong and weak cases, for the first calculus which has no name restriction operator. We then show that this result does not hold in the calculus extended with name restriction.

[1]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[2]  Jan Vitek,et al.  The Seal Calculus , 2005, Inf. Comput..

[3]  Sundar Sarukkai,et al.  FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.

[4]  Thomas T. Hildebrandt,et al.  Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names , 2005, FSTTCS.

[5]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[6]  Francesco Zappa Nardelli,et al.  Behavioural Theory for Mobile Ambients , 2004, IFIP TCS.

[7]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[8]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[9]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[10]  Zining Cao.  More on Bisimulations for Higher Order pi-Calculus , 2006, FoSSaCS.

[11]  Alan Schmitt,et al.  The Kell Calculus: A Family of Higher-Order Distributed Process Calculi , 2004, Global Computing.

[12]  Alan Schmitt,et al.  Normal bisimulations in process calculi with passivation , 2008 .

[13]  Ivan Lanese,et al.  Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA , 2008, LICS.

[14]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[15]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[16]  Giuseppe Castagna,et al.  The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity , 2002, FSTTCS.

[17]  Douglas J. Howe.  Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[18]  Thomas T. Hildebrandt,et al.  Bisimulation Congruences for Homer a calculus of Higher-order mobile embedded resources , 2004 .

[19]  Bent Thomsen,et al.  Plain CHOCS A second generation calculus for higher order processes , 2005, Acta Informatica.