Best Fairness Hierarchy in Elementary Nets.
Saved in:
| Title: | Best Fairness Hierarchy in Elementary Nets. |
|---|---|
| Authors: | Ochmanski, Edward1 edoch@mat.uni.torun.pl |
| Source: | Fundamenta Informaticae. Apr2004, Vol. 60 Issue 1-4, p237-250. 14p. 7 Diagrams. |
| Subjects: | Computer multitasking, Sequential processing (Computer science), Electronic data processing, Computer programming, Nets (Mathematics) |
| Abstract: | The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of marking-fairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞-fairness. This result gives a method of a local control ensuring globally fair executions. Next we show how to check, if a given elementary net is conspiracy-free, and prove the obtained criterion to be effectively decidable. Finally, we give a characterization of live concurrent systems, using the notion of ∞-fairness. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
