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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The coverability and boundedness problems for Petri nets are known to beExpspace-complete. Given a Petri net, we associate a graph with it. With thevertex cover number k of this graph and the maximum arc weight W as parameters,we show that coverability and boundedness are in ParaPspace. This means thatthese problems can be solved in space O(ef(k,W)poly(n)), where ef(k,W) is someexponential function and poly(n) is some polynomial in the size of the input.We then extend the ParaPspace result to model checking a logic that can expresssome generalizations of coverability and boundedness.

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier