License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2017.24
URN: urn:nbn:de:0030-drops-80444
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8044/
Urbat, Henning
Finite Behaviours and Finitary Corecursion
Abstract
In the coalgebraic approach to state-based systems, semantics is captured up to behavioural equivalence by special coalgebras such as the final coalgebra, the final locally finitely presentable coalgebra (Adámek, Milius, and Velebil), or the final locally finitely generated coalgebra (Milius, Pattinson, and Wißmann). The choice of the proper semantic domain is determined by finiteness restrictions imposed on the systems of interest. We propose a unifying perspective by introducing the concept of a final locally (I,M)-presentable coalgebra, where the two parameters I and M determine what a "finite" system is. Under suitable conditions on the categories and type functors, we show that the final locally (I,M)-presentable coalgebra exists and coincides with the initial (I,M)-iterative algebra, thereby putting a common roof over several results on iterative, fg-iterative and completely iterative algebras that were given a separate treatment before.
BibTeX - Entry
@InProceedings{urbat:LIPIcs:2017:8044,
author = {Henning Urbat},
title = {{Finite Behaviours and Finitary Corecursion}},
booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
pages = {24:1--24:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-033-0},
ISSN = {1868-8969},
year = {2017},
volume = {72},
editor = {Filippo Bonchi and Barbara K{\"o}nig},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8044},
URN = {urn:nbn:de:0030-drops-80444},
doi = {10.4230/LIPIcs.CALCO.2017.24},
annote = {Keywords: Iterative algebra, completely iterative algebra, fg-iterative algebra, rational fixpoint, terminal coalgebra, iterative monad}
}
Keywords: |
|
Iterative algebra, completely iterative algebra, fg-iterative algebra, rational fixpoint, terminal coalgebra, iterative monad |
Collection: |
|
7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
17.11.2017 |