The University of Southampton
University of Southampton Institutional Repository

Deriving weak bisimulation congruences from reduction systems

Deriving weak bisimulation congruences from reduction systems
Deriving weak bisimulation congruences from reduction systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by LTSs whose labels model the possible interactions with the environment; (ii) their abstract semantics is conveniently expressed by observational congruences. However, many current-day process calculi are more easily equipped with reduction semantics, which focus on their internal dynamics but where the notion of observable action is missing. Recent techniques attempted to bridge this gap by synthesizing LTSs whose labels are process contexts that catalyze reactions and for which bisimulation is a congruence. Starting from Sewell's set-theoretic construction, category theoretic techniques were developed to define minimal LTS based on Leifer and Milner's relative pushouts, later refined by Sassone and the fourth author to deal with structural congruences given as groupoidal 2-categories. The paper aims at proving that double categories provide an even more suitable formalism for the synthesis of LTSs, as well as for congruence proofs. Albeit the framework is more sophisticated, constructions hard to phrase in set-theoretic settings become more general and intuitive, and in the end simpler. Moreover, the formalism allows for a straightforward definition of weak bisimulation congruence, not available in previous approaches.
weak bisimulation, tile systems, relative pushouts, reduction semantics, labelled transitions
3-540-28309-9
293-307
Bruni, R
cf20752b-abdc-4794-97d0-af30f8544a6f
Gadducci, F
edc4d7f1-ffcc-42a8-9718-2eb7343601dc
Montanari, U
c7cf3956-f5c3-4364-98ad-7cc6add41519
Sobocinski, P
085fc938-b229-461f-90e3-9b7706c344da
Abadi, M
fef19f9d-090d-440e-ad14-acbef60513f2
de Alfaro, L
334e13b7-9796-4e35-a68b-8dc1fc39642f
Bruni, R
cf20752b-abdc-4794-97d0-af30f8544a6f
Gadducci, F
edc4d7f1-ffcc-42a8-9718-2eb7343601dc
Montanari, U
c7cf3956-f5c3-4364-98ad-7cc6add41519
Sobocinski, P
085fc938-b229-461f-90e3-9b7706c344da
Abadi, M
fef19f9d-090d-440e-ad14-acbef60513f2
de Alfaro, L
334e13b7-9796-4e35-a68b-8dc1fc39642f

Bruni, R, Gadducci, F, Montanari, U and Sobocinski, P (2005) Deriving weak bisimulation congruences from reduction systems. Abadi, M and de Alfaro, L (eds.) Concur, United States. 23 - 26 Aug 2005. pp. 293-307 .

Record type: Conference or Workshop Item (Paper)

Abstract

The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by LTSs whose labels model the possible interactions with the environment; (ii) their abstract semantics is conveniently expressed by observational congruences. However, many current-day process calculi are more easily equipped with reduction semantics, which focus on their internal dynamics but where the notion of observable action is missing. Recent techniques attempted to bridge this gap by synthesizing LTSs whose labels are process contexts that catalyze reactions and for which bisimulation is a congruence. Starting from Sewell's set-theoretic construction, category theoretic techniques were developed to define minimal LTS based on Leifer and Milner's relative pushouts, later refined by Sassone and the fourth author to deal with structural congruences given as groupoidal 2-categories. The paper aims at proving that double categories provide an even more suitable formalism for the synthesis of LTSs, as well as for congruence proofs. Albeit the framework is more sophisticated, constructions hard to phrase in set-theoretic settings become more general and intuitive, and in the end simpler. Moreover, the formalism allows for a straightforward definition of weak bisimulation congruence, not available in previous approaches.

Full text not available from this repository.

More information

Published date: 2005
Additional Information: Event Dates: August 23-26, 2005
Venue - Dates: Concur, United States, 2005-08-23 - 2005-08-26
Keywords: weak bisimulation, tile systems, relative pushouts, reduction semantics, labelled transitions
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 263496
URI: https://eprints.soton.ac.uk/id/eprint/263496
ISBN: 3-540-28309-9
PURE UUID: c5f1d9a3-541a-4e9d-a217-0c6516a2c146

Catalogue record

Date deposited: 19 Feb 2007
Last modified: 18 Jul 2017 07:45

Export record

Contributors

Author: R Bruni
Author: F Gadducci
Author: U Montanari
Author: P Sobocinski
Editor: M Abadi
Editor: L de Alfaro

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×