Abstract
We consider the bisimulation proof method – an instance of the co-induction proof method – that is at the heart of the success of bisimulation. We discuss a number of enhancements of the method and some open problems.
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, 737–760 (1992)
Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Computation 60, 109–137 (1984)
Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π-calculus. Acta Informatica 35, 353–400 (1998)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation 100, 202–260 (1992)
Hirschkoff, D.: Automatically proving up to bisimulation. In: Jancar, P., Kretinsky, M. (eds.) Proceedings of MFCS 1998 Workshop on Concurrency, Brno, Czech Republic, ENTCS, vol. 18. Elsevier Science Publishers, Amsterdam (1998)
Hirschkoff, D.: Mise en oeuvre de preuves de bisimulation. PhD thesis, Phd Thesis, Ecole Nationale des Ponts et Chauss (1999)
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)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R.: Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, Cambridge (1999)
Merro, M., Zappa Nardelli, F.: Behavioural theory for mobile ambients. Journal of the ACM (to appear, 2005)
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)
Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST–99–93, Department of Computer Science, University of Edinburgh (1992)
Sangiorgi, D.: Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science 155, 39–83 (1996)
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
Sangiorgi, D. (2006). Beyond Bisimulation: The “up-to” Techniques. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2005. Lecture Notes in Computer Science, vol 4111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11804192_8
Download citation
DOI: https://doi.org/10.1007/11804192_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36749-9
Online ISBN: 978-3-540-36750-5
eBook Packages: Computer ScienceComputer Science (R0)