Efficient Restrictions of Immediate Observation Petri Nets

07/17/2020
by   Michael Raskin, et al.
0

In a previous paper we introduced immediate observation Petri nets, a subclass of Petri nets with application domains in distributed protocols (population protocols) and theoretical chemistry (chemical reaction networks). IO nets enjoy many useful properties, but like the general case of conservative Petri nets they have a PSPACE-complete reachability problem. In this paper we explore two restrictions of the reachability problem for IO nets which lower the complexity of the problem drastically. The complexity is NP-complete for the first restriction with applications in distributed protocols, and it is polynomial for the second restriction with applications in chemical settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2019

Parameterized Analysis of Immediate Observation Petri Nets

We introduce immediate observation Petri nets, a class of interest in th...
research
11/22/2022

Reachability in Restricted Chemical Reaction Networks

The popularity of molecular computation has given rise to several models...
research
09/19/2023

On the Realisability of Chemical Pathways

The exploration of pathways and alternative pathways that have a specifi...
research
01/27/2020

On the Flatness of Immediate Observation Petri Nets

In a previous paper we introduced immediate observation (IO) Petri nets,...
research
09/12/2019

Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete

Boolean Petri nets are differentiated by types of nets τ based on which ...
research
04/26/2022

Distributed controller synthesis for deadlock avoidance

We consider the distributed control synthesis problem for systems with l...
research
09/14/2021

Coverability, Termination, and Finiteness in Recursive Petri Nets

In the early two-thousands, Recursive Petri nets have been introduced in...

Please sign up or login with your details

Forgot password? Click here to reset