On the Complexity of Realizability for Safety LTL and Related Subfragments

preprint2022arXivOpen access

Abstract

We study the realizability problem for Safety LTL, the syntactic fragment of Linear Temporal Logic capturing safe formulas. We show that the problem is EXP-complete, disproving the existing conjecture of 2EXP-completeness. We achieve this by comparing the complexity of Safety LTL with seemingly weaker subfragments. In particular, we show that every formula of Safety LTL can be reduced to an equirealizable formula of the form α∧□ψα\land \Box ψ, where αα is a present formula over system variables and ψψ contains Next as the only temporal operator. The realizability problem for this new fragment, which we call GX0\mathsf{GX}_{\mathsf{0}}, is also EXP-complete.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.