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

Constant-rate multi-mode systems (MMS) are hybrid systems with finitely manymodes and real-valued variables that evolve over continuous time according tomode-specific constant rates. We introduce a variant of linear temporal logic(LTL) for MMS, and we investigate the complexity of the model-checking problemfor syntactic fragments of LTL. We obtain a complexity landscape where eachfragment is either P-complete, NP-complete or undecidable. These resultsgeneralize and unify several results on MMS and continuous counter systems.

Verifying linear temporal specifications of constant-rate multi-mode systems