A complete equational axiomatization for prefix iteration

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

Fingerprint

Axiomatization
Prefix
Algebra
Term Rewriting Systems
Iteration
Process Algebra
Bisimulation
Axioms
Normal Form
Subalgebra
Equivalence
Term

Keywords

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

Cite this

@article{235835cf7d5d452585b02b28d6308ad0,
title = "A complete equational axiomatization for prefix iteration",
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.",
keywords = "Basic CCS, Complete equational axioms, Concurrency, Formal languages, Iteration, Programming calculi",
author = "Wan Fokkink",
year = "1994",
month = "12",
day = "23",
doi = "10.1016/0020-0190(94)00163-4",
language = "English",
volume = "52",
pages = "333--337",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "6",

}

A complete equational axiomatization for prefix iteration. / Fokkink, Wan.

In: Information Processing Letters, Vol. 52, No. 6, 23.12.1994, p. 333-337.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - A complete equational axiomatization for prefix iteration

AU - Fokkink, Wan

PY - 1994/12/23

Y1 - 1994/12/23

N2 - 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.

AB - 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.

KW - Basic CCS

KW - Complete equational axioms

KW - Concurrency

KW - Formal languages

KW - Iteration

KW - Programming calculi

UR - http://www.scopus.com/inward/record.url?scp=0028728714&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028728714&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(94)00163-4

DO - 10.1016/0020-0190(94)00163-4

M3 - Article

VL - 52

SP - 333

EP - 337

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 6

ER -