Affiliation:
1. Max Planck Institute for Software Systems, Kaiserslautern, Germany
2. Newcastle University, Newcastle, United Kingdom
Abstract
Abstraction-based techniques are an attractive approach for synthesizing correct-by-construction controllers to satisfy high-level temporal requirements. A main bottleneck for successful application of these techniques is the memory requirement, both during controller synthesis (to store the abstract transition relation) and in controller deployment (to store the control map).
We propose memory-efficient methods for mitigating the high memory demands of the abstraction-based techniques using
neural network representations
. To perform synthesis for reach-avoid specifications, we propose an on-the-fly algorithm that relies on compressed neural network representations of the forward and backward dynamics of the system. In contrast to usual applications of neural representations, our technique maintains soundness of the end-to-end process. To ensure this, we correct the output of the trained neural network such that the corrected output representations are sound with respect to the finite abstraction. For deployment, we provide a novel training algorithm to find a neural network representation of the synthesized controller and experimentally show that the controller can be correctly represented as a combination of a neural network and a look-up table that requires a substantially smaller memory.
We demonstrate experimentally that our approach significantly reduces the memory requirements of abstraction-based methods. We compare the performance of our approach with the standard abstraction-based synthesis on several models. For the selected benchmarks, our approach reduces the memory requirements respectively for the synthesis and deployment by a factor of 1.31× 10
5
and 7.13× 10
3
on average, and up to 7.54× 10
5
and 3.18× 10
4
. Although this reduction is at the cost of increased off-line computations to train the neural networks, all the steps of our approach are parallelizable and can be implemented on machines with higher number of processing units to reduce the required computational time.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Reference44 articles.
1. C. Baier and J.-P. Katoen. 2008. Principles of Model Checking. MIT press.
2. Formal Methods for Discrete-Time Dynamical Systems
3. D. P. Bertsekas. 1999. Nonlinear Programming. Athena Scientific.
4. Justin Boyan and Andrew Moore. 1994. Generalization in reinforcement learning: Safely approximating the value function. In Advances in Neural Information Processing Systems, Vol. 7. MIT Press.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献