Information Processing Letters
Fairness
Information and Software Technology
Event fairness and non-interleaving concurrency
Formal Aspects of Computing
Proving partial order properties
Theoretical Computer Science
Fairness and partial order semantics
Information Processing Letters
Information Processing Letters
Liveness, fairness, and recurrence in Petri nets
Information Processing Letters
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
On fairness notions in distributed systems I.4: a characterization of implementability
Information and Computation
On fairness notions in distributed systems II.: equivalence-completions and their hierarchies
Information and Computation
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Distributed Computing
Fairness and hyperfairness in multi-party interactions
Distributed Computing
Generating non-conspiratorial executions
Information Processing Letters
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
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.