Abstract
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.
This work has been supported by the french initiatives “Action Concertée Nouvelles Interfaces des Mathématiques GEOCAL” and “ANR ARASSIA, projet ModyFiable”.
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
Arun-Kumar, S., Hennessy, M.: An Efficiency Preorder for Processes. Acta Informatica 29(9), 737–760 (1992)
Arun-Kumar, S., Natarajan, V.: Conformance: A Precongruence Close to Bisimilarity. In: Proc. Struct. in Concurrency Theory, pp. 55–68. Springer, Heidelberg (1995)
Fournet, C.: The Join-Calculus: a Calculus for Distributed Mobile Programming. PhD thesis, Ecole Polytechnique (1998)
Groote, J., Reniers, M.: Algebraic Process Verification. In: Handbook of Process Algebra, pp. 1151–1208. Elsevier, Amsterdam (2001)
Hirschkoff, D., Pous, D., Sangiorgi, D.: A Correct Abstract Machine for Safe Ambients. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 17–32. Springer, Heidelberg (2005)
Montanari, U., Sassone, V.: Dynamic Congruence vs. Progressing Bisimulation for CCS. Fundamenta Informaticae 16(1), 171–199 (1992)
Pous, D.: Up-to Techniques for Weak Bisimulation. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 730–741. Springer, Heidelberg (2005)
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
Sangiorgi, D.: On the Bisimulation Proof Method. Journal of Mathematical Structures in Computer Science 8, 447–479 (1998)
Sangiorgi, D., Milner, R.: The problem of Weak Bisimulation up to. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 32–46. Springer, Heidelberg (1992)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pous, D. (2006). Weak Bisimulation Up to Elaboration. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_26
Download citation
DOI: https://doi.org/10.1007/11817949_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)