An Equational Axiomatization for Multi-exit Iteration

Luca Aceto*, Wan Fokkink

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review


This paper presents an equational axiomatization of bisimulation equivalence over the language of Basic Process Algebra (BPA) with multi-exit iteration. Multi-exit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form X1 =def P1X2 + Q1 ⋮ Xn =def PnX1 + Qn, where n is a positive integer and the Pi and the Qi are process terms. The addition of multi-exit iteration to BPA yields a more expressive language than that obtained by augmenting BPA with the standard binary Kleene star (BPA*). As a consequence, the proof of completeness of the proposed equational axiomatization for this language, although standard in its general structure, is much more involved than that for BPA*. An expressiveness hierarchy for the family of k-exit iteration operators proposed by Bergstra, Bethke, and Ponse is also offered.

Original languageEnglish
Pages (from-to)121-158
Number of pages38
JournalInformation and Computation
Issue number2
Publication statusPublished - 15 Sept 1997


Dive into the research topics of 'An Equational Axiomatization for Multi-exit Iteration'. Together they form a unique fingerprint.

Cite this