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

Recently there has been a great attention from the scientific communitytowards the use of the model-checking technique as a tool for test generationin the simulation field. This paper aims to provide a useful mean to get moreinsights along these lines. By applying recent results in the field of gradedtemporal logics, we present a new efficient model-checking algorithm forHierarchical Finite State Machines (HSM), a well established symbolism long andwidely used for representing hierarchical models of discrete systems.Performing model-checking against specifications expressed using gradedtemporal logics has the peculiarity of returning more counterexamples within aunique run. We think that this can greatly improve the efficacy ofautomatically getting test cases. In particular we verify two different modelsof HSM against branching time temporal properties.

Graded CTL Model Checking for Test Generation