eprintid: 363 rev_number: 9 eprint_status: archive userid: 32 dir: disk0/00/00/03/63 datestamp: 2011-06-13 12:56:03 lastmod: 2011-07-11 14:36:27 status_changed: 2011-06-13 12:56:03 type: book_section 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: Fully Abstract Models for Nondeterministic Regular Expressions ispublished: pub subjects: QA75 divisions: CSA full_text_status: none abstract: Regular expressions and Kleene Algebras have been a direct inspiration for many constructs and axiomatizations for concurrency models. These, however, put a different stress on nondeterminism. With concurrent interpretations in mind, we study the effect of removing the idempotence law X+X=X and distribution law X·(Y+Z)=X·Y +X·Z from Kleene Algebras. We propose an operational semantics that is sound and complete w.r.t. the new set of axioms and is fully abstract w.r.t. a denotational semantic based on trees. The operational semantics is based on labelled transition systems that keep track of the performed choices and on a preorder relation (we call it resource simulation) that takes also into account the number of states reachable via every action.An important property we exhibit is that resource bisimulation equivalence can be obtained as the kernel of resource simulation. date: 1995 date_type: published series: Lecture Notes in Computer Science volume: 962 publisher: Springer pagerange: 130-144 id_number: 10.1007/3-540-60218-6_10 refereed: TRUE isbn: 3-540-60218-6 book_title: CONCUR '95: Concurrency Theory editors_name: Lee, Insup editors_name: A. Smolka, Scott official_url: http://dx.doi.org/10.1007/3-540-60218-6_10 citation: Corradini, Flavio and De Nicola, Rocco and Labella, Anna Fully Abstract Models for Nondeterministic Regular Expressions. In: CONCUR '95: Concurrency Theory. Lecture Notes in Computer Science, 962 . Springer, pp. 130-144. ISBN 3-540-60218-6 (1995)