Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications

Bansal, Suguman; Li, Yong; Tabajara, Lucas M.; Vardi, Moshe Y.

doi:10.1609/aaai.v34i06.6528

Cited by 28 publications

(28 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this case we do synthesis for LTL over finite traces (LTL f ) and its variants (De Giacomo and Vardi 2015). The algorithms for LTL f synthesis are much simpler that those for LTL synthesis and as a results much more scalable as shown experimentally (Zhu et al 2017;Camacho et al 2018a;Bansal et al 2020).…”

Section: Introductionmentioning

confidence: 89%

“…Moreover, solving DFA game just requires solving adversarial reachability. Several recent papers are showing experimentally that LTL f synthesis is indeed scalable (Zhu et al 2017;Camacho et al 2018a;Camacho, Bienvenu, and McIlraith 2019;Zhu, Pu, and Vardi 2019;Zhu et al 2020;Bansal et al 2020).…”

Section: Algorithm 2 Ltl F Synthesismentioning

confidence: 99%

“…This is the reason of the timeout we get for 17 conjuncts. There are recent techniques that aim at improving the construction of the DFA, see, e.g., (Bansal et al 2020) and these could give a much higher scalability.…”

Section: Experimental Analysismentioning

confidence: 99%

See 2 more Smart Citations

Two-Stage Technique for LTLf Synthesis Under LTL Assumptions

Giacomo

Stasio

Vardi

et al. 2020

Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning

View full text Add to dashboard Cite

In synthesis, assumption are constraints on the environments that rule out certain environment behaviors. A key observation is that even if we consider system with LTLf goals on finite traces, assumptions need to be expressed considering infinite traces, using LTL on infinite traces, since the decision to stop the trace is controlled by the agent. To solve synthesis of LTLf goals under LTL assumptions, we could reduce the problem to LTL synthesis. Unfortunately, while synthesis in LTLf and in LTL have the same worst-case complexity (both are 2EXPTIME-complete), the algorithms available for LTL synthesis are much harder in practice than those for LTLf synthesis. Recently, it has been shown that in basic forms of fairness and stability assumptions we can avoid such a detour to LTL and keep the simplicity of LTLf synthesis. In this paper, we generalize these results and show how to effectively handle any kind of LTL assumptions. Specifically, we devise a two-stage technique for solving LTLf under general LTL assumptions and show empirically that this technique performs much better than standard LTL synthesis.

show abstract

Section: Introductionmentioning

confidence: 89%

Section: Algorithm 2 Ltl F Synthesismentioning

confidence: 99%

See 1 more Smart Citation

Two-Stage Technique for LTLf Synthesis Under LTL Assumptions

Giacomo

Stasio

Vardi

et al. 2020

Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning

View full text Add to dashboard Cite

show abstract

“…For an apples-to-apples comparison, we implement three algorithms: To avoid completely randomized benchmarks, we create ∼290 benchmarks from LTL f benchmark suite [29]. The state-of-the-art LTL f -to-automaton tool Lisa [8] is used to convert LTL f to (non-quantitative) graph games. Weights are randomly assigned to transitions.…”

Section: Implementation and Empirical Evaluationmentioning

confidence: 99%

On Satisficing in Quantitative Games

Bansal

Chatterjee

Vardi

2021

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound.This work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization.

show abstract

“…1) Explicit Minimal DFA Construction: Inspired by [26], we borrow the rich APIs from SPOT [16] to perform each computation. In particular, SPOT adopts the semi-symbolic representation for automata, where the states are explicit and transitions are symbolic, and therefore, we use it to implement the explicit approach.…”

Section: A Implementationmentioning

confidence: 99%

On the Power of Automata Minimization in Reactive Synthesis

Zhu,

Tabajara,

et al. 2020

Preprint

View full text Add to dashboard Cite

Reactive synthesis is the problem of automatically constructing a reactive system from a formal specification, with the guarantee that the executions of the system align with the specification. The specification is often described in temporal logic. Some types of specifications can be converted into deterministic finite automata (DFA) as an intermediate step in synthesis, thus benefiting from the fact that DFAs can be fully minimized in polynomial time. In this work we investigate DFAminimization algorithms in the context of temporal synthesis. In particular, we compare between the Hopcroft and Brzozowski minimization algorithms, adapting them to start from temporallogic formulas and integrating them into an existing temporal synthesis framework. While earlier studies comparing the two algorithms for randomly-generated automata concluded that neither algorithm dominates, our results suggest that in the context of temporal-synthesis, Hopcroft's algorithm is the best choice. Analyzing the results, we observe that the reason for the poor performance of Brzozowski's algorithm is a discrepancy between theory and practice. This algorithm first constructs a DFA for the reverse language of the specification and then performs a series of operations to transform it into a minimal DFA for the specification itself. In theory, the DFA for the reverse language can be exponentially smaller, which would potentially make this algorithm more efficient than directly constructing the DFA for the original specification. In practice, however, we find that the reverse DFA is often of comparable size or even larger, which cancels the advantage that this approach could have.

show abstract

Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications

Cited by 28 publications

References 18 publications

Two-Stage Technique for LTLf Synthesis Under LTL Assumptions

Two-Stage Technique for LTLf Synthesis Under LTL Assumptions

On Satisficing in Quantitative Games

On the Power of Automata Minimization in Reactive Synthesis

Contact Info

Product

Resources

About