Basic Process Algebra with Iteration: Completeness of its Equational Axioms
Open Access
- 1 January 1994
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 37 (4) , 259-267
- https://doi.org/10.1093/comjnl/37.4.259
Abstract
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 +.Keywords
This publication has 0 references indexed in Scilit: