| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time | Leander Tentrup
; Alexander Weinert
; Martin Zimmermann
; | Date: |
30 Nov 2015 | Abstract: | In this short note, we consider the optimization variant of the realizability
problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which
extends Linear Temporal Logic (LTL) by the prompt eventually operator whose
scope is bounded by a parametric bound. In the realizability optimization
problem, one is interested in computing the optimal bound that allows to
realize a given specification. It is known that this problem is solvable in
triply-exponential time, but not whether it can be done in doubly-exponential
time, i.e., whether it is just as hard as solving LTL realizability. We take a
step towards resolving this problem by showing that the optimum can be
approximated within a factor of 2 in doubly-exponential time. | Source: | arXiv, 1511.9450 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |