TY - JOUR
T1 - A complete equational axiomatization for prefix iteration
AU - Fokkink, Wan
PY - 1994/12/23
Y1 - 1994/12/23
N2 - 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 will set up a term rewriting system, based on the axioms, and show that bisimilar terms have the same normal form.
AB - 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 will set up a term rewriting system, based on the axioms, and show that bisimilar terms have the same normal form.
KW - Basic CCS
KW - Complete equational axioms
KW - Concurrency
KW - Formal languages
KW - Iteration
KW - Programming calculi
UR - http://www.scopus.com/inward/record.url?scp=0028728714&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028728714&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(94)00163-4
DO - 10.1016/0020-0190(94)00163-4
M3 - Article
AN - SCOPUS:0028728714
SN - 0020-0190
VL - 52
SP - 333
EP - 337
JO - Information Processing Letters
JF - Information Processing Letters
IS - 6
ER -