Observational Coalgebras and Complete Sets of Co-operations

Authors:
Clemens Kupke;Jan Rutten
Affiliations:
CWI & Vrije Universiteit, Amsterdam, The Netherlands;CWI & Vrije Universiteit, Amsterdam, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 7
Cited 2

Terminal coalgebras in well-founded set theory

Theoretical Computer Science
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
A coalgebraic equational approach to specifying observational structures

Theoretical Computer Science
Calculus in Coinductive Form

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A coinductive calculus of streams

Mathematical Structures in Computer Science
Behavioural differential equations and coinduction for binary trees

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Productivity of stream definitions

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Bisimulations Generated from Corecursive Equations

Electronic Notes in Theoretical Computer Science (ENTCS)
Complete sets of cooperations

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce the notion of an observational coalgebra structure and of a complete set of co-operations. We demonstrate in various example the usefulness of these notions, in particular, we show how they give rise to coalgebraic proof and definition principles.