We define a class of process algebras with silent step and a generalised operation $gsum{$ that allows explicit treatment of emph{alternative quantification over data, and we investigate the specific subclass formed by the algebras of finite processes modulo rooted branching bisimulation. We give a ground complete axiomatisation for those branching bisimulation algebras of which the data part has built-in equality and Skolem functions.

Concurrent Programming (acm D.1.3), Models of Computation (acm F.1.1), Mathematical Logic (acm F.4.1)
Other algebras related to logic (msc 03G25), Applications of universal algebra in computer science (msc 08A70), Abstract data types; algebraic specification (msc 68Q65), Algebraic theory of languages and automata (msc 68Q70)
Software Engineering [SEN]

Groote, J.F, & Luttik, S.P. (1998). A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data. Software Engineering [SEN]. CWI.