Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Semantical Principles in the Modal Logic of Coalgebras

  • Conference paper
  • First Online:
STACS 2001 (STACS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2010))

Included in the following conference series:

Abstract

Coalgebras for a functor on the category of sets subsume many formu- lations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames and many types of automata. This paper presents a multimodal language which is bisimulation invariant and (under a natural com- pleteness condition) expressive enough to characterise elements of the underlying state space up to bisimulation. Like Moss’ coalgebraic logic, the theory can be applied to an arbitrary signature functor on the category of sets. Also, an upper bound for the size of conjunctions and disjunctions needed to obtain characteristic formulas is given.

Research supported by the DFG Graduiertenkolleg “Logik in der Informatik”.

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

Access this chapter

Log in via an institution
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. P. Aczel and N. Mendler. A Final Coalgebra Theorem. In D. H. Pitt et al, editor, Category Theory and Computer Science, volume 389 of LNCS, pages 357–365. Springer, 1989.

    Chapter  Google Scholar 

  2. J. Adámek. Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolinae, 15:589–602, 1974.

    MATH  MathSciNet  Google Scholar 

  3. J. Adámek and V. Koubek. On the greatest fixed point of a set functor. Theor. Comp. Sci., 150:57–75, 1995.

    Article  MATH  Google Scholar 

  4. Alexandru Baltag. A Logic for Coalgebraic Simulation. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS’2000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.

    Google Scholar 

  5. A. Carboni, G. Kelly, and R. Wood. A 2-categorical approach to change of base and geometric morphisms I. Technical Report 90-1, Dept. of Pure Mathematics, Univ. of Sydney, 1990.

    Google Scholar 

  6. M. Hennessy and R. Milner. On Observing Nondeterminism and Concurrency. In J. W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, 7th Colloquium, volume 85 of Lecture Notes in Computer Science, pages 299–309. Springer-Verlag, 1980.

    Google Scholar 

  7. B. Jacobs and J. Rutten. A Tutorial on (Co)Algebras and (Co)Induction. EATCS Bulletin, 62:222–259, 1997.

    MATH  Google Scholar 

  8. Bart Jacobs. The temporal logic of coalgebras via Galois algebras. Technical Report CSIR9906, Computing Science Institute, University of Nijmegen, 1999.

    Google Scholar 

  9. Bart Jacobs. Towards a Duality Result in the Modal Logic of Coalgebras. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS’2000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.

    Google Scholar 

  10. Alexander Kurz. Coalgebras and Applications to Computer Science. PhD thesis, Universität München, April 2000.

    Google Scholar 

  11. Alexander Kurz. Specifying Coalgebras with Modal Logic. Theor. Comp. Sci., 260, 2000.

    Google Scholar 

  12. Robin Milner. Communication and Concurrency. International series in computer science. Prentice Hall, 1989.

    Google Scholar 

  13. Lawrence Moss. Coalgebraic Logic. Annals of Pure and Applied Logic, 96:277–317, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  14. Dirk Pattinson. Semantical Principles in the Modal Logic of Coalgebras. Technical report, Institut für Informatik, LMU München, 2000.

    Google Scholar 

  15. Martin Rößiger. Coalgebras and Modal Logic. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS’2000), volume 33 of Electr. Notes in Theoret. Comp. Sci., 2000.

    Google Scholar 

  16. Martin Rößiger. From Modal Logic to Terminal Coalgebras. Theor. Comp. Sci., 260, 2000.

    Google Scholar 

  17. Jan Rutten. Universal Coalgebra: A theory of systems. Technical Report CS-R 9652, CWI, Amsterdam, 1996.

    Google Scholar 

  18. Jan Rutten. Relators and Metric Bisimulations. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, Coalgebraic Methods in Computer Science (CMCS’98), volume 11 of Electr. Notes in Theoret. Comp. Sci., 1999.

    Google Scholar 

  19. M. Smyth and G. Plotkin. The Category-Theoretic Solution of Recursive Domain Equations. SIAM Journal of Computing, 11(4):761–783, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  20. Colin Stirling. Modal and temporal logics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford Science Publications, 1992.

    Google Scholar 

  21. D. Turi and J. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8(5):481–540, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  22. Daniele Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, 1996.

    Google Scholar 

  23. James Worell. Terminal Sequences for Accessible Endofunctors. In B. Jacobs and J. Rutten, editors, Coalgebraic Methods in Computer Science (CMCS’99), volume 19 of Electr. Notes in Theoret. Comp. Sci., 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Ludwig-Maximilians-Universität München, Germany

    Dirk Pattinson

Authors
  1. Dirk Pattinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. I3S & INRIA Sophia Antipolis INRIA, CNRS, 2004 Route des Lucioles, 06902, Sophia-Antipolis, France

    Afonso Ferreira

  2. Institut für Theoretische Informatik, Fakultät Informatik, TU Dresden, 01062, Dresden, Germany

    Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pattinson, D. (2001). Semantical Principles in the Modal Logic of Coalgebras. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

  • Online ISBN: 978-3-540-44693-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation