Journal of Computer Science and Technology ›› 1986, Vol. 1 ›› Issue (1): 61-69.

Previous Articles     Next Articles

Marking Fairness in Petri Nets

Lu Weiming   

  1. Institute of Mathematics, Academia Sinica, Beijing, China
  • Received:1985-01-04 Online:1986-01-10 Published:2022-01-20

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.



[1] E. Best, Fairness and conspiracies,Information Process Letters,18 (1984), 215–220.
[2] W. Brauer (ed.), Net theory and applications, Lecture Notes in Computer Science, Vol. 84, Springer Verlag (1980).
[3] H. Carstensen and R. Valk, Infinite behaviours and fairness in Petri nets, 4th Workshop on Petri Nets, Toulouse, 104–123 (1983).
[4] M-P. Flé and G. Roucairol, Fair serializability of iterated transactions using FIFO-nets, 4th Workshop on Petri Nets, 167–186 (1983).
[5] M. Hack, Decidability questions for Petri nets, Ph.D. Thesis, TR161, Laboratory for Computer Science, MIT, Boston (1976).
[6] 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).
[7] W. M. Lu and A. Merceron, The Meanings of frozen token, Proc. 1985 ISCAS, Kyoto (1985).
[8] A. Merceron, Private Communication.
[9] 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).
[10] C. A. Petri, Beijing. Lectures (1981).
[11] 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).
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved