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 describe our implementation of downset-manipulating algorithms used tosolve the realizability problem for linear temporal logic (LTL). Thesealgorithms were introduced by Filiot et al.~in the 2010s and implemented in thetools Acacia and Acacia+ in C and Python. We identify degrees of freedom in theoriginal algorithms and provide a complete rewriting of Acacia in C++20articulated around genericity and leveraging modern techniques for betterperformances. These techniques include compile-time specialization of thealgorithms, the use of SIMD registers to store vectors, and severalpreprocessing steps, some relying on efficient Binary Decision Diagram (BDD)libraries. We also explore different data structures to store downsets. Theresulting tool is competitive against comparable modern tools.

Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability