"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."
A. Kurz, “Coalgebras and their logics,” ACM SIGACT News, vol. 37, no. 2, p. 57, Jun. 2006. DOI: 10.1145/1140612.1140628
Association for Computing Machinery