Please use this identifier to cite or link to this item:
Title: Specifying coalgebras with modal logic.
Authors: Kurz, Alexander
First Published: 2001
Citation: Theoretical Computer Science, 2001, 260 (01-Feb), pp.119-138
Abstract: 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.).
DOI Link: 10.1016/S0304-3975(00)00125-0
ISSN: 0304-3975
Type: Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.