Basic process algebra with iteration: Completeness of its equational axioms

Wan Fokkink*, Hans Zantema

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

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 +.

Original languageEnglish
Pages (from-to)259-267
Number of pages9
JournalComputer Journal
Volume37
Issue number4
DOIs
Publication statusPublished - 1 Jan 1994

Fingerprint Dive into the research topics of 'Basic process algebra with iteration: Completeness of its equational axioms'. Together they form a unique fingerprint.

Cite this