Barbed Bisimulation

Barbed Bisimulation (1992)

Cached

Download Links

[ftp-sop.inria.fr]

Other Repositories/Bibliography

DBLP

by Robin Milner , Davide Sangiorgi , Edinburgh Eh Jz

Citations:

192 - 18 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Barbed Bisimulation	user correction - Legacy Corrections
AUTHOR NAME	Robin Milner	SVM HeaderParse 0.1
AUTHOR AFFIL	Laboratory for Foundations of Computer Science; Department of Computer Science	SVM HeaderParse 0.2
AUTHOR NAME	Davide Sangiorgi	SVM HeaderParse 0.1
AUTHOR AFFIL	Laboratory for Foundations of Computer Science; Department of Computer Science	SVM HeaderParse 0.2
AUTHOR NAME	Edinburgh Eh Jz	SVM HeaderParse 0.1
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 formulation the familiar congruences which are based upon a labelled transition system. It turns out that this is not a trivial problem. We tackle it in this paper for the simple case of CCS and strong observational equivalence (). Because the reduction relation coincides with the silent action \Gamma! of the labelled transition system (as mentioned above), we can remain within the latter framework. But we wish to retain the spirit of the reduction semantics as far as possible, in the sense that we wish t...	user correction - Legacy Corrections
YEAR	1992	user correction - Legacy Corrections
CITATIONS	12 found	ParsCit 1.0