(Enter summary)
Abstract: Machine [8]. In this technique, axioms for a structural congruence relation
are introduced prior to the reduction system, in order to to break a rigid,
geometrical vision of concurrency; then reduction rules can easily be presented
in which redexes are indeed subterms again. It can then be shown
1
that modulo structural congruence the reduction relation exactly represents
the silent action of the transition semantics.
It is left as an open problem in [11] how to recover from such a... (Update)
Cited by: More
From Rewrite Rules to Bisimulation - Congruences Peter Sewell
(Correct)
Unknown -
(Correct)
A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998)
(Correct)
Active bibliography (related documents): More All
0.3: A Semantic Theory for Value-Passing Processes Based on the.. - Ingolfsdottir (2003)
(Correct)
0.3: A Semantic Theory for Value-Passing Processes Late.. -.. (1995)
(Correct)
0.0: Description and Verification of Mobile Processes with Graph.. - König
(Correct)
Similar documents based on text: More All
0.1: On Bisimulations for the Asynchronous π-Calculus - Amadio, Castellani, Sangiorgi (1996)
(Correct)
0.1: On Asynchrony in Name-Passing Calculi - Merro, Sangiorgi (1998)
(Correct)
0.1: On Equators in Asynchronous Name-passing Calculi without Matching.. - Merro (1999)
(Correct)
Related documents from co-citation: More All
64: Information and Computation (context) - Milner, Parrow et al. - 1992
53: Expressing Mobility (context) - Sangiorgi - 1993
43: Communication and Concurrency (context) - Milner - 1989
BibTeX entry: (Update)
R. Milner and D. Sangiorgi. Barbed bisimulation. In SLNCS 623: Proceedings of ICALP 92. Springer-Verlag, 1992. http://citeseer.ist.psu.edu/milner92barbed.html More
@inproceedings{ milner92barbed,
author = "Robin Milner and Davide Sangiorgi",
title = "Barbed Bisimulation",
booktitle = "Proceedings {ICALP} '92",
volume = "623",
publisher = "Springer-Verlag",
address = "Vienna",
pages = "685--695",
year = "1992",
url = "citeseer.ist.psu.edu/milner92barbed.html" }
Citations (may not include all citations):
484
A Calculus of Communicating Systems (context) - Milner - 1989
315
Information Processing Systems - Open System Interconnection (context) - DIS - 1987
194
Functions as Processes (context) - Milner - 1990
182
Structured Operational Semantics and Bisimulation as a Congr.. (context) - Groote, Vaandrager ACM DBLP
179
The Lazy Lambda Calculus
- Abramsky - 1988
159
The Chemical Abstract Machine (context) - Berry, Boudol - 1990
137
Laboratory for Foundations of Computer Science (context) - Milner, Parrow et al.
137
Laboratory for Foundations of Computer Science (context) - Milner, Parrow et al.
84
Transition System Specifications with Negative Premises (context) - Groote
56
INRIA-Sophia Antipolis (context) - Boudol, for - 1991
3
Department of Computing (context) - Thomsen - 1989
1
Computer Science Department (context) - Sangiorgi
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