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

07/24/2020
by   Ronny Tredup, et al.
0

The problem of τ-synthesis consists in deciding whether a given directed labeled graph A is isomorphic to the reachability graph of a Boolean Petri net N of type τ. In case of a positive decision, N should be constructed. For many Boolean types of nets, the problem is NP-complete. This paper deals with a special variant of τ-synthesis that imposes restrictions for the target net N: we investigate dependency d-restricted τ-synthesis (DRτS) where each place of N can influence and be influenced by at most d transitions. For a type τ, if τ-synthesis is NP-complete then DRτS is also NP-complete. In this paper, we show that DRτS parameterized by d is in XP. Furthermore, we prove that it is W[2]-hard, for many Boolean types that allow unconditional interactions set and reset.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
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/2019

The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)

Boolean Petri nets equipped with nop allow places and transitions to be ...
research
02/12/2020

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete

For a given labelled transition system (LTS), synthesis is the task to f...
research
06/10/2018

Towards Completely Characterizing the Complexity of Boolean Nets Synthesis

Boolean nets are Petri nets that permit at most one token per place. Res...
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...

Please sign up or login with your details

Forgot password? Click here to reset