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

Partial order reductions have been successfully applied to model checking ofconcurrent systems and practical applications of the technique show nontrivialreduction in the size of the explored state space. We present a theory ofpartial order reduction based on stubborn sets in the game-theoretical settingof 2-player games with reachability objectives. Our stubborn reduction allowsus to prune the interleaving behaviour of both players in the game, and weformally prove its correctness on the class of games played on general labelledtransition systems. We then instantiate the framework to the class of weightedPetri net games with inhibitor arcs and provide its efficient implementation inthe model checker TAPAAL. Finally, we evaluate our stubborn reduction onseveral case studies and demonstrate its efficiency.

Stubborn Set Reduction for Two-Player Reachability Games