Basic process algebra with iteration : completeness of its equational axioms

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    37 Citaten (Scopus)
    2 Downloads (Pure)

    Samenvatting

    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 +.
    Originele taal-2Engels
    Pagina's (van-tot)259-267
    Aantal pagina's9
    TijdschriftThe Computer Journal
    Volume37
    Nummer van het tijdschrift4
    DOI's
    StatusGepubliceerd - 1994

    Vingerafdruk Duik in de onderzoeksthema's van 'Basic process algebra with iteration : completeness of its equational axioms'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit