Abstract
We present a new uniform definition of reduction-based semantics for different process calculi, called indexed reduction equivalence (or congruence). We prove that early bisimulation coincides with indexed reduction equivalence for π -calculus, context bisimulation coincides with indexed reduction equivalence for higher order π -calculus and indexed reduction congruence is strictly finer than contextual barbed congruence for Safe Mobile Ambients.
This work was supported by the National Science Fund of China.
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
Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science 114, 31–61 (1993)
Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 152(2), 437–486 (1995)
Levi, F., Sangiorgi, D.: Controlling interference in Ambients. In: Proc. POPL 2000, Boston, Massachusetts, January 19-21, pp. 352–364 (2000)
Merro, M., Hennessy, M.: Bisimulation congruences in Safe Ambients. Computer Science Report 5/01; An extended abstract appear in Proc. POPL (2002)
Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for Mobile Ambients. Technical Report COGS 01 (2003)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Part I and II). Information and Computation 100, 1–77 (1992)
Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D thesis, Department of Computer Science, University of Einburgh (1992)
Sangiorgi, D.: Bisimulation in higher-order calculi. Information and Computation 131(2) (1996)
Sangiorgi, D., Walker, D.: The π-calculus: a theory of mobile processes. Cambridge University Press, Cambridge (2001)
Vigliotti, M.G., Phillips, I.: Barbs and congruences for Safe Mobile Ambients. In: Foundations of Wide Area Network Computing (July 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, Z. (2004). A Uniform Reduction Equivalence for Process Calculi. In: Chin, WN. (eds) Programming Languages and Systems. APLAS 2004. Lecture Notes in Computer Science, vol 3302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30477-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30477-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23724-2
Online ISBN: 978-3-540-30477-7
eBook Packages: Springer Book Archive