pFaces

Synthesis of Symbolic Controllers: A Parallelized and Sparsity-Aware Approach

“…pFaces allows controlling the complexity of symbolic controller synthesis by adding more PEs. The results introduced in [4] outperform all exiting tools for abstraction construction and controller synthesis. However, for a fixed number of PEs, the algorithms still suffer from the state-explosion problem.…”

“…It is only presented for constructing abstractions while controller synthesis is still performed monolithically without taking into account the sparse structure. The second technique [4] provides parallel algorithms targeting high performance (HPC) computing platforms, but suffers from stateexplosion problem when the number of parallel processing elements (PE) is fixed. We briefly discuss each of those techniques and propose an approach that efficiently utilizes both of them.…”

“…The framework pFaces [4] is introduced as an acceleration ecosystem for implementations of symbolic control techniques. Parallel implementations of the abstraction and synthesis algorithms are introduced as computation kernels in pFaces, which are were originally done serially in SCOTS [9].…”

“…Output: A list of characteristic sets: On the other hand, Algorithm 2 in [4] introduces a technique for constructinḡ Σ by using a distributed data container to maintain the transition set T without constructing it explicitly. In [4], using a continuous over-approximation Ω f is favored as opposed to the discrete over-approximation O f since it requires less memory in practice. The actual computation of transitions (i.e., using O f to compute discrete successor states) is delayed to the synthesis phase and done on the fly.…”

“…We then introduce Algorithm 3 which utilizes sparsity to constructΣ in parallel, and is a combination of Algorithm 2 in [4] and Algorithm 2. Function I :…”