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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the early two-thousands, Recursive Petri nets have been introduced inorder to model distributed planning of multi-agent systems for which countersand recursivity were necessary. Although Recursive Petri nets strictly extendPetri nets and context-free grammars, most of the usual problems (reachability,coverability, finiteness, boundedness and termination) were known to besolvable by using non-primitive recursive algorithms. For almost all otherextended Petri nets models containing a stack, the complexity of coverabilityand termination are unknown or strictly larger than EXPSPACE. In contrast, weestablish here that for Recursive Petri nets, the coverability, termination,boundedness and finiteness problems are EXPSPACE-complete as for Petri nets.From an expressiveness point of view, we show that coverability languages ofRecursive Petri nets strictly include the union of coverability languages ofPetri nets and context-free languages. Thus we get a more powerful model thanPetri net for free.

Coverability, Termination, and Finiteness in Recursive Petri Nets