Basic Process Algebra with Iteration: Completeness of its Equational Axioms | Zendy

Wan Fokkink | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Basic Process Algebra with Iteration: Completeness of its Equational Axioms

Author(s) -

Wan Fokkink

Publication year - 1994

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/37.4.259

Subject(s) - modulo , rewriting , axiom , mathematics , completeness (order theory) , equivalence (formal languages) , term (time) , bisimulation , algebra over a field , commutative property , kleene algebra , process calculus , equational logic , term algebra , binary operation , discrete mathematics , pure mathematics , subalgebra , computer science , division algebra , theoretical computer science , mathematical analysis , geometry , programming language , physics , quantum mechanics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research