Skip to main content

From T-Coalgebras to Filter Structures and Transition Systems

  • Conference paper
Book cover Algebra and Coalgebra in Computer Science (CALCO 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3629))

Included in the following conference series:

Abstract

For any set-endofunctor \(T : {\mathcal S}et \rightarrow {\mathcal S}et\) there exists a largest sub-cartesian transformation μ to the filter functor \({\mathbb F}: {\mathcal S}et \rightarrow {\mathcal S}et\). Thus we can associate with every T-coalgebra A a certain filter-coalgebra \(A_{\mathbb F}\).

Precisely, when T (weakly) preserves preimages, μ is natural, and when T (weakly) preserves intersections, μ factors through the covariant powerset functor \({\mathbb P}\), thus providing for every T-coalgebra A a Kripke structure \(A_{\mathbb P}\).

We characterize preservation of preimages, preservation of intersections, and preservation of both preimages and intersections via the existence of natural, sub-cartesian or cartesian transformations from T to either \({\mathbb F}\) or \({\mathbb P}\).

Moreover, we define for arbitrary T-coalgebras \({\mathcal A}\) a next-time operator \(\bigcirc_{\mathcal A}\) with associated modal operators □ and \(\lozenge\) and relate their properties to weak limit preservation properties of T. In particular, for any T-coalgebra \({\mathcal A}\) there is a transition system \({\mathcal K}\) with \(\bigcirc_{A} = \bigcirc_{K}\) if and only if T preserves intersections.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adámek, J., Herrlich, H., Strecker, G.E.: Abstract and concrete categories. John Wiley & Sons, Chichester (1990)

    MATH  Google Scholar 

  2. Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D.H., et al. (eds.) Proceedings category theory and computer science. LNCS, pp. 357–365. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  3. Barr, M.: Terminal coalgebras in well-founded set theory. Theoretical Computer Science 144(2), 299–315 (1993)

    Article  MathSciNet  Google Scholar 

  4. Gumm, H.P., Schöder, T.: Coalgebras of bounded type. Math. Struct. in Comp. Science 12, 565–578 (2002)

    Article  MATH  Google Scholar 

  5. Gumm, H.P., Schöder, T.: Types and coalgebraic structure, Tech. report, Philipps-Universität Marburg (to appear in Algebra Universalis) (2003)

    Google Scholar 

  6. Gumm, H.P.: Functors for coalgebras. Algebra Universalis 45(2-3), 135–147 (2001)

    MATH  MathSciNet  Google Scholar 

  7. Jacobs, B.: The temporal logic of coalgebras via Galois algebras. Math. Struct. in Comp. Science 12, 875–903 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Manes, E.G.: Implementing collection classes with monads. Math. Struct. Comp. Science 8, 231–276 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249, 3–80 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Taylor, P.: Practical foundations of mathematics, 2nd edn. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  11. Trnkovä, V.: Some properties of set functors. Comm. Math. Univ. Carolinae 10(2), 323–352 (1969)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gumm, H.P. (2005). From T-Coalgebras to Filter Structures and Transition Systems. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_13

Download citation

  • DOI: https://doi.org/10.1007/11548133_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28620-2

  • Online ISBN: 978-3-540-31876-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics