University of Leicester

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]|[Faculty of Science]|[MCS Home]|[CS Home]||[University Index A-Z]|[University Search]|[University Help]|

Author: Irek Ulidowski (I.Ulidowski@mcs.le.ac.uk).
© University of Leicester. Last modified: 12th January 2004, 18:02:26
CS Web Maintainer.