Coverability, Termination, and Finiteness in Recursive Petri Nets

09/14/2021
by   Alain Finkel, et al.
0

In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets and context-free grammars, most of the usual problems (reachability, coverability, finiteness, boundedness and termination) were known to be solvable by using non-primitive recursive algorithms. For almost all other extended Petri nets models containing a stack, the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In contrast, we establish 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 of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get a more powerful model than Petri net for free.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 26

12/20/2017

Wadge Degrees of ω-Languages of Petri Nets

We prove that ω-languages of (non-deterministic) Petri nets and ω-langua...
09/19/2018

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)

Petri nets, also known as vector addition systems, are a long establishe...
02/25/2019

Dependent choice as a termination principle

We introduce a new formulation of the axiom of dependent choice that can...
09/19/2018

The Reachability Problem for Petri Nets is Not Elementary

Petri nets, also known as vector addition systems, are a long establishe...
11/11/2020

The complexity of bounded context switching with dynamic thread creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical...
03/03/2020

Sparse Tiling through Overlap Closures for Termination of String Rewriting

We over-approximate reachability sets in string rewriting by languages d...
06/07/2021

Free-Choice Nets With Home Clusters Are Lucent

A marked Petri net is lucent if there are no two different reachable mar...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.