Results 1 
2 of
2
Expressivity of coalgebraic modal logic: The limits and beyond
 IN FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, VOLUME 3441 OF LNCS
, 2005
"... Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from socalled predicate liftings have been shown to be invariant under behavioral equivalence. Expressivity results stating that, c ..."
Abstract

Cited by 39 (13 self)
 Add to MetaCart
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from socalled predicate liftings have been shown to be invariant under behavioral equivalence. Expressivity results stating that, conversely, logically indistinguishable states are behaviorally equivalent depend on the existence of separating sets of predicate liftings for the signature functor at hand. Here, we provide a classification result for predicate liftings which leads to an easy criterion for the existence of such separating sets, and we give simple examples of functors that fail to admit expressive normal or monotone modal logics, respectively, or in fact an expressive (unary) modal logic at all. We then move on to polyadic modal logic, where modal operators may take more than one argument formula. We show that every accessible functor admits an expressive polyadic modal logic. Moreover, expressive polyadic modal logics are, unlike unary modal logics, compositional.
Algebraiccoalgebraic specification in CoCasl
 J. LOGIC ALGEBRAIC PROGRAMMING
, 2006
"... We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criter ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criteria for the existence of cofree models, also for several variants of nested cofree and free specifications. Moreover, we describe an extension of the existing proof support for Casl (in the shape of an encoding into higherorder logic) to CoCasl.