Control Synthesis for Permutation-Symmetric High-Dimensional Systems With Counting Constraints
It enables correct-by-construction control for high-dimensional symmetric systems, addressing a scalability bottleneck in formal synthesis.
This work presents a method for synthesizing provably correct controllers for high-dimensional systems with tens of thousands of states by exploiting permutation symmetry and counting constraints, enabling control for systems previously intractable due to dimensionality.
General purpose correct-by-construction synthesis methods are limited to systems with low dimensionality or simple specifications. In this work we consider highly symmetrical counting problems and exploit the symmetry to synthesize provably correct controllers for systems with tens of thousands of states. The key ingredients of the solution are an aggregate abstraction procedure for mildly heterogeneous systems and a formulation of counting constraints as linear inequalities.