Specifying Coalgebras with Modal Logic
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on coalgebras as a semantics of object-oriented programming. Two approaches are taken: First, standard concepts of modal logic are applied to coalgebras. For a certain kind of functor it is shown that the logic exactly captures the notion of bisimulation and a complete calculus is given. Examples of verifications of object properties are given. Second, we discuss the relationship of this approach with the coalgebraic logic of Moss (Coalgebraic logic, Ann Pure Appl. Logic 96 (1999) 277–317.).
A. Kurz, “Specifying coalgebras with modal logic,” Theoretical Computer Science, vol. 260, no. 1–2, pp. 119–138, Jun. 2001. DOI: 10.1016/S0304-3975(00)00125-0