Adaptive strategies for rLTL games

Nayak, Satya Prakash; Neider, Daniel; Zimmermann, Martín

doi:10.1145/3447928.3457210

Cited by 2 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, let us highlight that preliminary results on adaptive strategies have been presented as a poster at the 24th ACM International Conference on Hybrid Systems: Computation and Control [21].…”

Section: Introductionmentioning

confidence: 99%

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime

Nayak

Neider

Zimmermann

2022

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge.Hence, in this paper, we address the robust-by-construction synthesis problem by considering the specifications to be expressed by a robust version of Linear Temporal Logic (LTL), called robust LTL (rLTL). rLTL has a many-valued semantics to capture different degrees of satisfaction of a specification, i.e., satisfaction is a quantitative notion.We argue that the current algorithms for rLTL synthesis do not compute optimal strategies in a non-antagonistic setting. So, a natural question is whether there is a way of satisfying the specification "better" if the environment is indeed not antagonistic. We address this question by developing two new notions of strategies. The first notion is that of adaptive strategies, which, in response to the opponent's non-antagonistic moves, maximize the degree of satisfaction. The idea is to monitor non-optimal moves of the opponent at runtime using multiple parity automata and adaptively change the system strategy to ensure optimality. The second notion is that of strongly adaptive strategies, which is a further refinement of the first notion. These strategies also maximize the opportunities for the opponent to make non-optimal moves. We show that computing such strategies for rLTL specifications is not harder than the standard synthesis problem, e.g., computing strategies with LTL specifications, and takes doubly-exponential time.

show abstract

Section: Introductionmentioning

confidence: 99%

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime

Nayak

Neider

Zimmermann

2022

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic

Anevlavis

Philippe

Neider

et al. 2022

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

While most approaches in formal methods address system correctness, ensuring robustness has remained a challenge. In this article, we present and study the logic rLTL, which provides a means to formally reason about both correctness and robustness in system design. Furthermore, we identify a large fragment of rLTL for which the verification problem can be efficiently solved, i.e., verification can be done by using an automaton, recognizing the behaviors described by the rLTL formula φ, of size at most O(3 |φ |), where |φ | is the length of φ. This result improves upon the previously known bound of O(5|φ |) for rLTL verification and is closer to the LTL bound of O(2|φ |). The usefulness of this fragment is demonstrated by a number of case studies showing its practical significance in terms of expressiveness, the ability to describe robustness, and the fine-grained information that rLTL brings to the process of system verification. Moreover, these advantages come at a low computational overhead with respect to LTL verification.

show abstract

Adaptive strategies for rLTL games

Cited by 2 publications

References 1 publication

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime

Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic

Contact Info

Product

Resources

About