Lookup NU author(s): Professor Eike Best,
Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
The specification of priorities provides a convenient way of resolving conflicts in the design of concurrent computing systems. Priorities have been widely used by operating systems to enforce the preferred order of the execution of jobs waiting for processing; while programming languages often provide primitives, such as prioritised choice operator, for expressing the intended preference of the execution of one enabled section of the program over another enabled section of the program.In this paper we consider priority systems (Σ, varrho), where Σ is a bounded Petri net, and varrho is a priority relation on the transitions of the net. Our main goal is to give a formal semantics of (Σ, varrho) by constructing a Petri net Σvarrho which would retain as much of the concurrency semantics of Σ as possible and at the same time not violate the priority constraints imposed by varrho. In the construction provided by this paper, Σvarrho is derived from Σ by adding additional places and arcs, and by splitting the transitions of the original net Σ if necessary. The way in which these new places are added generalises the standard complementation technique introduced for P/T-nets. For safe nets Σ he construction can be simplified and Σvarrho built without splitting of any transitions. We then outline how the translation from (Σ, varrho) to Σvarrho might be used to give a formal semantics of the prioritised choice operator.
Author(s): Best E, Koutny M
Publication type: Article
Publication status: Published
Journal: Theoretical Computer Science
ISSN (print): 0304-3975
Publisher: Elsevier Science Publishers BV
Altmetrics provided by Altmetric