Name
Abstract | ||
|---|---|---|
In the context of the Multiparty Interaction Model, fairness is used to insure that an interaction that is enabled sufficiently often in a concurrent program will eventually be selected for execution. Unfortunately, this notion does not take conspiracies into account, i.e. situations in which an interaction never becomes enabled because of an unfortunate interleaving of independent actions; furthermore, eventual execution is usually too weak for practical purposes since this concept can only be used in the context of infinite executions. In this article, we present a new fairness notion, k-conspiracy-free fairness, that improves on others because it takes finite executions into account, alleviates conspiracies that are not inherent to a program, and k may be set a priori to control its goodness to address the above-mentioned problems. Copyright (C) 2003 John Wiley Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1002/cpe.782 | CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE |
Keywords | DocType | Volume |
concurrent programs, multiparty interactions, fairness, fair finiteness, conspiracies | Journal | 15 |
Issue | ISSN | Citations |
11-12 | 1532-0626 | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Ruiz | 1 | 152 | 20.62 |
| Rafael Corchuelo | 2 | 389 | 49.87 |
| Miguel Toro | 3 | 0 | 0.34 |