DocumentCode :
3619709
Title :
Reactive systems over cospans
Author :
V. Sassone;P. Sobocinski
Author_Institution :
Sussex Univ., Brighton, UK
fYear :
2005
fDate :
6/27/1905 12:00:00 AM
Firstpage :
311
Lastpage :
320
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 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.
Keywords :
"Computer science","Bipartite graph","Concurrent computing","Computer security","National security","Mobile computing","Computer architecture","Algebra","Logic"
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on
ISSN :
1043-6871
Print_ISBN :
0-7695-2266-1
Type :
conf
DOI :
10.1109/LICS.2005.40
Filename :
1509235
Link To Document :
بازگشت