A complete equational axiomatization for prefix iteration

Wan Fokkink*

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

Prefix iteration a* x is added to Minimal Process Algebra (MPAδ, which is a subalgebra of BPAδ equivalent to Milner's basic CCS. We present a finite equational axiomatization for MPA* δ, and 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 show that bisimilar terms have the same normal form.

Original languageEnglish
Pages (from-to)333-337
Number of pages5
JournalInformation Processing Letters
Volume52
Issue number6
DOIs
Publication statusPublished - 23 Dec 1994

Keywords

  • Basic CCS
  • Complete equational axioms
  • Concurrency
  • Formal languages
  • Iteration
  • Programming calculi

Fingerprint Dive into the research topics of 'A complete equational axiomatization for prefix iteration'. Together they form a unique fingerprint.

Cite this