Complete Axiomatisation of Branching Bisimlation for Process Algebras with211 Alternative quantification over Data. Software Engineering

摘要

We define a class of process algebras with silent step and a generalized211u001eoperation sigma that allows explicit treatment of alternative quantification over 211u001edata, and we investigate the specific subclass formed by the algebras of finite 211u001eprocesses modulo rooted branching bisimulation. We give a ground complete 211u001eaxiomatization for those branching bisimulation algebras of which the data part 211u001ehas built-in equality and Skolem functions.