We consider conditional transition systems, that allow to model software product lines with upgrades, in a coalgebraic setting. We show that, by using Birkhoff's duality for distributive lattices, we obtain two equivalent Kleisli categories in which these coalgebras live: Kleisli categories based on the reader and on the so-called lattice monad over Poset. We study two different functors describing the branching type of the coalgebra and investigate the resulting behavioural equivalence. Furthermore we show how an existing algorithm for coalgebra minimisation can be instantiated to derive behavioural equivalences in this setting.
['Harsh Beohar', 'Barbara König', 'Sebastian Küpper', 'Alexandra Silva']
A coalgebraic treatment of conditional transition systems with upgrades.