Abstract
Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alur, R. and Henzinger, T.: Real time logics: Complexity and expressiveness, Inform. and Comput. 104(1) (1993), 35-77.
Bacchus, F. and Kabanza, F.: Planning for temporally extended goals, Ann. Math. Artificial Intelligence 22 (1998), 5-27.
Baier, C. and Clarke, E. M.: The algebraic µ-calculus and MTBDDs, in Proc. 5th Workshop on Logic, Language, Information and Computation (WoLLIC’ 98), 1998, pp. 27-38.
Clarke, E.M., Emerson, E. A. and Sistla, A. P.: Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. on Program. Lang. and Systems 8(2) (1986), 244-263.
Clarke, E. M., Grumberg, O. and Peled, D. A.: Model Checking, MIT Press, Cambridge, MA, 2000.
Cormen, T. H., Leiserson, C. E. and Rivest, R. L.: Introduction to Algorithms, MIT Press, Cambridge, MA, and McGraw-Hill, 1990.
Dasgupta, P., Chakrabarti, P. P., Deka, J. K. and Sriram, S.: Min-max computation tree logic, Artificial Intelligence 127 (2001), 137-162.
Emerson, E. A., Mok, A. K., Sistla, A. P. and Srinivasan, J.: Quantitative temporal reasoning, in First Annual Workshop on Computer-Aided Verification, France, 1989.
Giacomo, G. D. and Vardi, M. Y.: Automata-theoretic approach to planning for temporally extended goals, in Proc. of ECP, 1999.
Mandal, C. R., Cadouri, E., Chakrabarti, P. P., Chatterjee, B. and Majumder, J.: Netlist database reference manual 3.0, National Semiconductor Corp and IIT Kharagpur, 2001 (mail to: bijoy@nsc.com, ppchak@cse.iitkgp.ernet.in).
Patthak, A. C., Bhattacharya, I., Dasgupta, A., Dasgupta, P. and Chakrabarti, P. P.: Quantified computation tree logic, Inform. Process. Lett. 82 (2002), 123-129.
Penfield, P. and Rubenstein, J.: Signal delay in RC tree networks, in Proc. of 19th Design Automation Conference, 1981.
Pillage, L. T. and Rohrer, R. A.: Asymptotic waveform evaluation for timing analysis, IEEE Transactions on Computer Aided Design 9(4) (1990).
Pnueli, A.: The temporal logic of programs, in Proc. of FOCS’77, 1977, pp. 46-57.
Sarkar, S., Chakrabarti, P. P., Niyogi, R. and Dasgupta, P.: Specification of planning goals in branching time logics in stochastic systems, in Proc. of KBCS 2000: Int. Conf. on Knowledge Based Computer Systems, Mumbai, India, 2000.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chatterjee, K., Dasgupta, P. & Chakrabarti, P.P. A Branching Time Temporal Framework for Quantitative Reasoning. Journal of Automated Reasoning 30, 205–232 (2003). https://doi.org/10.1023/A:1023217515688
Issue Date:
DOI: https://doi.org/10.1023/A:1023217515688