Deriving Bisimulation Congruences: 2-categories vs precategories
Deriving Bisimulation Congruences: 2-categories vs precategories
G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner’s approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of ‘bunches and wirings.’ We then examine the approach based on Milner’s precategories and Leifer’s functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs.
bisimulation congruences, labelled transition systems, observational equivalences, coinduction principles
3-540-00897-7
409-424
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Sobocinski, P.
439334ab-2826-447b-9fe5-3928be3fd4fd
2003
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Sobocinski, P.
439334ab-2826-447b-9fe5-3928be3fd4fd
Sassone, V. and Sobocinski, P.
(2003)
Deriving Bisimulation Congruences: 2-categories vs precategories.
Foundations of Software Science and Computation Structures, FOSSACS 2003..
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner’s approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of ‘bunches and wirings.’ We then examine the approach based on Milner’s precategories and Leifer’s functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs.
Text
bunFOSSACSoff.pdf
- Other
More information
Published date: 2003
Venue - Dates:
Foundations of Software Science and Computation Structures, FOSSACS 2003., 2003-01-01
Keywords:
bisimulation congruences, labelled transition systems, observational equivalences, coinduction principles
Organisations:
Web & Internet Science, Electronic & Software Systems
Identifiers
Local EPrints ID: 262292
URI: http://eprints.soton.ac.uk/id/eprint/262292
ISBN: 3-540-00897-7
PURE UUID: 7939ce4a-7297-4a6d-930e-622b8555d679
Catalogue record
Date deposited: 11 Apr 2006
Last modified: 10 Sep 2024 01:40
Export record
Contributors
Author:
V. Sassone
Author:
P. Sobocinski
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