Abstract
We study fairness with respect to markings in Petri nets, which means no infinite execution sequence such that in the sequence some marking occurs only finitely often but it is an element of the forward set of a marking M which occurs infinitely often. First we show the transition strong fairness implies the marking fairness although the transition fairness and the marking fairness are quite different matters. And we find some relationship between the marking fairness and the frozen tokens. Then we prove that it can be controlled locally to make marking fairness.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Best, Fairness and conspiracies,Information Process Letters,18 (1984), 215–220.
W. Brauer (ed.), Net theory and applications, Lecture Notes in Computer Science, Vol. 84, Springer Verlag (1980).
H. Carstensen and R. Valk, Infinite behaviours and fairness in Petri nets, 4th Workshop on Petri Nets, Toulouse, 104–123 (1983).
M-P. Flé and G. Roucairol, Fair serializability of iterated transactions using FIFO-nets, 4th Workshop on Petri Nets, 167–186 (1983).
M. Hack, Decidability questions for Petri nets, Ph.D. Thesis, TR161, Laboratory for Computer Science, MIT, Boston (1976).
R. Kuiper and W. P. de Roever, Fairness assumptions for CSP in a temporal logic framework, Formal Description of Programming Concepts II (Ed. D. Bjøner), 159–170, North Holland (1983).
W. M. Lu and A. Merceron, The Meanings of frozen token, Proc. 1985 ISCAS, Kyoto (1985).
A. Merceron, Private Communication.
T. Murata and Z. H. Wu, Use of Petri nets for distributed control of fairness in concurrent systems, Proc. 1st ICCA, Beijing, 84–91 (1984).
C. A. Petri, Beijing. Lectures (1981).
A. Pnueli, J. Stavi and D. Lehmann, Impartiality, justice and fairness: the Ethics of Concurrent termination, Proc. ICALP’81, Lecture Notes in Computer Science, Vol. 115, 264–277 (1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lu, W. Marking fairness in Petri nets. J. of Compt. Sci. & Technol. 1, 61–69 (1986). https://doi.org/10.1007/BF02943302
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02943302