 |
computer science |
||
Priority Rewrite Systems for OSOS Process Languages,Irek Ulidowski, In R. Amadio and D. Lugiez editors, Proceedings of the 14th International Conference on Concurrency Theory CONCUR 2003, pp 87-102, LNCS 2761. Springer 2003. Abstract We propose a procedure for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format. Rewriting of process terms is sound for bisimulation and head normalising within the produced PRSs. For a subclass of process languages representing finite behaviours the generated PRSs are strongly normalising (terminating), confluent and complete for bisimulation for closed terms modulo associativity and commutativity of the choice operator. We illustrate the usefulness of our procedure with several examples. |
|
![[University Home]](/images/unihome.gif){kind=small} |![[Faculty of Science]](/images/fac_of_science.gif){kind=small} |![[MCS Home]](/images/schhome.gif){kind=small} |![[CS Home]](/images/depthome.gif){kind=small} ||![[University Index A-Z]](/images/index.gif){kind=small} |![[University Search]](/images/search.gif){kind=small} |![[University Help]](/images/help.gif){kind=small} |
|
|
Author: Irek Ulidowski (I.Ulidowski@mcs.le.ac.uk). |
|