Author:
HANSEN HELLE HVID,KLIN BARTEK
Abstract
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor Σ over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification ρ that defines operations σ on a final F-coalgebra, we can systematically construct a GSOS specification ρ that defines the pointwise extension σ of σ on a final FA-coalgebra. The construction relies on the addition of a family of auxiliary ‘buffer’ operations to the syntax. These buffer operations depend only on A, so the construction is uniform for all σ and F.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bisimilarity of open terms in stream GSOS;Science of Computer Programming;2019-03
2. Path Category for Free;Lecture Notes in Computer Science;2019
3. Bisimilarity of Open Terms in Stream GSOS;Fundamentals of Software Engineering;2017
4. STREAM DIFFERENTIAL EQUATIONS: SPECIFICATION FORMATS AND SOLUTION METHODS;LOG METH COMPUT SCI;2017
5. Presenting Distributive Laws;Logical Methods in Computer Science;2015-08-07