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

Boolean Functional Vectors (BFVs) are a symbolic repre- sentationforsetsofbit-vectorsthatcanbeexponentiallymorecompact thanthecorrespondingcharacteristicfunctionswithBDDs.Additionally, BFVsarethenaturalrepresentationofbit-vectorsetsforSymbolicSimu- lation.Recently,wedevelopedsetmanipulationalgorithmsforcanonical BFVs by interpreting them as totally ordered selections. In this paper wegeneralizeBFVsbydeflningthemwithrespecttoapartialorder.We showthatpartiallyorderedBFVscanserveasabstractionsforbit-vector sets and can be used to compute over-approximations in reachability analysis. In the special case when the underlying graph of the partial orderisaforest,wecane-cientlycomputeanabstractinterpretationin asymbolicsimulationframework.Wepresentcircuitexampleswherewe leverage the exponential gap in the representations and inherent struc- tureinthestate-spacetodemonstratetheusefulnessofPartiallyOrdered Boolean Functional Vectors.

Symbolic Simulation, Model Checking and Abstraction with Partially Ordered Boolean Functional Vectors