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 networks of processes that all execute the same finite-stateprotocol and communicate via a rendez-vous mechanism. When a process requests arendez-vous, another process can respond to it and they both change theircontrol states accordingly. We focus here on a specific semantics, callednon-blocking, where the process requesting a rendez-vous can change its stateeven if no process can respond to it. In this context, we study theparameterised coverability problem of a configuration, which consists indetermining whether there is an initialnumber of processes and an executionallowing to reach a configuration bigger than a given one. We show that thisproblem is EXPSPACE-complete and can be solved in polynomial time if theprotocol is partitioned into two sets of states, the states from which aprocess can request a rendez-vous and the ones from which it can answer one. Wealso prove that the problem of the existence of an execution bringing all theprocesses in a final state is undecidable in our context. These two problemscan be solved in polynomial time with the classical rendez-vous semantics.

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous