Repositorio de producción científica de la Universidad de Sevilla

Fairness in systems based on multiparty interactions

 

Advanced Search
 
Opened Access Fairness in systems based on multiparty interactions
Cites

Show item statistics
Icon
Export to
Author: Ruiz Cortés, David
Corchuelo Gil, Rafael
Toro Bonilla, Miguel
Department: Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos
Date: 2003
Published in: Concurrency and Computation: Practice and Experience, 15 (11-12), 1093-1116.
Document type: Article
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.
Cite: Ruiz Cortés, D., Corchuelo Gil, R. y Toro Bonilla, M. (2003). Fairness in systems based on multiparty interactions. Concurrency and Computation: Practice and Experience, 15 (11-12), 1093-1116.
Size: 627.6Kb
Format: PDF

URI: http://hdl.handle.net/11441/65501

DOI: 10.1002/cpe.782

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)