This paper provides an overview of an approach to coalgebraic modelling and refinement of state-based software components,
summing up some basic results and introducing a discussion on the interplay between behavioural and classical data refinement.
The approach builds on coalgebra theory as a suitable tool to capture observational semantics and to base an abstract characterisation
of possible behaviour models for components (from partiality to different degrees of non-determinism).