Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1995: Mathematical Foundations of Computer Science 1995 pp 479–488Cite as

On the proof method for bisimulation

Extended abstract

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 969))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison-Wesley, 1989.

    Google Scholar 

  2. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't' be traced: preliminary report. In 15th POPL, 1988.

    Google Scholar 

  3. M. Boreale and D. Sangiorgi. A fully abstract semantics for causality in the π-calculus. Technical Report ECS-LFCS-94-297, Edinburgh Univ., 1994. An extract in proc. STACS'95, LNCS 900.

    Google Scholar 

  4. D. Caucal. Graphes canoniques de graphes algébriques. Informatique Théorique et Applications (RAIRO), 24(4):339–352, 1990.

    Google Scholar 

  5. R. De Simone. Higher level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245–267, 1985.

    Article  Google Scholar 

  6. J.F. Groote. Transition system specifications with negative premises. In Proc. CONCUR '90, LNCS 458, 1990.

    Google Scholar 

  7. J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202–260, 1992.

    Article  Google Scholar 

  8. K.G. Larsen and X. Liu. Compositionality through an operational semantics of contexts. J. Logic Computat., 1(6):761–795, 1991.

    Google Scholar 

  9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  10. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.

    Article  Google Scholar 

  11. R. Milner and M. Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87:209–220, 1991.

    Google Scholar 

  12. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992.

    Google Scholar 

  13. D. Sangiorgi. On the bisimulation proof method. Technical Report ECS-LFCS-94-299, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1994. Revised version available via anonymous ftp from cma.cma.fr as pub/papers/davide/bis-proof.ps.Z.

    Google Scholar 

  14. D. Sangiorgi. Lazy functions and mobile processes. Technical Report RR-2515, INRIA-Sophia Antipolis, 1995. available via anonymous ftp from cma.cma.fr as pub/papers/davide/RR-2515.ps.Z.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Sophia Antipolis, France

    Davide Sangiorgi

Authors
  1. Davide Sangiorgi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Wiedermann Petr Hájek

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sangiorgi, D. (1995). On the proof method for bisimulation. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_153

Download citation

  • DOI: https://doi.org/10.1007/3-540-60246-1_153

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60246-0

  • Online ISBN: 978-3-540-44768-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation