On Ethics of Mazurkiewicz Traces

Authors:
Edward Ochmański;Joanna Pieckowska
Affiliations:
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland. E-mail: edoch@mat.uni.torun.pl;Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Institute of Applied Informatics, State Higher School of Vocational Education, Elblag, Poland. E-mail: stod ...
Venue:
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Year:
2007

Citing 15
Cited 0

Fairness and conspiracies

Information Processing Letters
Fairness

Fairness
Combinatorics on traces

Combinatorics on traces
Proving partial order properties

Theoretical Computer Science
A partial trace semantics for Petri nets

Selected papers of the second international colloquium on Words, languages and combinatorics
A trace semantics for Petri nets

Information and Computation
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Refinement-Robust Fairness

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Defining Process Fairness for Non-Interleaving Concurrency

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Place or Transition Petri Nets

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Elementary Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Fan processes

Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Fairness and hyperfairness

Distributed Computing
Defining fairness

CONCUR 2005 - Concurrency Theory
On conspiracies and hyperfairness in distributed computing

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the well-known hierarchy ∞-fair ⊆ 0-fair ⊆ just for sequences (sequential computations) to that of traces (concurrent processes). The fairness hierarchy for traces is similar, but more involved than for sequences. We study this hierarchy, first in general, abstracting from concrete concurrent system, then for basic classes of Petri nets - elementary and place/transition nets. Finally, we define the fairness notions in a non-interleaving way and compare them with the former ones.