Reactive Systems over Cospans


Sassone, V. and Sobocinski, P. (2005) Reactive Systems over Cospans. In, 20th Symposium on Logic in Computer Science, LICS 2005. IEEE Computer Society Press, 311-320.

Download

[img] PDF
Download (524Kb)

Description/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 se- mantics. 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 bicol- imits in a class of bicategories of cospans. The construction sheds light on as well as extends Ehrig and K ̈onig’s rewrit- ing via borrowed contexts and opens the way to a unified treatment of several applications.

Item Type: Conference or Workshop Item (Paper)
ISBNs: 0769522661
Keywords: graph rewriting, contextual equivalences, bisimulation congruences, observational equivalences, bicategories, grpos
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 262303
Date Deposited: 11 Apr 2006
Last Modified: 27 Mar 2014 20:05
Publisher: IEEE Computer Society Press
Further Information:Google Scholar
ISI Citation Count:17
URI: http://eprints.soton.ac.uk/id/eprint/262303

Actions (login required)

View Item View Item