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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The concept of adverse conditions addresses systems interacting with anadversary environment and finds use also in the development of newtechnologies. We present an approach for modeling adverse conditions by graphtransformation systems. In contrast to other approaches forgraph-transformational interacting systems, the presented main constructs aregraph transformation systems. We introduce joint graph transformation systemswhich involve a system, an interfering environment, and an automaton modelingtheir interaction. For joint graph transformation systems, we introduce notionsof (partial) correctness under adverse conditions, which contain thecorrectness of the system and a recovery condition. As main result, we showthat two instances of correctness, namely k-step correctness (recovery in atmost k steps after an environment intervention) and last-minute correctness(recovery until next environment intervention) are expressible in LTL (lineartemporal logic), and that a weaker notion of k-step correctness is expressiblein CTL (computation tree logic).

Modeling Adverse Conditions in the Framework of Graph Transformation Systems