Abstract
The paper takes advantage and develops the fundamental Best’s ideas about fairness hierarchy and conspiracies in concurrent systems. Near to the start we characterize liveness with the notion of ∞-fairness. Next we show that the conspiracy-freeness problem is decidable for elementary nets and undecidable for place/transition nets. The main aim of the paper was to put places into work against conspiracies. We show, how marking fairness effectively fights with conspiracies in elementary nets. Next, we introduce the notion of covering fairness, as a tool against conspiracies in place/transition systems. Results of the paper say that one can ensure global fairness on a local level of executions of the systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Best, E.: Fairness and Conspiracies. Information Processing Letters 18, 215–220 (1984); Erratum: IPL 19, 162 (1984)
Carstensen, H.: Fairness bei nebenläufigen Systemen, eine Untersuchung am Modell der Petrinetze. Bericht des FB Informatik, Univ. Hamburg (1986)
Carstensen, H.: Decidability Questions for Fairness in Petri Nets. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 396–407. Springer, Heidelberg (1987)
Desel, J., Reisig, W.: Place/Transition Petri Nets. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998)
Esparza, J., Nielsen, M.: Decidability Issues for Petri Nets. EATCS Bulletin 52, 245–262 (1994)
Kindler, E., van der Aalst, W.: Liveness, Fairness and Recurrence in Petri Nets. Information Processing Letters 70, 269–274 (1999)
Lehman, D., Pnueli, A., Stavi, J.: Impartiality, Justice and Fairness: the Ethics of Concurrent Termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 264–277. Springer, Heidelberg (1981)
Merceron, A.: In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266, pp. 181–195. Springer, Heidelberg (1987)
Ochmański, E.: Best Fairness Hierarchy in Elementary Nets. In: Proc. of CS&P 2003 Workshop, pp. 382–396. Warsaw University (2003)
Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)
Rozenberg, G., Engelfriet, J.: Elementary Net Systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 12–121. Springer, Heidelberg (1998)
Valk, R., Jantzen, M.: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica 21, 643–674 (1985)
Valk, R.: Infinite Behaviour and Fairness. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 377–396. Springer, Heidelberg (1987)
Howell, R., Rosier, L., Yen, H.: A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science 82, 341–372 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ochmański, E. (2004). Covering Fairness against Conspiracies. In: Cortadella, J., Reisig, W. (eds) Applications and Theory of Petri Nets 2004. ICATPN 2004. Lecture Notes in Computer Science, vol 3099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27793-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-27793-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22236-1
Online ISBN: 978-3-540-27793-4
eBook Packages: Springer Book Archive