Abstract
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 allows 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 determine whether there exists a valuation of x1,...,xk under which the system K satisfies the property ε, but if so find valuations which satisfy various optimality criteria. In particular, we present algorithms for finding valuations which minimize (or maximize) the maximum (or minimum) 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.
Supported in part by the NSF CAREER award CCR-9734115 and by the DARPA grant NAG2-1214.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, T. Feder, and T.A. Henzinger. The bene_ts of relaxing punctuality. Journal of the ACM, 43(1):116–146, 1996.
R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104(1):35–77, 1993.
R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In Proc. of the 25th ACM STOC, pp. 592–601, 1993.
S. Campos, E. Clarke, and O. Grumberg. Selective quantitative analysis and interval model checking. In Proce. Eighth CAV, LNCS 1102, 1996.
E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pp. 52–71, 1981.
E.M. Clarke and R.P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61–67, 1996.
C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proc. Third CAV, LNCS 575, 1991.
E.A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, vol B, pp. 995–1072. Elsevier Science Publishers, 1990.
E.A. Emerson, A.K. Mok, A.P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Computer-Aided Verification, 2nd International Conference, CAV’90, LNCS 531, pp. 136–145, 1990.
T.A. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata. In Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 373–382, 1995.
R. Koymans. Specifying real-time properties with metric temporal logic. Journal of Real-Time Systems, 2:255–299, 1990.
Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems: Specification. Springer-verlag, 1991.
A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46–77, 1977.
Farn Wang. Parametric timing analysis for real-time systems. Information and Computation, 130(2):131–150, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alur, R., Etessami, K., La Torre, S., Peled, D. (1999). Parametric Temporal Logic for “Model Measuring”. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive