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

Formal verification of multi-agent systems is hard, both theoretically and inpractice. In particular, studies that use a single verification techniquetypically show limited efficiency, and allow to verify only toy examples. Here,we propose some new techniques and combine them with several recently developedones to see what progress can be achieved for a real-life scenario. Namely, weuse fixpoint approximation, domination-based strategy search, partial orderreduction, and parallelization to verify heterogeneous scalable models of theSelene e-voting protocol. The experimental results show that the combinationallows to verify requirements for much more sophisticated models thanpreviously.

Verification of Multi-Agent Properties in Electronic Voting: A Case Study