Beyond Bisimulation: The “up-to” Techniques

  • Davide Sangiorgi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4111)


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.


Label Transition System Process Algebra Abstract Machine Proof Method Respectful Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AKH92]
    Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 29, 737–760 (1992)MATHCrossRefMathSciNetGoogle Scholar
  2. [BK84]
    Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Computation 60, 109–137 (1984)MATHMathSciNetGoogle Scholar
  3. [BS98]
    Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π-calculus. Acta Informatica 35, 353–400 (1998)MATHCrossRefMathSciNetGoogle Scholar
  4. [CG98]
    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)CrossRefGoogle Scholar
  5. [GV92]
    Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation 100, 202–260 (1992)MATHCrossRefMathSciNetGoogle Scholar
  6. [Hir98]
    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)Google Scholar
  7. [Hir99]
    Hirschkoff, D.: Mise en oeuvre de preuves de bisimulation. PhD thesis, Phd Thesis, Ecole Nationale des Ponts et Chauss (1999) Google Scholar
  8. [HPS05]
    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)CrossRefGoogle Scholar
  9. [Mil89]
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)MATHGoogle Scholar
  10. [Mil99]
    Milner, R.: Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, Cambridge (1999)Google Scholar
  11. [MZN05]
    Merro, M., Zappa Nardelli, F.: Behavioural theory for mobile ambients. Journal of the ACM (to appear, 2005)Google Scholar
  12. [Pou05]
    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)CrossRefGoogle Scholar
  13. [San92]
    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)Google Scholar
  14. [San96]
    Sangiorgi, D.: Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science 155, 39–83 (1996)MATHCrossRefMathSciNetGoogle Scholar
  15. [San98]
    Sangiorgi, D.: On the bisimulation proof method. Journal of Mathematical Structures in Computer Science 8, 447–479 (1998)MATHCrossRefMathSciNetGoogle Scholar
  16. [SM92]
    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)CrossRefGoogle Scholar
  17. [SW01]
    Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Davide Sangiorgi
    • 1
  1. 1.Università di BolognaItaly

Personalised recommendations