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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Within a component-based approach allowing dynamic reconfigurations,sequences of successive reconfiguration operations are expressed by means ofreconfiguration paths, possibly infinite. We show that a subclass of such pathscan be modelled by finite state automata. This feature allows us to usetechniques related to model-checking to prove some architectural, event, andtemporal properties related to dynamic reconfiguration. Our method is provedcorrect w.r.t. these properties' definition.

Using Model-Checking Techniques for Component-Based Systems with Reconfigurations