Davide Sangiorgi  Home/Search
Context Related
| sop.inria.fr/meije/the...bisproof.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math...tpsop.inria.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The most popular method for establishing bisimilarities among processes is to exhibit bisimulation relations. By definition, R is a bisimulation relation if R progresses to R itself, i.e., pairs of processes in R can match each other's actions and their derivatives are again in R. We study generalisations of the method aimed at reducing the size of the relations to exhibit and hence relieving the proof work needed to establish bisimilarity results. We allow a relation R to progress to a... (Update)
Cited by: More
Towards Operational Semantics of Contexts in Functional Languages - Sands (Correct)
On the Mechanized Verification of Infinite Systems - Röckl, Esparza (Correct)
Generalised Coinduction - Bartels (2000) (Correct)
Similar documents (at the sentence level):
61.9%: On the Bisimulation Proof Method - Sangiorgi (1994) (Correct)
Active bibliography (related documents): More All
0.3: Asynchronous process calculi: the first-order and higher-order.. - Sangiorgi (1999) (Correct)
0.3: Interpreting Functions as π-Calculus Processes: A Tutorial - Sangiorgi (1999) (Correct)
0.3: Locality and Polyadicity in Asynchronous Name-Passing Calculi - Merro (2000) (Correct)
Similar documents based on text: More All
0.3: Some Congruence Properties for π-calculus Bisimilarities - Boreale, Sangiorgi (1996) (Correct)
0.2: Bisimulation for Higher-Order Process Calculi - Sangiorgi (1996) (Correct)
0.2: π-Calculus, Internal Mobility, and Agent-Passing Calculi - Sangiorgi (1995) (Correct)
Related documents from co-citation: More All
13: Towards a mathematical operational semantics - Turi, Plotkin - 1997
12: From Set-theoretic Coinduction to Coalgebraic Coinduction: some results - Lenisa - 1999
11: Universal coalgebra: a theory of systems - Rutten - 1999
BibTeX entry: (Update)
D. Sangiorgi. On the bisimulation proof method. Technical report, University of Edinburgh, 1994. http://citeseer.ist.psu.edu/sangiorgi94bisimulation.html More
@article{ sangiorgi98bisimulation,
author = "Davide Sangiorgi",
title = "On the bisimulation proof method",
journal = "Mathematical Structures in Computer Science",
volume = "8",
number = "5",
pages = "447--479",
year = "1998",
url = "citeseer.ist.psu.edu/sangiorgi94bisimulation.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
906 A structural approach to operational semantics - Plotkin - 1981
854 Information and Computation (context) - Milner, Parrow et al. - 1992
357 Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985
248 Expressing Mobility (context) - Sangiorgi - 1992
218 Process algebra for synchronous communication (context) - Bergstra, Klop - 1984
179 The lazy lambda calculus - Abramsky - 1989
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
102 Bisimulation equivalence is decidable for all contextfree pr.. - Christensen, ttel et al. - 1995
84 A domain equation for bisimulation (context) - Abramsky - 1991
66 Compositionality through an operational semantics of context.. (context) - Larsen, Liu - 1991
54 Testing equivalence for mobile processes (context) - Boreale, De Nicola - 1995
48 Higher level synchronising devices in MEIJE-SCCS (context) - De Simone - 1985
46 Calculi for Higher Order Communicating Systems (context) - Thomsen - 1990
42 Algebraic theories for name-passing calculi - Parrow, Sangiorgi - 1995
37 A coinduction principle for recursive data types based on bi.. - Fiore - 1993
30 Locality and non-interleaving semantics in calculi for mobil.. - Sangiorgi - 1996
23 Bisimulation from open maps - Joyal, Nielsen et al. - 1994
23 Transition system specications with negative premises (context) - Groote - 1990
18 A polynomial-time algorithm for deciding bisimulation equiva.. - Hirshfeld, Jerrum et al. - 1996
18 calculus with explicit substitutions (context) - Ferrari, Montanari et al. - 1996
12 A fully abstract semantics for causality in the -calculus (context) - Boreale, Sangiorgi - 1995
9 Algebraic proofs of properties of objects (context) - Walker - 1994
7 The problem of iWeak Bisimulation up toj (context) - Sangiorgi, Milner - 1992
5 To appear in iFestschrift volume in honor of Robin Milner's .. (context) - Sangiorgi, mobile et al. - 1995
2 CSLI lecture notes; no (context) - Aczel - 1988
1 Graphes canoniques de graphes alg#briques (context) - Caucal - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp-sop.inria.fr.html): More
RC Semantics using Rewriting Rules - Boussinot (1992) (Correct)
ASAP - a protocol for symbolic computation systems - Dalmas, Gaëtano, Sausse (1994) (Correct)
Tracking medical 3D data with a deformable parametric model - Bardinet, Cohen, Ayache (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC