Abstract
We motivate and study the robustness of fairness notions under refinement of transitions and places in Petri nets. We show that the classical notions of weak and strong fairness are not robust and we propose a hierarchy of increasingly strong, refinement-robust fairness notions. That hierarchy is based on the conflict structure of transitions, which characterizes the interplay between choice and synchronization in a fairness notion. Our fairness notions are defined on non-sequential runs, but we show that the most important notions can be easily expressed on sequential runs as well. The hierarchy is further motivated by a brief discussion on the computational power of the fairness notions.
Postal address: Hagen Völzer, SVRC, The University of Queensland, Qld 4072, Australia; This research was funded in part by Australian Research Council Large Grant A49801500, A Unified Formalism for Concurrent Real-Time Software Development.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distr. Comput., 2:226–241, 1988.
P. C. Attie, N. Francez, and O. Grumberg. Fairness and hyperfairness in multiparty interactions. Distr. Comput., 6:245–254, 1993.
E. Best. Fairness and conspiracies. IPL, 18:215–220, 1984. Erratum ibidem 19:162.
W. Brauer, R. Gold, and W. Vogler. A survey of behaviour and equivalence preserving refinements of Petri nets. LNCS 483. Springer, 1990.
N. Francez. Fairness. Springer, 1986.
N. Francez, R.-J. J. Back, and R. Kurki-Suonio. On equivalence-completions of fairness assumptions. Formal Aspects of Computing, 4:582–591, 1992. 548, 552
Y.-J. Joung. On fairness notions in distributed systems, part I: A characterization of implementability. Information and Computation, 166:1–34, 2001.
Y.-J. Joung. On fairness notions in distributed systems, part II: Equivalencecompletions and their hierarchies. Information and Computation, 166:35–60, 2001.
E. Kindler and W. van der Aalst. Liveness, fairness and recurrence in Petri nets. IPL, 70(6):269–274, June 1999.
E. Kindler and R. Walter. Message passing mutex. In J. Desel, ed., Structures in Concurrency Theory, Workshops in Computing, pp. 205–219, Springer, 1995.
E. Kindler and R. Walter. Mutex needs fairness. IPL, 62:31–39, 1997.
M. Z. Kwiatkowska. Event fairness and non-interleaving concurrency. Formal Aspects of Computing, 1:213–228, 1989.
M. Z. Kwiatkowska. Fairness for Non-Interleaving Concurrency. Technical report no. 22, University of Leicester, Department of Computing Studies, May 1989.
M. Z. Kwiatkowska. Survey of fairness notions. Information and Software Technology, 31(7):371–386, 1989.
L. Lamport. Fairness and hyperfairness. Distr. Comput., 13(4):239–245, 2000.
D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: The ethics of concurrent termination. In Proc. 8th ICALP, LNCS 115, pp. 264–277, 1981.
A. Merceron. Fair processes. In Adv. in Petri Nets, LNCS 266. Springer, 1987.
D. Peled and A. Pnueli. Proving partial order properties. TCS, 126:143–182, 1994.
W. Reisig. Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. In Proc. 11th ICALP, LNCS 172, pp. 403–413. Springer, July 1984.
W. Reisig. Das Verhalten Verteilter Systeme. GMD-Bericht 170, GMD, 1987. R. Oldenbourg Verlag.
W. Reisig. A strong part of concurrency. In Adv. in Petri Nets, LNCS 266, pp. 238–272. Springer, 1987.
R. van Glabbeek and U. Goltz. Refinement of actions and equivalence notions for concurrent systems. Acta Informatica, 37:229–327, 2001.
W. Vogler. Fairness and partial order semantics. IPL, 55:33–39, 1995.
W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In Proceedings ICALP’97, LNCS 1256, pp. 538–548. Springer, 1997.
H. Völzer. Fairneβ, Randomisierung und Konspiration in Verteilten Algorithmen. PhD thesis, Humboldt-Universität zu Berlin, Institut für Informatik, Dec. 2000. in German, http://dochost.rz.hu-berlin.de/dissertationen/voelzer-hagen-2000-12-08.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Völzer, H. (2002). Refinement-Robust Fairness. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_36
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive