Abstract
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.
Research carried on while the author was visiting the CWI, Amsterdam, supported by the EC Fixed Contribution Contract n. EBRFMBICT960840.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Barr. Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci., 114:299–315, 1993.
M. Bidoit, R. Hennicker, and M. Wirsing. Behavioural and Abstractor Specifications. Science of Computer Programming, 25:146–186, 1995.
A. Corradini. A Complete Calculus for Equational Deduction in Coalgebraic Specification. Technical Report SEN-R9723, CWI, Amsterdam, 1997.
U. Hensel and H. Reichel. Defining equations in terminal coalgebras. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data, Type Specification, volume 906 of LNCS, pages 307-318. Springer Verlag, 1995.
U. Hensel and D. Spooner. A view on implementing processes: Categories of circuits. In M. Haveraaen, O. Owe, and O. Dahl, editors, Recent Trends in Data Types Specification, volume 1130 of LNCS, pages 237–255. Springer Verlag, 1995.
B. Jacobs. Inheritance and cofree constructions. In P. Cointe, editor, European Conference on object-oriented programming, volume 1098 of LNCS, pages 210–231. Springer Verlag, 1996.
B. Jacobs. Objects and classes, co-algebraically. In B. Freitag, C.B. Jones, C. Lengauer, and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83–103. Kluwer Acad. Publ., 1996.
B. Jacobs. Invariants, Bisimulations and the Correctness of Coalgebraic Refinement. In Proceedings AMAST'97, LNCS. Springer Verlag, 1997.
L.S. Moss. Coalgebraic Logic. Annals of Pure and Applied Logic, 1997. To appear.
F. Orejas, M. Navarro, and A. Sanchez. Implementation and behavioural equivalence: a survey. In M. Bidoit and C. Choppy, editors, Recent Trends in Data Type Specification, volume 655 of LNCS, pages 93–125. Springer Verlag, 1993.
H. Reichel. An Approach to Object Semantics based on Terminal Coalgebras. Mathematical Structures in Computer Science, 5:129–152, 1995.
J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, 1996.
A. Selman. Completeness of calculii for axiomatically defined classes of algebras. Algebra Universalis, 2:20–32, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, A. (1998). A completeness result for equational deduction in coalgebraic specification. In: Presicce, F.P. (eds) Recent Trends in Algebraic Development Techniques. WADT 1997. Lecture Notes in Computer Science, vol 1376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64299-4_34
Download citation
DOI: https://doi.org/10.1007/3-540-64299-4_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64299-2
Online ISBN: 978-3-540-69719-0
eBook Packages: Springer Book Archive