Components as coalgebras: The refinement dimension

This paper characterises refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterisation is parametric on a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs. In particular, it is shown how refinement can be applied to the development of the inequational subset of a calculus of generic software components. (c) 2005 Elsevier B.V. All rights reserved.Computer Science, Theory & MethodsSCI(E)EICPCI-S(ISTP)