TY - GEN

T1 - Parametric temporal logic for model measuring

AU - Alur, Rajeev

AU - Etessami, Kousha

AU - La Torre, Salvatore

AU - Peled, Doron

PY - 1999

Y1 - 1999

N2 - We extend the standard model checking paradigm of linear temporal logic, LTL, to a \model measuring" paradigm where one can obtain more quantitative information beyond a "Yes/No" answer. For this purpose, we define a parametric temporal logic, PLTL, which al- lows statements such as "a request p is followed in at most x steps by a response q", where x is a free variable. We show how one can, given a formula (x1; : : : ; xk) of PLTL and a system model K, not only de- Termine whether there exists a valuation of x1; : : : ; xk under which the system K satisfies the property ', but if so find valuations which sa- Tisfy various optimality criteria. In particular, we present algorithms for finding valuations which minimize (or maximize) the maximum (or mi- nimum) of all parameters. These algorithms exhibit the same PSPACE complexity as LTL model checking.We show that our choice of syntax for PLTL lies at the threshold of decidability for parametric temporal logics, in that several natural extensions have undecidable "model measuring" problems.

AB - We extend the standard model checking paradigm of linear temporal logic, LTL, to a \model measuring" paradigm where one can obtain more quantitative information beyond a "Yes/No" answer. For this purpose, we define a parametric temporal logic, PLTL, which al- lows statements such as "a request p is followed in at most x steps by a response q", where x is a free variable. We show how one can, given a formula (x1; : : : ; xk) of PLTL and a system model K, not only de- Termine whether there exists a valuation of x1; : : : ; xk under which the system K satisfies the property ', but if so find valuations which sa- Tisfy various optimality criteria. In particular, we present algorithms for finding valuations which minimize (or maximize) the maximum (or mi- nimum) of all parameters. These algorithms exhibit the same PSPACE complexity as LTL model checking.We show that our choice of syntax for PLTL lies at the threshold of decidability for parametric temporal logics, in that several natural extensions have undecidable "model measuring" problems.

UR - http://www.scopus.com/inward/record.url?scp=84887437507&partnerID=8YFLogxK

U2 - 10.1007/3-540-48523-6_13

DO - 10.1007/3-540-48523-6_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84887437507

SN - 3540662243

SN - 9783540662242

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 159

EP - 168

BT - Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings

PB - Springer Verlag

T2 - 26th International Colloquium on Automata, Languages and Programming, ICALP 1999

Y2 - 11 July 1999 through 15 July 1999

ER -