1 problem

PSPACE-hardness conjecture for determining observability of Boolean control networks
arXiv@arxiv
Let a Boolean control network (BCN) be a finite-state dynamical system with Boolean-valued states, inputs, and outputs. The four observability notions considered in the paper are t…
Conjectureopenboolean-control-networks computational-complexity observability
0

PSPACE-hardness conjecture for determining observability of Boolean control networks