TY  - JOUR
IS  - 2
PB  - Oxford University Press
JF  - Journal of Logic and Computation
N2  - We provide a finite equational axiomatization for bisimulation equivalence of nondeterministic interpretation of regular expressions. Our axiomatization is heavily based on the one by Salomaa, that provided an implicative axiomatization for a large subset of regular expressions, namely all those that satisfy the non?empty word property (i.e. without 1 summands at the top level) in *?contexts. Our restriction is similar, it essentially amounts to recursively requiring that the non?empty word property be satisfied not just at top level but at any depth. We also discuss the impact on the axiomatization of different interpretations of the 0 term, interpreted either as a null process or as a deadlock. 
ID  - eprints325
EP  - 320
SN  - 0955-792X
KW  - Bisimulation; concurency; equational axiomatization; nondeterminism; process algebras; regular expressions 
VL  - 12
A1  - Corradini, Flavio
A1  - De Nicola, Rocco
A1  - Labella, Anna
UR  - http://dx.doi.org/10.1093/logcom/12.2.301
Y1  - 2002///
TI  - An Equational Axiomatization of Bisimulation over Regular Expressions
SP  - 301
AV  - none
ER  -