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

We study generalized possibilistic computation tree logic model checking inthis paper, which is an extension of possibilistic computation logic modelchecking introduced by Y.Li, Y.Li and Z.Ma (2014). The system is modeled bygeneralized possibilistic Kripke structures (GPKS, in short), and the verifyingproperty is specified by a generalized possibilistic computation tree logic(GPoCTL, in short) formula. Based on generalized possibility measures andgeneralized necessity measures, the method of generalized possibilisticcomputation tree logic model checking is discussed, and the correspondingalgorithm and its complexity are shown in detail. Furthermore, the comparisonbetween PoCTL introduced in (2013) and GPoCTL is given. Finally, a thermostatexample is given to illustrate the GPoCTL model-checking method.

Quantitative Computation Tree Logic Model Checking Based on Generalized Possibility Measures