Coalgebra is an abstract framework for the uniform study of different kinds of dynamical
systems. An endofunctor $ F $ determines both the type of systems ($ F $-coalgebras) and a
notion of behavioral equivalence ($\sim_F $) amongst them. Many types of transition
systems and their equivalences can be captured by a functor $ F $. For example, for
deterministic automata the derived equivalence is language equivalence, while for non-
deterministic automata it is ordinary bisimilarity. The powerset construction is a standard …

Coalgebra is an abstract framework for the uniform study of different kinds of dynamical
systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion
of behavioral equivalence (∼ F) amongst them. Many types of transition systems and their
equivalences can be captured by a functor F. For example, for deterministic automata the
derived equivalence is language equivalence, while for non-deterministic automata it is
ordinary bisimilarity. The powerset construction is a standard method for converting a …