On bisimulation in the pi-calculus
UNSPECIFIED (1994) On bisimulation in the pi-calculus. In: 5th International Conference on Theory of Concurrency (CONCUR 94), AUG 22-25, 1994, UPPSALA, SWEDEN.Full text not available from this repository.
Results concerning bisimulation equivalences in the (polyadic) pi-calculus are presented. It is shown that on the restriction-free fragment of the calculus, open bisimilarity coincides with dynamic barbed bisimilarity in ail (restriction-free) pi-contexts, and also with barbed bisimilarity in the class of contexts obtained by adding a new operator. It is further shown that the first characterization does not extend to the full pi-calculus, but that by introducing a distinction-indexed family of new operators, an analogue of the second result can be obtained for indexed open bisimilarity.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||CONCUR '94: CONCURRENCY THEORY|
|Editor:||Jonsson, B and Parrow, J|
|Number of Pages:||16|
|Page Range:||pp. 315-330|
|Title of Event:||5th International Conference on Theory of Concurrency (CONCUR 94)|
|Location of Event:||UPPSALA, SWEDEN|
|Date(s) of Event:||AUG 22-25, 1994|
Actions (login required)