Please use this identifier to cite or link to this item:
Title: Priority Rewrite Systems for OSOS Process Languages
Authors: Ulidowski, Irek
First Published: 2003
Citation: Roberto M. Amadio, Denis Lugiez (Eds.): CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings. Lecture Notes in Computer Science, 2003, 2761, pp. 87-102
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.
DOI Link: 10.1007/978-3-540-45187-7_6
ISBN: 9783540407539
Type: Conference paper
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.