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

We define a game on 1-safe Petri nets, where a user plays against anenvironment in order to reach a goal on the system. The goal is expressedthrough an LTL-X formula, and represents a behaviour of the system that theuser needs to guarantee. The user can try to reach his goal by controlling asubset of transitions, and by observing a subset of local states. Although wedo not put any requirement on the local states observable by the user, weassume that he cannot be sure to observe them in the exact moment in which theybecome marked. For this reason, we define a notion of stability of theobservation. We propose a method to determine whether the user has a winningstrategy, i.e. if he can win every play by taking some decisions based on theinformation available for him.

Looking for winning strategies in two-player games on Petri nets with partial observability