Rajeev Alur
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 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. Theses 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.
- ALUR, R., FEDER,T.,AND HENZINGER, T. 1996. The benefits of relaxing punctuality. Journal of the ACM 43, 1, 116-146. Google Scholar
- ALUR,R.AND HENZINGER, T. 1993. Real-time logics: complexity and expressiveness. Information and Computation 104, 1, 35-77. Google Scholar
- ALUR, R., HENZINGER,T.,AND VARDI, M. 1993. Parametric real-time reasoning. In Proceedings of the 25th ACM Symposium on Theory of Computing. 592-601. Google Scholar
- CAMPOS, S., CLARKE, E., AND GRUMBERG, O. 1996. Selective quantitative analysis and interval model checking. In Proceedings of the Eighth International Conference on Computer Aided Verification. LNCS 1102. Springer-Verlag. Google Scholar
- CLARKE,E.AND EMERSON, E. A. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. workshop on logic of programs. LNCS, vol. 131. Springer- Verlag, 52-71. Google Scholar
- CLARKE,E.AND KURSHAN, R. 1996. Computer-aided verification. IEEE Spectrum 33, 6, 61-67. Google Scholar
- COURCOUBETIS,C.AND YANNAKAKIS, M. 1991. Minimum and maximum delay problems in real-time systems. In Proceedings of the Third Workshop on Computer-Aided Verification. LNCS 575. Springer-Verlag, 399-409. Google Scholar
- EMERSON, E., MOK, A., SISTLA, A., AND SRINIVASAN, J. 1990. Quantitative temporal reasoning. In Computer-Aided Verification, 2nd International Conference, CAV'90. LNCS 531. Springer-Verlag, 136-145. Google Scholar
- EMERSON, E. A. 1990. Temporal and modal logics. In Handbook of Theoret. Comput. Sci.,J.v. Leeuwen, Ed. Vol. B. Elsevier, Amsterdam, 995-1072. Google Scholar
- EMERSON,E.A.AND TREFLER, R. J. 1999. Parametric quantitative temporal reasoning. In 14th IEEE Symp. on Logic in Computer Science. 336-343. Google Scholar
- HENZINGER, T., KOPKE, P., PURI, A., AND VARAIYA, P. 1995. What's decidable about hybrid automata. Journal of Computer and System Sciences 25, 94-124. Google Scholar
- HOLZMANN, G. 1997. The model checker spin. IEEE Trans. on Software Engineering 23, 5, 279- 295. Google Scholar
- KOYMANS, R. 1990. Specifying real-time properties with metric temporal logic. Journal of Real- Time Systems 2, 255-299. Google Scholar
- LICHTENSTEIN,O.AND PNUELI, A. 1985. Checking that finite-state concurrent programs satisfy their linear specification. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages. 97-107. Google Scholar
- MANNA,Z.AND PNUELI, A. 1991. The temporal logic of reactive and concurrent systems: Specification. Springer-verlag. Google Scholar
- PNUELI, A. 1977. The temporal logic of programs. In Proc. 18th Symp. on Foundations of Computer Science. 46-57.Google Scholar
- WANG, F. 1996. Parametric timing analysis for real-time systems. Information and Computation 130, 2 (1 Nov.), 131-150. Google Scholar
Index Terms
- Parametric temporal logic for “model measuring”
Recommendations
Model checking fuzzy computation tree logic
Traditional temporal logics such as linear temporal logic and computation tree logic are widely used to specify properties of reactive systems. Model checking is a well-established technique for verifying if a desired property described as a temporal ...
Regular model checking for LTL(MSO)
Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of ...
Efficient model checking via the equational /spl mu/-calculus
LICS '96: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer ScienceThis paper studies the use of an equational variant of the modal /spl mu/-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the /...
Comments