Coalgebraic Expressions

Robert S. R. Myers
2009 Fixed Points in Computer Science  
We show that certain fixpoint expressions used to describe finite Kripke polynomial coalgebras can be seen as coalgebraic modal fixpoint formulae. Both the synthesis of a coalgebra from its expression and the ability to check behavioural equivalence follow from the same tableau construction. There is an associated complete equational logic, analogous to Kleene algebra, which may now be seen as an equational presentation of a fragment of the coalgebraic µ-calculus. These expressions include the
more » ... egular expressions, the free Kleene algebra with tests and fragments of CCS and Linear Temporal Logic.
dblp:conf/fics/Myers09 fatcat:odizieeuw5hfxnpwlrqsbkq2oq