Optimal bounds in parametric LTL games
نویسندگان
چکیده
منابع مشابه
Optimal bounds in parametric LTL games
Parameterized linear temporal logics are extensions of Linear Temporal Logic (LTL) by temporal operators equipped with variables that bound their scope. In model-checking, such specifications were introduced as “PLTL” by Alur et al. and as “PROMPT-LTL” by Kupferman et al. We show how to determine in doubly-exponential time, whether a player wins a game with PLTL winning condition with respect t...
متن کاملOptimal Complexity Bounds for Positive LTL Games
We prove two tight bounds on complexity of deciding graph games with winning conditions defined by formulas from fragments of LTL. Our first result is that deciding LTL+(3,∧,∨) games is in PSPACE. This is a tight bound: the problem is known to be PSPACE-hard even for the much weaker logic LTL+(3,∧). We use a method based on a notion of, as we call it, persistent strategy: we prove that in games...
متن کاملParametric LTL on Markov Chains
This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the untilmodality is equipped with a bound that contains variables; e.g., ♦6x φ asserts that φ holds within x time steps, where x is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations V≺p(φ) for which the p...
متن کاملApproximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time
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 s...
متن کاملLTL Model Checking of Parametric Timed Automata
The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The proposed problem could be solved using an explicit enumeration of all possible parameter valuations. However, we introduce a symb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.07.039