{"date_updated":"2021-01-12T07:44:31Z","date_created":"2018-12-11T12:04:08Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee"},{"full_name":"Dasgupta, Pallab","last_name":"Dasgupta","first_name":"Pallab"},{"full_name":"Chakrabarti, Partha P","last_name":"Chakrabarti","first_name":"Partha"}],"title":"A branching time temporal framework for quantitative reasoning","_id":"3593","day":"01","year":"2003","issue":"2","page":"205 - 232","intvolume":"        30","quality_controlled":0,"doi":"10.1023/A:1023217515688","publication_status":"published","publist_id":"2790","type":"journal_article","publisher":"Springer","citation":{"mla":"Chatterjee, Krishnendu, et al. “A Branching Time Temporal Framework for Quantitative Reasoning.” <i>Journal of Automated Reasoning</i>, vol. 30, no. 2, Springer, 2003, pp. 205–32, doi:<a href=\"https://doi.org/10.1023/A:1023217515688\">10.1023/A:1023217515688</a>.","ista":"Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.","short":"K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232.","ieee":"K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” <i>Journal of Automated Reasoning</i>, vol. 30, no. 2. Springer, pp. 205–232, 2003.","apa":"Chatterjee, K., Dasgupta, P., &#38; Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. <i>Journal of Automated Reasoning</i>. Springer. <a href=\"https://doi.org/10.1023/A:1023217515688\">https://doi.org/10.1023/A:1023217515688</a>","ama":"Chatterjee K, Dasgupta P, Chakrabarti P. A branching time temporal framework for quantitative reasoning. <i>Journal of Automated Reasoning</i>. 2003;30(2):205-232. doi:<a href=\"https://doi.org/10.1023/A:1023217515688\">10.1023/A:1023217515688</a>","chicago":"Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” <i>Journal of Automated Reasoning</i>. Springer, 2003. <a href=\"https://doi.org/10.1023/A:1023217515688\">https://doi.org/10.1023/A:1023217515688</a>."},"publication":"Journal of Automated Reasoning","month":"02","extern":1,"volume":30,"date_published":"2003-02-01T00:00:00Z","abstract":[{"lang":"eng","text":"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."}],"status":"public"}