On the Bisimulation Proof Method

On the Bisimulation Proof Method (1994)

Cached

Download Links

by Davide Sangiorgi

Venue:	JOURNAL OF MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
Citations:	64 - 2 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	On the bisimulation proof method	INFERENCE
AUTHOR NAME	Davide Sangiorgi	SVM HeaderParse 0.1
AUTHOR AFFIL	INRIA Sophia Antipolis	SVM HeaderParse 0.2
AUTHOR ADDR	2004 Rue des Lucioles, B.P. 93,	SVM HeaderParse 0.1
AUTHOR NAME	F- Sophia	SVM HeaderParse 0.1
AUTHOR NAME	Antipolis Cedex	SVM HeaderParse 0.1
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 different relation F(R), where F is a function on relations. Functions which can be safely used in this way (i.e., such that if R progresses to F(R), then R only includes pairs of bisimilar processes) are sound. We give a simple condition which ensures soundness. We show that the class of sound functions contains non-trivial functions and we study the closure properties of the class w.r.t. various important function constructors, like composition, union and iteration. These properties allow us to construct sophisticated sound functions--- and hence sophisticated proof techniques for bisimilarity--- from simpler ones. The usefulness of our proof techniques is supported by various non-trivial examples drawn from the process algebras CCS and-calculus. They include the proof of the unique solution of equations and the proof of a few properties of the replication operator. Among these, there is a novel result which justifies the adoption of a simple form of prefix-guarded replication as the only form of replication in the-calculus.	SVM HeaderParse 0.1
YEAR	1998	INFERENCE
VENUE	Journal of Mathematical Structures in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	479--488	INFERENCE
VOLUME	8	INFERENCE
CITATIONS	9 found	ParsCit 1.0