Basic process algebra with iteration : completeness of its equational axioms

    Research output: Contribution to journalArticleAcademicpeer-review

    37 Citations (Scopus)
    2 Downloads (Pure)

    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
    JournalThe Computer Journal
    Volume37
    Issue number4
    DOIs
    Publication statusPublished - 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