Abstract
We study the notion of fairness in Petri Nets using processes, which are partially ordered sets, to describe their semantics. Processes do not contain more causality than the one specified in the marked net. We define, in a hierarchical way, transition-fair processes and marking-fair processes. Conspiracy phenomena may be encompassed by this hierarchical definition. We show that a process is transition-fair iff any of its associated occurrence sequence is transition-fair. We show that the hierarchy does not collapse in general for transition-fairness and that it does collapse for marking-fairness. Finally, implications between transition-fairness and marking-fairness are studied for three classes of marked nets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Best Fairness and Conspiracies. IPL Vol.18 pp.215–220 (1984)
E. Best and R. Devillier Sequential and Concurrent Behaviour in Petri Net Theory. To appear in Theoretical Computer Science (1987)
E. Best and C. Fernández Notations and Terminology on Petri Nets. Arbeitspapier der GMD 195, GMD, Postfach 1240, D-5205 St Augustin 1, also Petri Net Newsletter 23 (1986)
E. Best and A. Merceron Frozen Tokens and D-Continuity: A Study in Relating System Properties to Process properties. LNCS Vol.188 pp.48–61 (1985)
H. Carstensen Fairness Criteria that Guarantee Infinite Firing of Transitions. IFI-HH-M-109/83 Universitaet Hamburg (1983)
H. Carstensen and R. Valk Infinite Behaviours and Fairness in Petri Nets. LNCS Vol.188 pp.83–100 (1985)
F. Commoner, A.W. Holt, S. Even and A. Pnueli Marked directed graphs. Journal of Computer and System Sciences 5, pp.511–523 (1971)
C. Fernández and P.S. Thiagarajan A Lattice Theoretic View of K-density. LNCS Vol. 188 pp.139–163 (1985)
H.J. Genrich and K. Lautenbach Synchronisationsgraphen. Acta Informatica 2, pp.143–161 (1973)
U. Goltz and W. Reisig The Non-Sequential Behaviours of Petri Nets. Information and Control Vol.57 Nos 2–3 pp.125–147 (1983)
T. Murata and Z.H. Wu Fair Relation and Modified Synchronic Distances in a Petri Net. Journal of the Franklin Institute Vol. 320 No.2 pp.63–82 (1985)
J.P. Queille and J. Sifakis Fairness ane Related Properties in Transitions Systems A Time Logic to Deal with Fairness. R.R. 292 CNRS Université Scientifique et Médicale de Grenoble (1982)
W. Reisig On the semantics of Petri Nets. In: Formal Models in Programming Ed: E.J. Neuhold and G. Chroust North Holland pp.347–372 (1985)
W. Reisig A Strong Part of Concurrency. In this volume.
R. Valk Infinite Behaviour of Petri Nets. Theoretical Computer Science Vol.25 pp.311–341 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merceron, A. (1987). Fair processes. In: Rozenberg, G. (eds) Advances in Petri Nets 1987. APN 1986. Lecture Notes in Computer Science, vol 266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18086-9_26
Download citation
DOI: https://doi.org/10.1007/3-540-18086-9_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18086-9
Online ISBN: 978-3-540-47743-3
eBook Packages: Springer Book Archive