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

Concurrency theory has received considerable attention, but mostly in thescope of synchronous process algebras such as CCS, CSP, and ACP. As another wayof handling concurrency, data-based coordination languages aim to provide aclear separation between interaction and computation by synchronizing processesasynchronously by means of information being available or not on a sharedspace. Although these languages enjoy interesting properties, verifying programcorrectness remains challenging. Some works, such as Anemone, have introducedfacilities, including animations and model checking of temporal logic formulae,to better grasp system modelling. However, model checking is known to raiseperformance issues due to the state space explosion problem. In this paper, wepropose a guarded list construct as a solution to address this problem. Weestablish that the guarded list construct increases performance while strictlyenriching the expressiveness of data-based coordination languages. Furthermore,we introduce a notion of refinement to introduce the guarded list construct ina correctness-preserving manner.

On the Introduction of Guarded Lists in Bach: Expressiveness, Correctness, and Efficiency Issues