A complete axiomatization for prefix iteration in branching bisimulation

Wan Fokkink*

*Corresponding author for this work

Research output: Contribution to JournalArticle

Abstract

This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.

Original languageEnglish
Pages (from-to)103-113
Number of pages11
JournalFundamenta Informaticae
Volume26
Issue number2
Publication statusPublished - 1 May 1996

    Fingerprint

Cite this