 |
computer science |
||
Priority Rewrite Systems for OSOS Process Languages,Irek Ulidowski, Technical Report 2002/30, Department of Mathematics and Computer Science, University of Leicester, 2002. Abstract We propose a procedure that allows the user to derive automatically a priority rewrite system for an arbitrary process language in the OSOS format. The rewriting of terms within the derived rewrite systems is sound for bisimulation. We show that, for a decidable subclass of OSOS process languages, namely syntactically well-founded and linear OSOS process languages, the derived priority rewrite systems are strongly normalising, confluent and complete for bisimulation for closed terms modulo associativity and commutativity of the choice operator. |
|
![[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). |
|