Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks

Motivated by applications in diagnosing failures in complex infrastructure networks, we consider the configuration sequence completion problem (CSC) for networked systems. The goal of the CSC problem is to choose values for unknown entries in a specified sequence of configurations of a system so that the resulting sequence represents a valid trajectory of the system. This problem generalizes some known decision problems for dynamical systems. We present efficient algorithms for some versions of the CSC problem and computational intractability results for other versions.