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 study the extension of relational multiagent systems (RMASs), where agentsmanipulate full-fledged relational databases, with data types and facetsequipped with domain-specific, rigid relations (such as total orders).Specifically, we focus on design-time verification of RMASs against richfirst-order temporal properties expressed in a variant of first-ordermu-calculus with quantification across states. We build on previousdecidability results under the "state-bounded" assumption, i.e., in each singlestate only a bounded number of data objects is stored in the agent databases,while unboundedly many can be encountered over time. We recast this condition,showing decidability in presence of dense, linear orders, and facets defined ontop of them. Our approach is based on the construction of a finite-state, soundand complete abstraction of the original system, in which dense linear ordersare reformulated as non-rigid relations working on the active domain of thesystem only. We also show undecidability when including a data type equippedwith the successor relation.

Verification of Relational Multiagent Systems with Data Types (Extended Version)