The Complexity of Boolean State Separation (Technical Report)

Abstract

For a Boolean type of nets $\tau$, a transition system $A$ is synthesizeable into a $\tau$-net $N$ if and only if distinct states of $A$ correspond to distinct markings of $N$, and $N$ prevents a transition firing if there is no related transition in $A$. The former property is called $\tau$-state separation property ($\tau$-SSP) while the latter -- $\tau$-event/state separation property ($\tau$-ESSP). $A$ is embeddable into the reachability graph of a $\tau$-net $N$ if and only if $A$ has the $\tau$-SSP. This paper presents a complete characterization of the computational complexity of \textsc{$\tau$-SSP} for all Boolean Petri net types.

References in corpus (2)

• The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)
• Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete