Covering Fairness against Conspiracies

摘要

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 undecid-able 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.