TY - GEN

T1 - From liveness to promptness

AU - Kupferman, Orna

AU - Piterman, Nir

AU - Vardi, Moshe Y.

PY - 2007

Y1 - 2007

N2 - Liveness temporal properties state that something "good" eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the "wait time" for an eventuality to be fulfilled. That is, Fθ asserts that θ holds eventually, but there is no bound on the time when θ will hold. This is troubling, as designers tend to interpret an eventuality Fθ as an abstraction of a bounded eventuality F≤kθ, for an unknown k, and satisfaction of a liveness property is often not acceptable unless we can bound its wait time. We introduce here PROMPT-LTL, an extension of LTL with the prompt-eventually operator Fp. A system S satisfies a PROMPT-LTL formula φ if there is some bound k on the wait time for all prompt-eventually subformulas of φ in all computations of S. We study various problems related to PROMPT-LTL, including realizability, model checking, and assume-guarantee model checking, and show that they can be solved by techniques that are quite close to the standard techniques for LTL.

AB - Liveness temporal properties state that something "good" eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the "wait time" for an eventuality to be fulfilled. That is, Fθ asserts that θ holds eventually, but there is no bound on the time when θ will hold. This is troubling, as designers tend to interpret an eventuality Fθ as an abstraction of a bounded eventuality F≤kθ, for an unknown k, and satisfaction of a liveness property is often not acceptable unless we can bound its wait time. We introduce here PROMPT-LTL, an extension of LTL with the prompt-eventually operator Fp. A system S satisfies a PROMPT-LTL formula φ if there is some bound k on the wait time for all prompt-eventually subformulas of φ in all computations of S. We study various problems related to PROMPT-LTL, including realizability, model checking, and assume-guarantee model checking, and show that they can be solved by techniques that are quite close to the standard techniques for LTL.

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

U2 - 10.1007/978-3-540-73368-3_44

DO - 10.1007/978-3-540-73368-3_44

M3 - Conference contribution

AN - SCOPUS:38149134374

SN - 3540733671

SN - 9783540733676

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

SP - 406

EP - 419

BT - Computer Aided Verification - 19th International Conference, CAV 2007, Proceedings

PB - Springer Verlag

T2 - 19th International Conference on Computer Aided Verification, CAV 2007

Y2 - 3 July 2007 through 7 July 2007

ER -