relation: http://eprints.imtlucca.it/325/
title: An Equational Axiomatization of Bisimulation over Regular Expressions
creator: Corradini, Flavio
creator: De Nicola, Rocco
creator: Labella, Anna
subject: QA75 Electronic computers. Computer science
description: 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. 
publisher: Oxford University Press
date: 2002
type: Article
type: PeerReviewed
identifier:   Corradini, Flavio and De Nicola, Rocco and Labella, Anna  An Equational Axiomatization of Bisimulation over Regular Expressions.  Journal of Logic and Computation, 12 (2).  pp. 301-320.  ISSN 0955-792X      (2002)  
relation: http://dx.doi.org/10.1093/logcom/12.2.301
relation: 10.1093/logcom/12.2.301