A Complete Equational Axiomatization for Prefix Iteration

Abstract

Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the… (More)
DOI: 10.1016/0020-0190(94)00163-4

Topics

4 Figures and Tables

Slides referencing similar topics