The Mays and Musts of Concurrent Strategies

08/24/2021
by   Simon Castellan, et al.
0

Concurrent strategies based on event structures are examined from the viewpoint of 'may' and 'must' testing in traditional process calculi. In their pure form concurrent strategies fail to expose the deadlocks and divergences that can arise in their composition. This motivates an extension of the bicategory of concurrent strategies to treat the 'may' and 'must' behaviour of strategies under testing. One extension adjoins neutral moves to strategies but in so doing loses identities w.r.t. composition. This in turn motivates another extension in which concurrent strategies are accompanied by stopping configurations; the ensuing stopping strategies inherit the structure of a bicategory from that of strategies. The technical developments converge in providing characterisations of the 'may' and 'must' equivalences and preorders on strategies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2020

Deterministic concurrent systems

We introduce deterministic concurrent systems as a subclass of concurren...
research
08/24/2021

Truly Concurrent Pi-Calculi with Reversibility, Probabilism and Guards

The well-known process algebras, such as CCS, ACP and π-calculus, captur...
research
06/09/2020

Learning to Count up to Symmetry

In this paper we develop the theory of how to count, in thin concurrent ...
research
02/28/2022

Making Concurrency Functional

The article bridges between two major paradigms in computation, the func...
research
11/07/2020

Reasoning about Temporary Coalitions and LTL-definable Ordered Objectives in Infinite Concurrent Multiplayer Games

We propose enhancing the use of propositions for denoting decisions and ...
research
10/16/2020

The Structure of Concurrent Process Histories

We identify the algebraic structure of the material histories generated ...

Please sign up or login with your details

Forgot password? Click here to reset