This paper contributes to the study of the equational theory of the semantics in van Glabbeek’s linear time - branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral congruence lying between ready simulation equivalence and partial traces equivalence from a complete (respectively, ground-complete) inequational axiomatization of its underlying precongruence—that is, of the precongruence whose kernel is the equivalence. The algorithm preserves finiteness of the axiomatization when the set of actions is finite.
Springer
Lecture Notes in Computer Science
International Conference on Algebra and Coalgebra in Computer Science
Software Analysis and Transformation

Aceto, L., Fokkink, W., & Ingólfsdóttir, A. (2007). Ready to preorder: get your BCCSP axiomatization for free!. In ,Proceedings of Second International Conference on Algebra and Coalgebra in Computer Science, CALCO 2007 (pp. 65–79). Springer.