Towards Scalable Synthesis of Stochastic Control Systems
Majid Zamani, Ilya Tkachev, Alessandro Abate

TL;DR
This paper introduces a scalable abstraction technique for stochastic control systems that avoids state-space discretization, enabling more efficient controller synthesis for complex specifications like LTL.
Contribution
A novel abstraction method for incrementally stable stochastic control systems that reduces complexity by only discretizing input sets, improving scalability.
Findings
Successfully synthesized a traffic light coordination schedule.
Demonstrated the approach on a 5-dimensional linear stochastic system.
Showed existing methods are infeasible for high-dimensional systems.
Abstract
Formal control synthesis approaches over stochastic systems have received significant attention in the past few years, in view of their ability to provide provably correct controllers for complex logical specifications in an automated fashion. Examples of complex specifications of interest include properties expressed as formulae in linear temporal logic (LTL) or as automata on infinite strings. A general methodology to synthesize controllers for such properties resorts to symbolic abstractions of the given stochastic systems. Symbolic models are discrete abstractions of the given concrete systems with the property that a controller designed on the abstraction can be refined (or implemented) into a controller on the original system. Although the recent development of techniques for the construction of symbolic models has been quite encouraging, the general goal of formal synthesis over…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
