Basic process algebra with iteration: Completeness of its equational axioms

Wan Fokkink, Hans Zantema

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

Algebra

Cite this

@article{b92b15d2a0e24cca9a56032d3575e60c,
title = "Basic process algebra with iteration: Completeness of its equational axioms",
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 +.",
author = "Wan Fokkink and Hans Zantema",
year = "1994",
month = "1",
day = "1",
doi = "10.1093/comjnl/37.4.259",
language = "English",
volume = "37",
pages = "259--267",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "4",

}

Basic process algebra with iteration : Completeness of its equational axioms. / Fokkink, Wan; Zantema, Hans.

In: Computer Journal, Vol. 37, No. 4, 01.01.1994, p. 259-267.

Research output: Contribution to JournalArticleAcademicpeer-review

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

VL - 37

SP - 259

EP - 267

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 4

ER -