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 prove several decidability and undecidability results for nu-PN, anextension of P/T nets with pure name creation and name management. We give asimple proof of undecidability of reachability, by reducing reachability innets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictlysurpasses that of P/T nets. We prove that nu-PN are Well Structured TransitionSystems. In particular, we obtain decidability of coverability and termination,so that the expressive power of Turing machines is not reached. Moreover, theyare strictly Well Structured, so that the boundedness problem is alsodecidable. We consider two properties, width-boundedness and depth-boundedness,that factorize boundedness. Width-boundedness has already been proven to bedecidable. We prove here undecidability of depth-boundedness. Finally, weobtain Ackermann-hardness results for all our decidable decision problems.

Decision Problems for Petri Nets with Names