The wreath product and its applications
Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Initial Algebra and Final Coalgebra Semantics for Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Category Theory and Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Coalgebra, concurrency, and control
Coalgebra, concurrency, and control
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
On the final sequence of a finitary set functor
Theoretical Computer Science
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
| Hi-index | 0.00 |
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.