Since 2014
A Complete Equational Axiomatization for MPA with String Iteration
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
A Complete Equational Axiomatization for MPA with String Iteration
|
|
| Creator |
Aceto, Luca
Groote, Jan Friso |
|
| Description |
We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner's basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation p*q obtained by restricting the first argument to be a non-empty sequence of atomic actions. We show that, for every positive integer k, bisimulation equivalence over the set of processes in this language with loops of length at most k is finitely axiomatizable. We also offer a countably infinite equational theory that completely axiomatizes bisimulation equivalence over the whole language. We prove that this result cannot be improved upon by showing that no finite equational axiomatization of bisimulation equivalence over basic CCS with string iteration can exist, unless the set of actions is empty.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-01-28
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19930
10.7146/brics.v2i28.19930 |
|
| Source |
BRICS Report Series; No 28 (1995): RS-28 A Complete Equational Axiomatization for MPA with String Iteration
BRICS Report Series; No 28 (1995): RS-28 A Complete Equational Axiomatization for MPA with String Iteration 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19930/17584
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|