Abstract
The paper investigates the construction of cofree coalgebras for ‘unsorted signature morphisms’. Thanks to the perfect categorical duality between the traditional concept of equations and the concept of coequations developed in [14] we can fully take profit of the methodological power of Category Theory [2] and follow a clean three step strategy: Firstly, we analyse the traditional Birkhoff construction of free algebras and reformulate it in a systematic categorical way. Then, by dualizing the Birkhoff construction, we obtain, in a second step, corresponding results for cofree coalgebras. And, thirdly, we will interpret the new “abstract” categorical results in terms of more familiar concept. The analysis of a sample cofree construction will provide, finally, some suggestions concerning the potential rôle of cofree coalgebras in System Specifications.
Research partially supported by the Norwegian NFR project MoSIS/IKT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. TCS (2004) (submitted)
Ehrig, H., Große–Rhode, M., Wolter, U.: Applications of category theory to the area of algebraic specification in computer science. Applied Categorical Structures 6(1), 1–35 (1998)
Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Berlin (1985)
Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 2: Module Specifications and Constraints. EATCS Monographs on Theoretical Computer Science, vol. 21. Springer, Berlin (1990)
Gumm, H.P.: Equational and implicational classes of coalgebras. TCS 260, 57–69 (2001)
Jacobs, B., Rutten, J.: A tutorial on (Co)Algebras and (Co)Induction. Bulletin of the EATCS 62, 222–259 (1997)
Kurz, A.: Coalgebras and modal Logic. Technical report, CWI Amsterdam, Lecture notes (2001)
Löwe, M., König, H., Schulz, C.: Algebraic properties of interfaces. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 190–203. Springer, Heidelberg (2005)
Reichel, H.: Initial Computability, Algebraic Specifications, and Partial Algebras. Oxford University Press, Oxford (1987)
Rutten, J.J.M.M.: Universal coalgebra: A theory of systems. TCS 249, 3–80 (2000); First appeared as Report CS-R9652, CWI, Amsterdam (1996)
Smyth, M.B., Plotkin, G.D.: The category theoretic solution of recursive domain equations. SIAM Journ. Comput. 11, 761–783 (1982)
Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs on Theoretical Computer Science, vol. 25. Springer, Berlin (1992)
Wolter, U.: An Algebraic Approach to Deduction in Equational Partial Horn Theories. J. Inf. Process. Cybern. EIK 27(2), 85–128 (1990)
Wolter, U.: On Corelations, Cokernels, and Coequations. In: Reichel, H. (ed.) Proceedings of Third Workshop on Coalgebraic Methods in Computer Science (CMCS 2000), Berlin, Germany. ENTCS, vol. 13, pp. 347–366. Elsevier Science, Amsterdam (2000)
Wolter, U.: CSP, Partial Automata, and Coalgebras. TCS 280, 3–34 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wolter, U. (2005). Cofree Coalgebras for Signature Morphisms. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-31847-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24936-8
Online ISBN: 978-3-540-31847-7
eBook Packages: Computer ScienceComputer Science (R0)