eprintid: 325
rev_number: 11
eprint_status: archive
userid: 32
dir: disk0/00/00/03/25
datestamp: 2011-06-06 09:41:26
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-06 09:41:26
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Corradini, Flavio
creators_name: De Nicola, Rocco
creators_name: Labella, Anna
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: An Equational Axiomatization of Bisimulation over Regular Expressions
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Bisimulation; concurency; equational axiomatization; nondeterminism; process algebras; regular expressions 
abstract: 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. 
date: 2002
date_type: published
publication: Journal of Logic and Computation
volume: 12
number: 2
publisher: Oxford University Press
pagerange: 301-320
id_number: 10.1093/logcom/12.2.301
refereed: TRUE
issn: 0955-792X
official_url: http://dx.doi.org/10.1093/logcom/12.2.301
citation:   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)