On the proof method for bisimulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 969, Issue , 1995, Pages 479-488

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; PROOF METHODS;

ARTIFICIAL INTELLIGENCE;

EID: 84947906179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60246-1_153     Document Type: Conference Paper

References (14)

1. S. Abramsky. The lazy laxabda calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison-Wesley, 1989.
2. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't' be traced: preliminary report. In 15th POPL, 1988.
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.
4. D. Caucal. Graphes canoniques de graphes alg6briques. Informatique Thdorique et Applications (RAIRO), 24(4):339-352, 1990.
5. R. De Simone. Higher level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245-267, 1985.
6. J.F. Groote. Transition system specifications with negative premises. In Proe. CONCUR '90, LNCS 458, 1990.
7. J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202-260, 1992.
8. K.G. Laxsen and X. Liu. Compositionality through an operational semantics of contexts. J. Logic Computat., 1(6):761-795, 1991.
9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
10. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1-77, 1992.
11. R. Milner and M. Torte. Co-induction in relational semantics. Theoretical Computer Science, 87:209-220, 1991.
12. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992.
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 craa.cma.fr as pub/papers/davide/bis-proof, ps.
14. Z. D. Sangiorgi. Lazy functions and mobile processes. Technical Report RR- 2515, INRIA-Sophia Antipolis, 1995. available via anonymous ftp from cma.cma.fraspub/papers/davide/RR-2515.ps. Z.