Advertisement

On the proof method for bisimulation

Extended abstract
  • Davide Sangiorgi
Contributed Papers Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)

Keywords

Complete Lattice Operational Semantic Transitive Closure Transition Rule Label Transition System 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Abr89]
    S. Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison-Wesley, 1989.Google Scholar
  2. [BIM88]
    B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't' be traced: preliminary report. In 15th POPL, 1988.Google Scholar
  3. [BS94]
    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. [Cau90]
    D. Caucal. Graphes canoniques de graphes algébriques. Informatique Théorique et Applications (RAIRO), 24(4):339–352, 1990.Google Scholar
  5. [DS85]
    R. De Simone. Higher level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245–267, 1985.CrossRefGoogle Scholar
  6. [Gro90]
    J.F. Groote. Transition system specifications with negative premises. In Proc. CONCUR '90, LNCS 458, 1990.Google Scholar
  7. [GV92]
    J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202–260, 1992.CrossRefGoogle Scholar
  8. [LL91]
    K.G. Larsen and X. Liu. Compositionality through an operational semantics of contexts. J. Logic Computat., 1(6):761–795, 1991.Google Scholar
  9. [Mil89]
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  10. [MPW92]
    R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.CrossRefGoogle Scholar
  11. [MT91]
    R. Milner and M. Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87:209–220, 1991.Google Scholar
  12. [San92]
    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. [San94]
    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. [San95]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Davide Sangiorgi
    • 1
  1. 1.INRIA-Sophia AntipolisFrance

Personalised recommendations