Abstractions for Symbolic Controller Synthesis are Composable
Eric S. Kim, Murat Arcak

TL;DR
This paper introduces a compositional approach to generate abstractions for symbolic controller synthesis, significantly reducing computational costs for high-dimensional systems by modularly combining smaller abstract modules.
Contribution
It presents a novel composition operation for abstract modules, enabling scalable and modular abstraction construction for complex control systems.
Findings
Composition of abstract modules preserves abstraction properties.
Modular approach reduces runtime and memory for high-dimensional systems.
Enables scalable controller synthesis through compositional abstractions.
Abstract
Translating continuous control system models into finite automata allows us to use powerful discrete tools to synthesize controllers for complex specifications. The abstraction construction step is unfortunately hamstrung by high runtime and memory requirements for high dimensional systems. This paper describes how the transition relation encoding the abstract system dynamics can be generated by connecting smaller abstract modules in series and parallel. We provide a composition operation and show that composing a collection of abstract modules yields another abstraction satisfying a feedback refinement relation. Through compositionality we circumvent the acute computational cost of directly abstracting a high dimensional system and also modularize the abstraction construction pipeline.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Embedded Systems Design Techniques · Petri Nets in System Modeling
