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)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 12:56|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)