Skip Navigation

Journal of Logic and Computation 2002 12(2):301-320; doi:10.1093/logcom/12.2.301
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Corradini, F.
Right arrow Articles by Labella, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

An Equational Axiomatization of Bisimulation over Regular Expressions

Flavio Corradini1, Rocco De Nicola2 and Anna Labella3

1 Dip. di Mat. Pura ed Appl., Università dell'Aquila, Italy. E-mail: flavio{at}univaq.it 2 Dip. di Sistemi e Informatica, Università di Firenze, Italy. E-mail: denicola{at}dsi.unifi.it 3 Dip. di Scienze dell'Informazione, Università di Roma "La Sapienza", Italy. E-mail: labella{at}dsi.uniroma1.it

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.

Keywords: Bisimulation; concurency; equational axiomatization; nondeterminism; process algebras; regular expressions

Received September 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.