TY - JOUR
T1 - Basic process algebra with iteration
T2 - Completeness of its equational axioms
AU - Fokkink, Wan
AU - Zantema, Hans
PY - 1994/1/1
Y1 - 1994/1/1
N2 - Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we 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 prove that this term rewriting system is terminating, and that bisimilar normal forms are syntactically equal modulo commutativity and associativity of the +.
AB - Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we 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 prove that this term rewriting system is terminating, and that bisimilar normal forms are syntactically equal modulo commutativity and associativity of the +.
UR - http://www.scopus.com/inward/record.url?scp=0028752608&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028752608&partnerID=8YFLogxK
U2 - 10.1093/comjnl/37.4.259
DO - 10.1093/comjnl/37.4.259
M3 - Article
AN - SCOPUS:0028752608
SN - 0010-4620
VL - 37
SP - 259
EP - 267
JO - Computer Journal
JF - Computer Journal
IS - 4
ER -