On the expressiveness and efficiency of guarded lists in Bach

Concurrency theory has received considerable attention, but mostly in the scope of synchronous process algebras such as CCS, CSP, and ACP. As another way of handling concurrency, data-based coordination languages aim to provide a clear separation between interaction and computation by synchronizing...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 142; p. 101017
Main Authors Barkallah, Manel, Jacquet, Jean-Marie
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2025
Subjects
Coordination
Expressiveness
Guarded list
Model checking
Modular embedding
Model checking
Expressiveness
Modular embedding
Coordination
Guarded list
Online AccessGet full text

Cover

More Information
Summary:Concurrency theory has received considerable attention, but mostly in the scope of synchronous process algebras such as CCS, CSP, and ACP. As another way of handling concurrency, data-based coordination languages aim to provide a clear separation between interaction and computation by synchronizing processes asynchronously by means of information being available or not on a shared space. Although these languages enjoy interesting properties, verifying program correctness remains challenging. In particular, model checking logic formulae is known to raise performance issues due to the state space explosion problem. In this paper, we propose a guarded list construct as a solution to address this problem. Beyond increasing performance, it also enriches the expressiveness of data-based coordination languages and allows for program transformations that further increase the speed of computations.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.101017