1. Abramsky S.: A domain equation for bisimulation. Inf. Comput. 92(1), 161–218 (1991)
2. Aceto, L., Chen, T., Fokkink, W., Ingolfsdottir, A.: On the axiomatizability of priority. In: Proceedings of Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006, Part II, LNCS, vol. 4052, pp. 480–491. Springer, Heidelberg (2006)
3. Aceto, L., Fokkink, W., Ingolfsdottir, A.: Ready to preorder: get your BCCSP axiomatization for free! In: Proceedings of CALCO’07, LNCS, vol. 4624, pp. 338–367. Springer, Heidelberg (2007)
4. Aceto L., Fokkink W., Ingolfsdottir A., Luttik B.: CCS with Hennessy’s merge has no finite equational axiomatization. Theor. Comput. Sci. 330(3), 377–405 (2005)
5. Aceto, L., Fokkink, W., Ingolfsdottir, A., Luttik, B.: Finite equational bases in process algebra: Results and open questions. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de~Vrijer, R.C. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, LNCS, vol. 3838, pp. 338–367. Springer, Heidelberg (2005)