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

Complexity analysis becomes a common task in supervisory control. However,many results of interest are spread across different topics. The aim of thispaper is to bring several interesting results from complexity theory and toillustrate their relevance to supervisory control by proving new nontrivialresults concerning nonblockingness in modular supervisory control of discreteevent systems modeled by finite automata.

Complexity of Verifying Nonblockingness in Modular Supervisory Control