eprintid: 346
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/46
datestamp: 2011-06-13 12:48:41
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-13 12:48:41
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: Models of Nondeterministic Regular Expressions
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: Nondeterminism is a direct outcome of interactions and is, therefore a central ingredient for modelling concurrent systems. Trees are very useful for modelling nondeterministic behaviour. We aim at a tree-based interpretation of regular expressions and study the effect of removing the idempotence law X+X=X and the distribution law X•(Y+Z)=X•Y+X•Z from Kleene algebras. We show that the free model of the new set of axioms is a class of trees labelled over A. We also equip regular expressions with a two-level behavioural semantics. The basic level is described in terms of a class of labelled transition systems that are detailed enough to describe the number of equal actions a system can perform from a given state. The abstract level is based on a so-called resource bisimulation preorder that permits ignoring uninteresting details of transition systems. The three proposed interpretations of regular expressions (algebraic, denotational, and behavioural) are proven to coincide. When dealing with infinite behaviours, we rely on a simple version of the ω-induction and obtain a complete proof system also for the full language of nondeterministic regular expressions.
date: 1999
date_type: published
publication: Journal of Computer and System Sciences
volume: 59
number: 3
publisher: Elsevier
pagerange: 412-449
id_number: 10.1006/jcss.1999.1636
refereed: TRUE
issn: 0022-0000
official_url: http://www.sciencedirect.com/science/article/pii/S0022000099916367
funders: This work has been partially founded by EEC within the HCM Project EXPRESS, and by CNR within the project “Specifica ad Alto Livello e Verifica di Sistemi Digitali.
citation:   Corradini, Flavio and De Nicola, Rocco and Labella, Anna  Models of Nondeterministic Regular Expressions.  Journal of Computer and System Sciences, 59 (3).  pp. 412-449.  ISSN 0022-0000      (1999)