Browse by author
Lookup NU author(s): Professor Maciej KoutnyORCiD
In the design of concurrent systems it is sometimes desirable to specify priority constraints to resolve conflicts between simultaneously enabled actions. e.g., operating systems employ priorities to control the execution of jobs waiting for processing, while programming languages provide primitives to specify the preference of the execution of one program's module over another one. Priority systems can be roughly divided into two classes: those employing static priority relation, and those employing dynamic priority relation. In the former all priority constraints are determined before the operation of the system or program begins, i.e., at the compile time, while in the latter the priority relation can be changed during the execution, i.e., priorities are determined at the run time. In this paper we will be concerned with the dynamic priority systems and investigate their formal semantics using Petri nets.
Author(s): Koutny M
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Year: 1991
Pages: 30
Report Number: 353
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/353.pdf
