Skip to main content
Article thumbnail
Location of Repository

From liveness to promptness

By Orna Kupferman, Nir Piterman and Moshe Y. Vardi

Abstract

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 F p . 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.Peer-reviewedPost-prin

Topics: Temporal logic, Verification, Liveness, AUTOMATA, GAMES
Publisher: Springer
Year: 2009
DOI identifier: 10.1007/s10703-009-0067-z
OAI identifier: oai:lra.le.ac.uk:2381/10057
Journal:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.