Fairness is among the most well known properties of Petri net systems, but it has not been investigated in depth for the purpose of application. This paper aims at such an investigation, and as a result, alternative definitions based on synchronic distances are proposed with examples for illustration.
Carstensen, H. and Valk, R.1985: Infinite behavior and fairness in Petri nets. In Rozenberg G., editor, Lecture Notes in Computer Science 188 (Advances in Petri Nets), 83-100.
2.
Goltz, U., Reisig, W. and Thiagarajan, P.S.1982: Two alternative definitions of synchronic distance. Application and theory of Petri nets: selected papers from the First and Second European Workshop on Application and Theory of Petri Nets, Strasbourg, 23-26 September 1980, Bad Honnef, and 28-30 September 1981. Springer-Verlag , 96-103.
3.
LNCS: Lecture Notes in Computer Science84, 222, 254, 255.
4.
Petri, C.A.1973: Concepts of net theory. Mathematical Foundations of Computer Science: Proceeding of Symposium and Summer School, High Tatras, 3-8 September 1979. Mathematical Institute of the Slovak Academy of Sciences, 137-146.
5.
Queille, J.P. and Sifakis, J.1983: Fairness and related properties in transition system - a temporal logic to deal with fairness. Acta Informatica19, 195-220.
6.
Silva, M. and Murata, T.1986: B-fairness and structural B-fairness in Petri net models of concurrent systems. Technical Report No. 86-10, EECS-Department, University of Illinois at Chicago.
7.
Wu, Z. & Murata, T.1983: Fair Petri nets and weighted synchronic distance. In Sinencio, E.S., editor, Proceedings of the 26th Midwest Symposium on Circuits and Systems, Instituto Nacional de Astrofisica, Optica y Electronica, Puebla, Mexico, 15-16 August, 129-133.
8.
Yuan, C.2005: The principle and application of Petri net. Publishing House of Electronics Industry.
