A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation

In a previous paper we introduced internal models for coalgebraic modal logics and showed how they characterise expressivity for bismulation. Here we extend this work by enriching over preordered sets, and in so doing derive a characterisation that subsumes expressivity for both bisimulation and simulation.