%0 Journal Article
%@ 0955-792X
%A Corradini, Flavio
%A De Nicola, Rocco
%A Labella, Anna
%D 2002
%F eprints:325
%I Oxford University Press
%J Journal of Logic and Computation
%K Bisimulation; concurency; equational axiomatization; nondeterminism; process algebras; regular expressions 
%N 2
%P 301-320
%T An Equational Axiomatization of Bisimulation over Regular Expressions
%U http://eprints.imtlucca.it/325/
%V 12
%X 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.