DocumentCode
1955190
Title
An axiomatics for categories of transition systems as coalgebras
Author
Power, Jonathan
fYear
1998
fDate
21-24 Jun 1998
Firstpage
207
Lastpage
213
Abstract
We consider a finitely branching transition system as a coalgebra for an endofunctor on the category Set of small sets. A map in that category is a functional bisimulation. So, we study the structure of the category of finitely branching transition systems and functional bisimulations by proving general results about the category H-Coalg of H-coalgebras for an endofunctor H on Set. We give conditions under which H-Coalg is complete, cocomplete, symmetric monoidal closed, regular, and has a subobject classifier
Keywords
category theory; process algebra; category H-Coalg; coalgebra; finitely branching; functional bisimulation; subobject classifier; symmetric monoidal; transition system; Automata; Computer languages; Jacobian matrices; Laboratories; Logic programming; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
Conference_Location
Indianapolis, IN
ISSN
1043-6871
Print_ISBN
0-8186-8506-9
Type
conf
DOI
10.1109/LICS.1998.705657
Filename
705657
Link To Document