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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Interleaved models of computations limit the number of system components that can change states simultaneously. This restriction often decreases efficiency of symbolic verification methods based on binary decision diagrams. We propose to ignore this restriction, and allow all components to change states simultaneously. This approach may result in an over-approximation of reachable states. We show that if a system satisfies certain conditions, then the approach computes reachable states exactly. We also show that even if a system does not meet these conditions, it is still possible to compute its reachable states exactly by only partially removing interleaving restrictions. We present experiments that show that the approach improves efficiency of symbolic verification, even when costs of correctness testing are taken into account.

Correctness of the concurrent approach to symbolic verification of interleaved models