English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Strong fairness is a notion we can use to ensure that an elementthat is enabled infinitely often in a non–deterministic programme,will eventually be selected for execution so that it can progress. Unfortunately,“eventually” is too weak to induce the intuitive idea of livelinessand leads to anomalies that are not desirable, namely fair finiteness andconspiracies. In this paper, we focus on non–deterministic programmesbased on multiparty interactions and we present a new criteria for selectinginteractions called strong k–fairness that improves on other proposalsin that it addresses both anomalies simultaneously, and k may be set apriori to control its goodness. We also show our notion is feasible, andpresent an algorithm for scheduling interactions in a strongly k–fair mannerusing a theoretical framework to support the multiparty interactionmodel. Our algorithm does not require to transform the source code tothe processes that compose the system; furthermore, it can deal withboth terminating and non–terminating processes.Comisión Interministerial de Ciencia y Tecnología TIC 2000–1106–C02–0

An Algorithm for Ensuring Fairness and Liveness in Non-deterministic Systems Based on Multiparty Interactions