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/

Zendy Plus

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

Zendy Tools

Zendy Open

We investigate the satisfaction of specifications in Prompt Linear TemporalLogic (Prompt-LTL) by concurrent systems. Prompt-LTL is an extension of LTLthat allows to specify parametric bounds on the satisfaction of eventualities,thus adding a quantitative aspect to the specification language. We establish aconnection between bounded fairness, bounded stutter equivalence, and thesatisfaction of Prompt-LTL\X formulas. Based on this connection, we prove thefirst cutoff results for different classes of systems with a parametric numberof components and quantitative specifications, thereby identifying previouslyunknown decidable fragments of the parameterized model checking problem.

Promptness and Bounded Fairness in Concurrent and Parameterized Systems