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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the parameterized verification of arbitrarily large networks ofagents which communicate by broadcasting and receiving messages. In our model,the broadcast topology is reconfigurable so that a sent message can be receivedby any set of agents. In addition, agents have local registers which areinitially distinct and may therefore be thought of as identifiers. When anagent broadcasts a message, it appends to the message the value stored in oneof its registers. Upon reception, an agent can store the received value or testthis value for equality with one of its own registers. We consider thecoverability problem, where one asks whether a given state of the system may bereached by at least one agent. We establish that this problem is decidable;however, it is as hard as coverability in lossy channel systems, which isnon-primitive recursive. This model lies at the frontier of decidability asother classical problems on this model are undecidable; this is in particulartrue for the target problem where all processes must synchronize on a givenstate. By contrast, we show that the coverability problem is NP-complete wheneach agent has only one register.

Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability