The use of coalgebras for the specification of dynamical systems with a hidden state space is receiving more and more attention in the years, as a valid alternative to algebraic methods based on observational equivalences. However, to our knowledge, the coalgebraic framework is still lacking a complete equational deduction calculus which enjoys properties similar to those stated in Birkhoff’s completeness theorem for the algebraic case. In this paper we present a sound and complete equational calculus for a restricted class of coalgebras. We compare our notion of coalgebraic equation to others in the literature, and we hint at possible extensions of our framework.
CITATION STYLE
Corradini, A. (1998). A completeness result for equational deduction in coalgebraic specification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1376, pp. 190–205). Springer Verlag. https://doi.org/10.1007/3-540-64299-4_34
Mendeley helps you to discover research relevant for your work.