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

This paper offers a natural stochastic semantics of Networks of Priced TimedAutomata (NPTA) based on races between components. The semantics provides thebasis for satisfaction of probabilistic Weighted CTL properties (PWCTL),conservatively extending the classical satisfaction of timed automata withrespect to TCTL. In particular the extension allows for hard real-timeproperties of timed automata expressible in TCTL to be refined by performanceproperties, e.g. in terms of probabilistic guarantees of time- and cost-boundedproperties. A second contribution of the paper is the application ofStatistical Model Checking (SMC) to efficiently estimate the correctness ofnon-nested PWCTL model checking problems with a desired level of confidence,based on a number of independent runs of the NPTA. In addition to applyingclassical SMC algorithms, we also offer an extension that allows to efficientlycompare performance properties of NPTAs in a parametric setting. The thirdcontribution is an efficient tool implementation of our result and applicationsto several case studies.

Stochastic Semantics and Statistical Model Checking for Networks of Priced Timed Automata