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 colimi...

Full description

Saved in:
Bibliographic Details
Main Authors: Sassone, V., Sobocinski, P.
Format: Conference Proceeding
Language:English
Subjects:
Algebra
Bipartite graph
Computer architecture
Computer science
Computer security
Concurrent computing
Logic
Mobile computing
National security
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 bicategones 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.
ISSN:1043-6871
2575-5528
DOI:10.1109/LICS.2005.40