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

09/12/2019
by   Ronny Tredup, et al.
0

Boolean Petri nets are differentiated by types of nets τ based on which of the interactions nop, inp, out, set, res, swap, used, and free they apply or spare. The synthesis problem relative to a specific type of nets τ is to find a boolean τ-net N whose reachability graph is isomorphic to a given transition system A. The corresponding decision version of this search problem is called feasibility. Feasibility is known to be polynomial for all types of flip flop derivates that contain at least the interactions nop, swap and an arbitrary selection of inp, out, used, free. In this paper, we replace inp and out by res and set, respectively, and show that feasibility becomes NP-complete for the types that contain nop, swap and a non empty selection of res, set and a non empty selection of used, free. The reduction guarantees a low degree for A's states and, thus, preserves hardness of feasibility even for considerable input restrictions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2020

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)

The problem of τ-synthesis consists in deciding whether a given directed...
research
03/17/2019

Hardness Results for the Synthesis of b-bounded Petri Nets (Technical Report)

Synthesis for a type τ of Petri nets is the following search problem: Fo...
research
09/17/2020

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency

Modeling of real-world systems with Petri nets allows to benefit from th...
research
03/17/2022

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

Synthesis consists in deciding whether a given labeled transition system...
research
11/01/2017

The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs

Elementary net systems (ENS) are the most fundamental class of Petri net...
research
07/17/2020

Efficient Restrictions of Immediate Observation Petri Nets

In a previous paper we introduced immediate observation Petri nets, a su...
research
10/31/2019

Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond

In previous studies, several methods have been developed to synthesise P...

Please sign up or login with your details

Forgot password? Click here to reset