Skip to Main content Skip to Navigation
Conference papers

Normal bisimulations in process calculi with passivation

Sergueï Lenglet 1 Alan Schmitt 1 Jean-Bernard Stefani 1 
1 SARDES - System architecture for reflective distributed computing environments
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particu- lar, 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 bisim- ulations 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Alan Schmitt Connect in order to contact the contributor
Submitted on : Wednesday, June 9, 2010 - 3:19:41 PM
Last modification on : Saturday, June 25, 2022 - 10:19:39 AM
Long-term archiving on: : Thursday, December 1, 2016 - 6:40:44 AM


Files produced by the author(s)




Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani. Normal bisimulations in process calculi with passivation. 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2009), Mar 2009, York, United Kingdom. pp.257--271, ⟨10.1007/978-3-642-00596-1_19⟩. ⟨inria-00490810⟩



Record views


Files downloads