Reactive Systems over Cospans
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for semantic models with an underlying reduction semantics. The derivation procedure requires the presence of certain colimits (or, more usually and generally, bicolimits) which need to be constructed separately within each model. In this paper, we offer a general construction of such bicolimits in a class of bicategories of cospans. The construction sheds light on as well as extends Ehrig and Konig’s rewriting via borrowed contexts and opens the way to a unified treatment of several applications.
graph rewriting, contextual equivalences, bisimulation congruences, observational equivalences, bicategories, grpos
0-7695-2266-1
311-320
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Sobocinski, P.
439334ab-2826-447b-9fe5-3928be3fd4fd
2005
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Sobocinski, P.
439334ab-2826-447b-9fe5-3928be3fd4fd
Sassone, V. and Sobocinski, P.
(2005)
Reactive Systems over Cospans.
20th Symposium on Logic in Computer Science, LICS 2005..
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for semantic models with an underlying reduction semantics. The derivation procedure requires the presence of certain colimits (or, more usually and generally, bicolimits) which need to be constructed separately within each model. In this paper, we offer a general construction of such bicolimits in a class of bicategories of cospans. The construction sheds light on as well as extends Ehrig and Konig’s rewriting via borrowed contexts and opens the way to a unified treatment of several applications.
Text
newgraphsLICSoff.pdf
- Other
More information
Published date: 2005
Venue - Dates:
20th Symposium on Logic in Computer Science, LICS 2005., 2005-01-01
Keywords:
graph rewriting, contextual equivalences, bisimulation congruences, observational equivalences, bicategories, grpos
Organisations:
Web & Internet Science, Electronic & Software Systems
Identifiers
Local EPrints ID: 262303
URI: http://eprints.soton.ac.uk/id/eprint/262303
ISBN: 0-7695-2266-1
PURE UUID: 3b3edc3b-68d7-46f2-b4bb-3dc734984d3d
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