{"_id":"3365","file":[{"date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:13:37Z","file_id":"5022","file_size":475661,"relation":"main_file","access_level":"open_access","checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","creator":"system","content_type":"application/pdf"}],"status":"public","quality_controlled":"1","publication_status":"published","volume":6605,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"77","ddc":["000","005"],"type":"conference","alternative_title":["LNCS"],"date_published":"2011-09-29T00:00:00Z","title":"QUASY: quantitative synthesis tool","scopus_import":1,"file_date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-11T12:02:55Z","citation":{"short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>.","mla":"Chatterjee, Krishnendu, et al. <i>QUASY: Quantitative Synthesis Tool</i>. Vol. 6605, Springer, 2011, pp. 267–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271."},"month":"09","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"language":[{"iso":"eng"}],"year":"2011","date_updated":"2021-01-12T07:42:58Z","day":"29","publist_id":"3248","intvolume":"      6605","conference":{"end_date":"2011-04-03","start_date":"2011-03-26","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Saarbrucken, Germany"},"doi":"10.1007/978-3-642-19835-9_24","oa_version":"Submitted Version","page":"267 - 271","publisher":"Springer","abstract":[{"text":"We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa":1}