Abstract
In [1], Bart Jacobs and Jasse Hughes have brought in a new kind of functor. They took the order on a functor as a new functor. Based on that, they defined and researched some new notions about bisimulation. We take this new functor into the research of invariant in coalgebra, get the definition of predicate invariant, then we define and research several new notions. In the last, we can reach some conclusion about invariant. It is worth pointing out that we find the sufficient condition to make two-way lax invariant and invariant coincide, and prove that the great lax invariant is exactly the largest fixed point of some special functor coalgebra in set category.
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
Jacobs, B., Hughes, J.: Simulations in coalgebra. In: Gunm, H.P. (ed.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science, vol. 82(1), pp. 71–109. Elsevier, Amsterdam (2003)
Rutten, J.: Automata and coinduction:An exercise in coalgebra. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 194–218. Springer, Heidelberg (1998)
Worrell, J.: On coalgebras and final semantics, Ph.D.Thesis, Computing Laboratory, Oxford University (2000)
Worrell, J.: Toposes of coalgebras and hidden algebras. In: Jacobs, B., Moss, L., Reichel, H., Rutten, J. (eds.) Procedings of the CMCS 1998. Electronic Notes in Theoretical Computer Science, vol. 11 (1998)
Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249, 3–80 (2000)
Worrell, J.: Toposes of coalgebras and hidden algebras. In: Jacobus, B., Moss, L., Reichel, H., Rutten, J. (eds.) Coalgebraic Methods in Computer Science, Amsterdam. Electronic Notes in Theoretical Computer Science, vol. 11 (1998)
Hughes, J.: A Study of Categories of Algebras and Coalgebras, Ph.D.Thesis, Camegie Mellon University (2001)
Jacobs, B.: Comprehension for coalgebras. In: Moss, L. (ed.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science, vol. 65(1). Elsevier, Amsterdam (2002)
Xiaocong, Z., Zhongmei, S.: A Survey on the Coalgebraic Methods in Computer Science. Journal of Software 14(10), 1661–1671 (2003)
Johnstone, P.T., Power, A.J., Tsujishita, T., Watanabe, H., Worrell, J.: On the structure of categories of coalgebras. Theoretical Computer Science 260, 87–117 (2001)
Jacobs, B.: Introduction to Coalgebra,Towards Mathematics of States and Observations, Draft (2005)
Xiaohui, L., Lei, F.: Weak Invariant and Restrict Product of LTS. Computer Engineering And Science 155(11), 134–136 (2007)
Lei, F.: The Study For Several Topics in Domain Theory,Ph.D.Thesis. Beijing Capital Normal University (2001)
Chongyou, Z., Lei, F., Hongbin, C.: Frame and Continuous Lattices. Capital Normal University Press, Beijing (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Jl., Fan, L. (2009). Lax Invariant in Coalgebra. In: Cao, By., Zhang, Cy., Li, Tf. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 54. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88914-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-88914-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88913-7
Online ISBN: 978-3-540-88914-4
eBook Packages: EngineeringEngineering (R0)