WiP Abstract: Distributed Reactive Control Synthesis for Aircraft Electric Power Systems via SAT Solving

In this work, we consider a simplified version of the distributed control synthesis problem where the system is modeled as a Boolean network and specifications are given as propositional formulae on environment and system variables. In this relatively static Boolean setting, (centralized) reactive control synthesis problem reduces to a quantified Boolean satisfiability problem which can be solved by off-the-shelf SAT solvers. For the distributed control synthesis, we propose a recursive algorithm that starts from a global assume-guarantee specification and maps it to local assume-guarantee specifications for individual subsystems. Finding these local assume- guarantee specifications leads to a modular design framework. For instance, local controllers for subsystems can be synthesized independently via SAT or a local subsystem can be replaced with another subsystem that satisfies the same local assume-guarantee specifications. We also investigate how the interconnection structure of the network affects the performance of this algorithm. In particular, we show that if the interconnection structure is a multi-tree and the global assumptions and guarantees satisfy certain independence conditions, the algorithm is complete.