Weak Bisimulation Up to Elaboration
We study the use of the elaboration preorder (due to Arun-Kumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a correct technique that encompasses the commonly used up to expansion technique. We also define a theory of up-to techniques for elaboration that in particular validates an elaboration up to elaboration technique, while it is known that weak bisimulation up to weak bisimilarity is unsound. In this sense, the resulting setting improves over previous works in terms of modularity.
Our results are obtained using nontrivial proofs that exploit termination arguments. In particular, we need the termination of internal computations for the up-to techniques to be correct. We show how this condition can be relaxed to some extent in order to handle processes exhibiting infinite internal behaviour.
KeywordsVisible Action Label Transition System Elaboration Relation Symmetric Relation Safe Function
Unable to display preview. Download preview PDF.
- 2.Arun-Kumar, S., Natarajan, V.: Conformance: A Precongruence Close to Bisimilarity. In: Proc. Struct. in Concurrency Theory, pp. 55–68. Springer, Heidelberg (1995)Google Scholar
- 3.Fournet, C.: The Join-Calculus: a Calculus for Distributed Mobile Programming. PhD thesis, Ecole Polytechnique (1998)Google Scholar
- 8.Pous, D.: Weak Bisimulation up to Elaboration. In: Long version of this paper, with full proofs (2006), Available from: http://perso.ens-lyon.fr/damien.pous/upto
- 11.Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar