1. Equational axioms for probabilistic bisimilarity;Aceto,2002
2. Deciding bisimilarity is P-complete;Balcázar;Formal Aspects of Computing,1992
3. Category Theory for Computing Science;Barr,1990
4. Definable operation in general algebras, and the theory of automata and flowcharts;Bekić,1969
5. Varieties of ordered algebras;Bloom;J. Computer and System Sciences,1976