A COMPLETE EQUATIONAL AXIOMATIZATION FOR PREFIX ITERATION

Authors
FOKKINK W
Citation
W. Fokkink, A COMPLETE EQUATIONAL AXIOMATIZATION FOR PREFIX ITERATION, Information processing letters, 52(6), 1994, pp. 333-337
Citations number
14
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
52
Issue
6
Year of publication
1994
Pages
333 - 337
Database
ISI
SICI code
0020-0190(1994)52:6<333:ACEAFP>2.0.ZU;2-R
Abstract
Prefix iteration a x is added to Minimal Process Algebra (MPA(delta)) , which is a subalgebra of BPA(delta)) equivalent to Milner's basic CC S. We present a finite equational axiomatization for MPA(delta), and prove that this axiomatization is complete with respect to strong bisi mulation equivalence. To obtain this result, we will set up a term rew riting system, based on the axioms, and show that bisimilar terms have the same normal form.