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

This paper proposes a sound procedure to verify properties of communicatingsession automata (CSA), i.e., communicating automata that include multipartysession types. We introduce a new asynchronous compatibility property for CSA,called k-multiparty compatibility (k-MC), which is a strict superset of thesynchronous multiparty compatibility used in theories and tools based onsession types. It is decomposed into two bounded properties: (i) a conditioncalled k-safety which guarantees that, within the bound, all sent messages canbe received and each automaton can make a move; and (ii) a condition calledk-exhaustivity which guarantees that all k-reachable send actions can be firedwithin the bound. We show that k-exhaustivity implies existential boundedness,and soundly and completely characterises systems where each automaton behavesequivalently under bounds greater than or equal to k. We show that checkingk-MC is PSPACE-complete, and demonstrate its performance empirically over largesystems using partial order reduction.

Verifying Asynchronous Interactions via Communicating Session Automata