A complete equational axiomatization for prefix iteration

Wan Fokkink

doi:10.1016/0020-0190(94)00163-4

A complete equational axiomatization for prefix iteration

Wan Fokkink^*

^*Corresponding author for this work

Research output: Contribution to Journal › Article › Academic › peer-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 language	English
Pages (from-to)	333-337
Number of pages	5
Journal	Information Processing Letters
Volume	52
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(94)00163-4
Publication status	Published - 23 Dec 1994

Keywords

Basic CCS
Complete equational axioms
Concurrency
Formal languages
Iteration
Programming calculi

Access to Document

10.1016/0020-0190(94)00163-4

Persistent URL (handle)

Persistent link

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 = dec,

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 B.V.",

number = "6",

}

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 - https://www.scopus.com/pages/publications/0028728714

UR - https://www.scopus.com/pages/publications/0028728714#tab=citedBy

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

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

M3 - Article

AN - SCOPUS:0028728714

SN - 0020-0190

VL - 52

SP - 333

EP - 337

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

A complete equational axiomatization for prefix iteration

Abstract

Keywords

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this