(2019) A symbolic algorithm for lazy synthesis of eager strategies.
|
Text
paper.pdf Download (525kB) | Preview |
Abstract
We present an algorithm for solving two-player safety games that combines a mixed forward/backward search strategy with a symbolic representation of the state space. By combining forward and backward exploration, our algorithm can synthesize strategies that are eager in the sense that they try to prevent progress towards the error states as soon as possible, whereas standard backwards algorithms often produce permissive solutions that only react when absolutely necessary. We provide experimental results for two classes of crafted benchmarks, the benchmark set of the Reactive Synthesis Competition (SYNTCOMP) 2017, as well as a set of randomly generated benchmarks. The results show that our algorithm in many cases produces more eager strategies than a standard backwards algorithm, and solves a number of benchmarks that are intractable for existing tools. Finally, we observe a connection between our algorithm and a recently proposed algorithm for the synthesis of controllers that are robust against disturbances, pointing to possible future applications.
| Item Type: | Article |
|---|---|
| Divisions: | Swen Jacobs (SJ) |
| Depositing User: | Swen Jacobs |
| Date Deposited: | 17 Nov 2019 16:45 |
| Last Modified: | 04 Jun 2021 08:38 |
| Primary Research Area: | NRA2: Reliable Security Guarantees |
| URI: | https://publications.cispa.saarland/id/eprint/2973 |
Actions
Actions (login required)
 |
View Item |