@InProceedings{CirsteaEA08,
  author = {Corina Cirstea and Alexander Kurz and  Dirk Pattinson and Lutz Schr{\"o}der and Yde Venema},
  title = {Modal logics are coalgebraic},
  year = {2008},
  editor = {Samson Abramsky and Erol Gelenbe and Vladimiro Sassone},
  booktitle = {Visions of Computer Science, BCS International Academic Research Conference (BCS 2008)},
  publisher = {British Computer Society},
  pages = {129-140},
  keywords = {Modal logic coalgebra knowledge representation automata modularity pi-calculus},
  comment = { <a href = "http://www8.informatik.uni-erlangen.de/~schroeder/papers/ModalCoalg.pdf"> [preprint] </a>},
  abstract = {Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand,  provides  a uniform and encompassing view on the large variety of specific logics used in particular domains.  The coalgebraic
approach is generic and compositional: tools and
techniques simultaneously apply to a large class of application
areas and can moreover be combined in a modular way.
In particular, this facilitates a pick-and-choose approach to domain
specific formalisms, applicable across the entire scope of
application areas, leading to generic software tools that are easier to design, to implement, and to maintain.
This paper substantiates the authors' firm belief that the systematic exploitation of this coalgebraic nature will not only have impact on
the field of modal logic itself but also
lead to significant progress in a number
of areas within computer science, such as knowledge representation
and concurrency/mobility.
},
}