Inferring local transition functions of discrete dynamical systems from observations of system behavior

• Published in: Theoretical computer science Vol. 679; pp. 126 - 144
• Main Authors: Adiga, Abhijin, Kuhlman, Chris J., Marathe, Madhav V., Ravi, S.S., Rosenkrantz, Daniel J., Stearns, Richard E.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 30.05.2017
• Subjects: Computational complexity; Fixed parameter tractability; Phase space; Stable and unstable configurations; Synchronous dynamical systems; Threshold functions; Threshold inference; Trajectory; Stable and unstable configurations; Threshold functions; Trajectory; Synchronous dynamical systems; Computational complexity; Phase space; Threshold inference; Fixed parameter tractability
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2016.07.008

We consider the problem of inferring the local transition functions of discrete dynamical systems from observed behavior. Our focus is on synchronous systems whose local transition functions are threshold functions. We assume that the topology of the system is known and that the goal is to infer a threshold value for each node so that the system produces the observed behavior. We show that some of these inference problems are efficiently solvable while others are NP-complete, even when the underlying graph of the dynamical system is a simple path. We identify a fixed parameter tractable problem in this context. We also consider constrained versions of threshold inference problems where the input includes a set of equality or inequality constraints (which specify pairs of nodes which must have the same threshold value or different threshold values). We present algorithmic and complexity results for several constrained threshold inference problems.