Abstract
In this paper we discuss concurrent systems with dynamic priorities, i.e. we allow the priority relation to change as the system evolves. We identify two classes of such systems, state-controlled and event-controlled priority systems. We define their nonsequential semantics (in terms of step sequences) which reflects both the priority constraints and concurrency specification. It is then shown that for a given prioritised system it is possible to construct an equivalent non-prioritised one. The systems dealt with in this paper are safe Petri nets augmented with a priority specification.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barrett G.: The Semantics of Priority and Fairness in occam. Programming Research Group, Oxford University Computing Laboratory (1990).
Beaten J.C.M., Bergstra J.A. and Klop J.W.: Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. The Computer Journal, Vol. 30(6), 498–506 (1987).
Best E. and Koutny M.: Petri Net Semantics of Priority Systems. Theoretical Computer Science 94(1), 141–158 (1992).
Bol R.N., Groote J.F.: The meaning of Negative Premises in Transition System Specifications. Report CS-R9054, CWI, Amsterdam (1990).
Camilleri J.: An Operational semantics for occam. University of Cambridge, Computing Laboratory Technical report 144 (1988).
Camilleri J. and Winskel G.: CCS with Priority Choice. Proceedings of LICS'91 Conference, IEEE Computer Society Press, 246–255 (1991).
Cleaveland R. and Hennessy M.: Priorities in Process Algebras. Proceedings of LICS'89 Conference, IEEE Computer Society Press, Edinburgh (1988).
Groote J.F.: Private communication (1991).
Hack M.: Petri Net Languages. Technical report 159, Laboratory for Computer Science, MIT, Cambridge (1976).
Janicki R.: A Formal Semantics for Concurrent Systems with a Priority Relation. Acta Informatica 24, 33–55 (1987).
Janicki R. and Koutny M.: Invariants and Paradigms of Concurrency. Proceedings of PARLE'91, Lecture Notes in Computer Science 506, Springer, 59–74 (1991).
Janicki R. and Lauer P.E.: Specification and Analysis of Concurrent Systems: The COSY Approach. Springer (to appear).
Lamport L.: What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority. 12th ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, 78–83 (1985).
Okulicka F.: On Priority in COSY. Theoretical Computer Science 74, 199–216, (1990).
Peterson J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall (1981).
Reisig W.: Petri Nets: An Introduction. Springer (1985).
Rozenberg G., Verraedt R.: Subset Languages of Petri Nets. Theoretical Computer Science 26, 301–323 (1983).
Salwicki A., Müldner T.: On Algorithmic Properties of Concurrent Programs. Lecture Notes in Computer Science, vol. 125, Springer, 169–197 (1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koutny, M. (1992). Modelling systems with dynamic priorities. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_174
Download citation
DOI: https://doi.org/10.1007/3-540-55610-9_174
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55610-7
Online ISBN: 978-3-540-47258-2
eBook Packages: Springer Book Archive