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

An infinite run of a timed automaton is Zeno if it spans only a finite amountof time. Such runs are considered unfeasible and hence it is important todetect them, or dually, find runs that are non-Zeno. Over the years importantimprovements have been obtained in checking reachability properties for timedautomata. We show that some of these very efficient optimizations make testingfor Zeno runs costly. In particular we show NP-completeness for theLU-extrapolation of Behrmann et al. We analyze the source of this complexity indetail and give general conditions on extrapolation operators that guarantee a(low) polynomial complexity of Zenoness checking. We propose a slight weakeningof the LU-extrapolation that satisfies these conditions.

Coarse abstractions make Zeno behaviours difficult to detect