[{"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2011-06-24","start_date":"2011-06-21","location":"Toronto, Canada","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2011.33","month":"06","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IEEE","year":"2011","date_updated":"2023-02-23T12:23:54Z","date_created":"2018-12-11T12:02:52Z","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"related_material":{"record":[{"id":"2038","status":"public","relation":"later_version"},{"id":"5385","relation":"earlier_version","status":"public"}]},"article_number":"5970226","file_date_updated":"2020-07-14T12:46:09Z","ec_funded":1,"publist_id":"3259","citation":{"mla":"Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33"},"date_published":"2011-06-21T00:00:00Z","scopus_import":1,"day":"21","has_accepted_license":"1","title":"Temporal specifications with accumulative values","status":"public","ddc":["000","004"],"_id":"3356","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"4960","checksum":"792128f5455f0f40f1105f0398e05fa9","date_created":"2018-12-12T10:12:42Z","date_updated":"2020-07-14T12:46:09Z","access_level":"open_access","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","content_type":"application/pdf","file_size":225426,"creator":"system"}],"oa_version":"Submitted Version","pubrep_id":"83","type":"conference","abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}]},{"publication_identifier":{"issn":["2664-1690"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2011-0003","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"ec_funded":1,"file_date_updated":"2020-07-14T12:46:41Z","date_created":"2018-12-12T11:39:02Z","date_updated":"2023-02-23T11:23:41Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"2038"},{"id":"3356","relation":"later_version","status":"public"}]},"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"publisher":"IST Austria","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","year":"2011","has_accepted_license":"1","day":"04","date_published":"2011-04-04T00:00:00Z","page":"14","citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.","mla":"Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011."},"abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","file":[{"file_id":"5461","relation":"main_file","date_created":"2018-12-12T11:53:00Z","date_updated":"2020-07-14T12:46:41Z","checksum":"8491d0d48c4911620ecd5350b413c11e","file_name":"IST-2011-0003_IST-2011-0003.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":366281}],"oa_version":"Published Version","pubrep_id":"21","title":"Temporal specifications with accumulative values","status":"public","ddc":["000","004"],"_id":"5385","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"04","day":"26","oa":1,"citation":{"ieee":"T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.","apa":"Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","ama":"Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","mla":"Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005."},"page":"25","doi":"10.15479/AT:IST-2011-0005","date_published":"2011-04-26T00:00:00Z","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures."}],"file_date_updated":"2020-07-14T12:46:40Z","year":"2011","_id":"5383","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publisher":"IST Austria","ddc":["000","006"],"publication_status":"published","status":"public","title":"On an efficient decision procedure for imperative tree data structures","pubrep_id":"19","related_material":{"record":[{"id":"3323","relation":"later_version","status":"public"}]},"author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"last_name":"Muñiz","first_name":"Marco","full_name":"Muñiz, Marco"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"}],"file":[{"file_name":"IST-2011-0005_IST-2011-0005.pdf","access_level":"open_access","file_size":619053,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5462","date_created":"2018-12-12T11:53:01Z","date_updated":"2020-07-14T12:46:40Z","checksum":"b20029184c4a819c5f4466a4a3d238b5"}],"oa_version":"Published Version","date_updated":"2023-02-23T11:22:16Z","date_created":"2018-12-12T11:39:01Z"},{"publist_id":"3312","abstract":[{"text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures.","lang":"eng"}],"type":"conference","alternative_title":["LNAI "],"related_material":{"record":[{"id":"5383","relation":"earlier_version","status":"public"}]},"author":[{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"last_name":"Muñiz","first_name":"Marco","full_name":"Muñiz, Marco"},{"first_name":"Viktor","last_name":"Kuncak","full_name":"Kuncak, Viktor"}],"oa_version":"None","volume":6803,"date_created":"2018-12-11T12:02:40Z","date_updated":"2023-02-23T12:23:48Z","_id":"3323","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2011","intvolume":" 6803","department":[{"_id":"ToHe"}],"publisher":"Springer","status":"public","publication_status":"published","title":"An efficient decision procedure for imperative tree data structures","month":"07","day":"19","scopus_import":1,"doi":"10.1007/978-3-642-22438-6_36","date_published":"2011-07-19T00:00:00Z","conference":{"name":"CADE 23: Automated Deduction ","start_date":"2011-07-31","location":"Wrocław, Poland","end_date":"2011-08-05"},"language":[{"iso":"eng"}],"citation":{"ieee":"T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.","apa":"Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36","ista":"Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.","ama":"Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.","short":"T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.","mla":"Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36."},"page":"476 - 491","quality_controlled":"1"},{"month":"04","oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2011-07-20","start_date":"2011-07-14","location":"Snowbird, USA"},"doi":"10.1007/978-3-642-22110-1_20","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:10Z","ec_funded":1,"publist_id":"3247","year":"2011","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","editor":[{"full_name":"Gopalakrishnan, Ganesh","last_name":"Gopalakrishnan","first_name":"Ganesh"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5388"}]},"date_updated":"2023-02-23T12:24:01Z","date_created":"2018-12-11T12:02:55Z","volume":6806,"day":"21","has_accepted_license":"1","article_processing_charge":"No","citation":{"apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:10.1007/978-3-642-22110-1_20","chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","mla":"Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20."},"page":"243 - 259","date_published":"2011-04-21T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized "specification free", in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. ","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3366","ddc":["000","004"],"title":"Quantitative synthesis for concurrent programs","status":"public","intvolume":" 6806","pubrep_id":"76","file":[{"file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","access_level":"open_access","file_size":508946,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5174","date_created":"2018-12-12T10:15:51Z","date_updated":"2020-07-14T12:46:10Z","checksum":"c033689355f45742dc7c99b5af13ce7a"}],"oa_version":"Submitted Version"},{"oa_version":"Submitted Version","title":"ABC: Algebraic Bound Computation for loops","status":"public","intvolume":" 6355","_id":"10908","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts."}],"type":"conference","date_published":"2010-05-01T00:00:00Z","page":"103-118","publication":"Logic for Programming, Artificial Intelligence, and Reasoning","citation":{"ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., & Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-17511-4_7","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7","chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. https://doi.org/10.1007/978-3-642-17511-4_7.","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118."},"day":"01","article_processing_charge":"No","series_title":"LNCS","scopus_import":"1","date_updated":"2022-06-13T07:44:21Z","date_created":"2022-03-21T08:14:35Z","volume":6355,"author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"}],"publication_status":"published","editor":[{"last_name":"Clarke","first_name":"Edmund M","full_name":"Clarke, Edmund M"},{"full_name":"Voronkov, Andrei","first_name":"Andrei","last_name":"Voronkov"}],"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","year":"2010","place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"conference":{"name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning","location":"Dakar, Senegal","start_date":"2010-04-25","end_date":"2010-05-01"},"doi":"10.1007/978-3-642-17511-4_7","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"oa":1,"month":"05","publication_identifier":{"isbn":["9783642175107"],"eissn":["1611-3349"],"eisbn":["9783642175114"],"issn":["0302-9743"]}},{"month":"10","language":[{"iso":"eng"}],"conference":{"name":"MECBIC: Membrane Computing and Biologically Inspired Process Calculi","start_date":"2010-08-23","location":"Jena, Germany","end_date":"2010-08-23"},"quality_controlled":"1","external_id":{"arxiv":["1011.0496"]},"oa":1,"file_date_updated":"2020-07-14T12:46:14Z","publist_id":"2511","date_created":"2018-12-11T12:04:47Z","date_updated":"2023-02-23T11:15:19Z","volume":40,"author":[{"last_name":"Feret","first_name":"Jérôme","full_name":"Feret, Jérôme"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"},{"full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana"}],"related_material":{"record":[{"id":"3168","status":"public","relation":"later_version"}]},"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"publisher":"Open Publishing Association","acknowledgement":"Jérôme Feret’s contribution was partially supported by the ABSTRACTCELL ANR-Chair of Excellence. Heinz Koeppl acknowledges the support from the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov acknowledges the support from SystemsX.ch, the Swiss Initiative in Systems Biology.","year":"2010","day":"30","has_accepted_license":"1","scopus_import":1,"date_published":"2010-10-30T00:00:00Z","page":"142-161","citation":{"chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule-Based Systems,” 40:142–61. Open Publishing Association, 2010.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.","mla":"Feret, Jérôme, et al. Lumpability Abstractions of Rule-Based Systems. Vol. 40, Open Publishing Association, 2010, pp. 142–61.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2010. Lumpability abstractions of rule-based systems. MECBIC: Membrane Computing and Biologically Inspired Process Calculi, EPTCS, vol. 40, 142–161.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule-based systems. In: Vol 40. Open Publishing Association; 2010:142-161."},"abstract":[{"lang":"eng","text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a math- ematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the com- binatorial complexity by quotienting the reachable set of molecular species, into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper we prove that this quotienting yields a sufficient condition for weak lumpability and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system. We illustrate the framework on a case study of the EGF/insulin receptor crosstalk."}],"alternative_title":["EPTCS"],"type":"conference","oa_version":"Submitted Version","file":[{"file_name":"Lumpability_abstractions_of_rule-based_systems.pdf","access_level":"open_access","file_size":907155,"content_type":"application/pdf","creator":"kschuh","relation":"main_file","file_id":"5904","date_updated":"2020-07-14T12:46:14Z","date_created":"2019-01-31T12:09:09Z","checksum":"eaaba991a86fff37606b0eb5196878e8"}],"ddc":["570"],"status":"public","title":"Lumpability abstractions of rule-based systems","intvolume":" 40","_id":"3719","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, a tool for stochastic analysis of biochemical reaction networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient solutions of biochemical reaction networks. Biochemical reactions networks represent biological systems studied at a molecular level and these reactions can be modeled as transitions of a Markov chain. SABRE accepts as input the formalism of guarded commands, which it interprets either as continuous-time or as discrete-time Markov chains. Besides operating in a stochastic mode, SABRE may also perform a deterministic analysis by directly computing a mean-field approximation of the system under study. We illustrate the different functionalities of SABRE by means of biological case studies."}],"type":"conference","pubrep_id":"63","oa_version":"Submitted Version","file":[{"creator":"system","content_type":"application/pdf","file_size":433824,"file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:09:03Z","checksum":"38707b149d2174f01be406e794ffa849","file_id":"4726","relation":"main_file"}],"_id":"3847","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"status":"public","title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks","has_accepted_license":"1","day":"14","scopus_import":1,"date_published":"2010-10-14T00:00:00Z","citation":{"ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. https://doi.org/10.1109/QEST.2010.33","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: IEEE; 2010:193-194. doi:10.1109/QEST.2010.33","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,” 193–94. IEEE, 2010. https://doi.org/10.1109/QEST.2010.33.","mla":"Didier, Frédéric, et al. SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks. IEEE, 2010, pp. 193–94, doi:10.1109/QEST.2010.33.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194."},"page":"193 - 194","publist_id":"2339","file_date_updated":"2020-07-14T12:46:17Z","author":[{"first_name":"Frédéric","last_name":"Didier","full_name":"Didier, Frédéric"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Mateescu, Maria","first_name":"Maria","last_name":"Mateescu"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"date_updated":"2021-01-12T07:52:37Z","date_created":"2018-12-11T12:05:29Z","year":"2010","publisher":"IEEE","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"publication_status":"published","month":"10","doi":"10.1109/QEST.2010.33","conference":{"name":"QEST: Quantitative Evaluation of Systems","end_date":"2010-09-18","start_date":"2010-09-15","location":"Williamsburg, USA"},"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1"},{"conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2010-10-10","location":"Yogyakarta, Indonesia","end_date":"2010-10-15"},"doi":"10.1007/978-3-642-16242-8_25","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","month":"10","author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hottelier, Thibaud","first_name":"Thibaud","last_name":"Hottelier"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"date_updated":"2021-01-12T07:52:37Z","date_created":"2018-12-11T12:05:29Z","volume":6397,"year":"2010","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:17Z","publist_id":"2342","date_published":"2010-10-01T00:00:00Z","citation":{"chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,” 6397:348–56. Springer, 2010. https://doi.org/10.1007/978-3-642-16242-8_25.","mla":"Henzinger, Thomas A., et al. Aligators for Arrays. Vol. 6397, Springer, 2010, pp. 348–56, doi:10.1007/978-3-642-16242-8_25.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.","ista":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., & Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_25","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356.","ama":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:10.1007/978-3-642-16242-8_25"},"page":"348 - 356","day":"01","has_accepted_license":"1","scopus_import":1,"pubrep_id":"64","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:10:05Z","checksum":"913af269da6710f2174f470b48ab7a82","relation":"main_file","file_id":"4790","content_type":"application/pdf","file_size":186143,"creator":"system","file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","access_level":"open_access"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3845","ddc":["005"],"title":"Aligators for arrays","status":"public","intvolume":" 6397","abstract":[{"text":"This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out inductive reasoning over array content. The Aligators’ loop extraction module allows treatment of multi-path loops by exploiting their commutativity and serializability properties. Our experience in applying Aligators on a collection of loops from open source software projects indicates the applicability of recurrence and algebraic solving techniques for reasoning about arrays.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"month":"11","language":[{"iso":"eng"}],"doi":"10.1049/iet-syb.2010.0005","quality_controlled":"1","oa":1,"file_date_updated":"2020-07-14T12:46:16Z","publist_id":"2349","date_updated":"2023-02-23T11:45:08Z","date_created":"2018-12-11T12:05:28Z","volume":4,"author":[{"full_name":"Didier, Frédéric","last_name":"Didier","first_name":"Frédéric"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"}],"related_material":{"record":[{"id":"3843","status":"public","relation":"earlier_version"}]},"publication_status":"published","publisher":"Institution of Engineering and Technology","department":[{"_id":"ToHe"}],"year":"2010","day":"15","has_accepted_license":"1","scopus_import":1,"date_published":"2010-11-15T00:00:00Z","page":"441 - 452","publication":"IET Systems Biology","citation":{"chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.” IET Systems Biology. Institution of Engineering and Technology, 2010. https://doi.org/10.1049/iet-syb.2010.0005.","mla":"Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” IET Systems Biology, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:10.1049/iet-syb.2010.0005.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” IET Systems Biology, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. IET Systems Biology. Institution of Engineering and Technology. https://doi.org/10.1049/iet-syb.2010.0005","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 2010;4(6):441-452. doi:10.1049/iet-syb.2010.0005"},"abstract":[{"lang":"eng","text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). The uniformization technique is an efficient method to compute probability distributions of a CTMC if the number of states is manageable. However, the size of a CTMC that represents a biochemical reaction network is usually far beyond what is feasible. In this paper we present an on-the-fly variant of uniformization, where we improve the original algorithm at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks."}],"issue":"6","type":"journal_article","file":[{"file_id":"5254","relation":"main_file","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:17:02Z","access_level":"open_access","file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf","creator":"system","file_size":222890,"content_type":"application/pdf"}],"oa_version":"Submitted Version","pubrep_id":"66","title":"Fast adaptive uniformization of the chemical master equation","ddc":["570"],"status":"public","intvolume":" 4","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3842"},{"citation":{"ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:10.1007/978-3-642-15155-2_23","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23","mla":"Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_23."},"page":"246 - 257","date_published":"2010-09-06T00:00:00Z","scopus_import":1,"day":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3856","intvolume":" 6281","title":"Randomness for free","status":"public","pubrep_id":"60","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}],"oa":1,"project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-642-15155-2_23","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","location":"Brno, Czech Republic","start_date":"2010-08-23"},"language":[{"iso":"eng"}],"month":"09","year":"2010","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","related_material":{"record":[{"relation":"later_version","status":"public","id":"1731"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"volume":6281,"date_updated":"2023-02-23T10:12:00Z","date_created":"2018-12-11T12:05:32Z","publist_id":"2325","ec_funded":1},{"day":"20","month":"09","language":[{"iso":"eng"}],"conference":{"location":"Klosterneuburg, Austria","start_date":"2010-09-08","end_date":"2010-09-10","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"doi":"10.1007/978-3-642-15297-9","date_published":"2010-09-20T00:00:00Z","quality_controlled":"1","citation":{"chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9.","short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9.","apa":"Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9","ieee":"K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of timed systems, vol. 6246. Springer, 2010.","ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.","ama":"Chatterjee K, Henzinger TA, eds. Formal Modeling and Analysis of Timed Systems. Vol 6246. Springer; 2010. doi:10.1007/978-3-642-15297-9"},"abstract":[{"text":"This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications.","lang":"eng"}],"publist_id":"2322","alternative_title":["LNCS"],"type":"conference_editor","date_updated":"2019-11-14T08:42:42Z","date_created":"2018-12-11T12:05:33Z","oa_version":"None","volume":6246,"related_material":{"link":[{"relation":"other","description":"eBook available via IST BookList","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721"}]},"publication_status":"published","title":"Formal modeling and analysis of timed systems","status":"public","intvolume":" 6246","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"editor":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3859","year":"2010"},{"page":"410 - 424","citation":{"ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:10.1007/978-3-642-14295-6_36","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.","mla":"Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_36."},"date_published":"2010-07-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","intvolume":" 6174","title":"Robustness in the presence of liveness","ddc":["004"],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3866","file":[{"checksum":"9d204611c8d7855bed8134f8708a0010","date_updated":"2020-07-14T12:46:19Z","date_created":"2018-12-12T10:16:52Z","relation":"main_file","file_id":"5243","file_size":213083,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf"}],"oa_version":"Submitted Version","pubrep_id":"54","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.","lang":"eng"}],"project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-14295-6_36","conference":{"name":"CAV: Computer Aided Verification","start_date":"2010-07-15","location":"Edinburgh, UK","end_date":"2010-07-19"},"month":"07","editor":[{"first_name":"Tayssir","last_name":"Touili","full_name":"Touili, Tayssir"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","first_name":"Paul","last_name":"Jackson"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","year":"2010","volume":6174,"date_updated":"2021-01-12T07:52:47Z","date_created":"2018-12-11T12:05:36Z","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Greimel, Karin","last_name":"Greimel","first_name":"Karin"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"}],"publist_id":"2310","ec_funded":1,"file_date_updated":"2020-07-14T12:46:19Z"},{"date_published":"2010-09-08T00:00:00Z","citation":{"ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.","apa":"Nickovic, D., & Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger & K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9_13","ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:10.1007/978-3-642-15297-9_13","chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9_13.","mla":"Nickovic, Dejan, and Nir Piterman. From MTL to Deterministic Timed Automata. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:10.1007/978-3-642-15297-9_13.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167."},"page":"152 - 167","day":"08","has_accepted_license":"1","scopus_import":1,"pubrep_id":"49","file":[{"creator":"system","content_type":"application/pdf","file_size":249789,"access_level":"open_access","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","date_updated":"2020-07-14T12:46:27Z","date_created":"2018-12-12T10:13:43Z","file_id":"5028","relation":"main_file"}],"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"4369","title":"From MTL to deterministic timed automata","status":"public","ddc":["004"],"intvolume":" 6246","abstract":[{"lang":"eng","text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting."}],"type":"conference","alternative_title":["LNCS"],"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2010-09-10","start_date":"2010-09-08","location":"Klosterneuburg, Austria"},"doi":"10.1007/978-3-642-15297-9_13","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"}],"month":"09","author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"date_updated":"2021-01-12T07:56:27Z","date_created":"2018-12-11T12:08:30Z","volume":6246,"year":"2010","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"editor":[{"full_name":"Henzinger, Thomas A.","first_name":"Thomas A.","last_name":"Henzinger"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"file_date_updated":"2020-07-14T12:46:27Z","ec_funded":1,"publist_id":"1090"},{"file_date_updated":"2020-07-14T12:46:16Z","publist_id":"2374","date_updated":"2021-01-12T07:52:32Z","date_created":"2018-12-11T12:05:25Z","volume":4,"author":[{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"},{"full_name":"Goel, Rushil","first_name":"Rushil","last_name":"Goel"},{"full_name":"Mateescu, Maria","first_name":"Maria","last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"BioMed Central","acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","year":"2010","month":"04","language":[{"iso":"eng"}],"doi":"10.1186/1752-0509-4-42","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"abstract":[{"lang":"eng","text":"Background\r\n\r\nThe chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a "window" into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species.\r\nResults\r\n\r\nIn order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy.\r\n\r\n\r\nConclusions\r\n\r\nThe sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori."}],"issue":"42","type":"journal_article","file":[{"access_level":"open_access","file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","file_size":1919130,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5217","checksum":"220239fae76f7b03c4d7f05d74ef426f","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:16:29Z"}],"oa_version":"Published Version","pubrep_id":"72","title":"Solving the chemical master equation using sliding windows","status":"public","ddc":["005"],"intvolume":" 4","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3834","day":"08","has_accepted_license":"1","scopus_import":1,"date_published":"2010-04-08T00:00:00Z","page":"1 - 19","publication":"BMC Systems Biology","citation":{"short":"V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.","mla":"Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” BMC Systems Biology, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:10.1186/1752-0509-4-42.","chicago":"Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.” BMC Systems Biology. BioMed Central, 2010. https://doi.org/10.1186/1752-0509-4-42.","ama":"Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. BMC Systems Biology. 2010;4(42):1-19. doi:10.1186/1752-0509-4-42","apa":"Wolf, V., Goel, R., Mateescu, M., & Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. BMC Systems Biology. BioMed Central. https://doi.org/10.1186/1752-0509-4-42","ieee":"V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” BMC Systems Biology, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.","ista":"Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19."}},{"scopus_import":1,"day":"17","month":"01","citation":{"apa":"Henzinger, T. A. (2010). From boolean to quantitative notions of correctness (Vol. 45, pp. 157–158). Presented at the POPL: Principles of Programming Languages, Madrid, Spain: ACM. https://doi.org/10.1145/1706299.1706319","ieee":"T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158.","ista":"Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.","ama":"Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:10.1145/1706299.1706319","chicago":"Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,” 45:157–58. ACM, 2010. https://doi.org/10.1145/1706299.1706319.","short":"T.A. Henzinger, in:, ACM, 2010, pp. 157–158.","mla":"Henzinger, Thomas A. From Boolean to Quantitative Notions of Correctness. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:10.1145/1706299.1706319."},"page":"157 - 158","quality_controlled":"1","date_published":"2010-01-17T00:00:00Z","doi":"10.1145/1706299.1706319","conference":{"end_date":"2010-01-23","start_date":"2010-01-17","location":"Madrid, Spain","name":"POPL: Principles of Programming Languages"},"language":[{"iso":"eng"}],"type":"conference","publist_id":"2354","issue":"1","abstract":[{"text":"Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. Correspondingly, classical methods for system analysis determine the truth value of a property, preferably giving a proof if the property is true, and a counterexample if the property is false; classical methods for system synthesis construct a system for which a property is true; classical methods for system transformation, composition, and abstraction aim to preserve the truth of properties. The boolean view is prevalent even if the system, the property, or both refer to numerical quantities, such as the times or probabilities of events. For example, a timed automaton either satisfies or violates a formula of a real-time logic; a stochastic process either satisfies or violates a formula of a probabilistic logic. The classical black-and-white view partitions the world into \"correct\" and \"incorrect\" systems, offering few nuances. In reality, of several systems that satisfy a property in the boolean sense, often some are more desirable than others, and of the many systems that violate a property, usually some are less objectionable than others. For instance, among the systems that satisfy the response property that every request be granted, we may prefer systems that grant requests quickly (the quicker, the better), or we may prefer systems that issue few unnecessary grants (the fewer, the better); and among the systems that violate the response property, we may prefer systems that serve many initial requests (the more, the better), or we may prefer systems that serve many requests in the long run (the greater the fraction of served to unserved requests, the better). Formally, while a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a directed metric on systems and properties, where the distance between a system and a property provides a measure of \"fit\" or \"desirability.\" There are many ways how such distances can be defined. In a linear-time framework, one assigns numerical values to individual behaviors before assigning values to systems and properties, which are sets of behaviors. For example, the value of a single behavior may be a discounted value, which is largely determined by a prefix of the behavior, e.g., by the number of requests that are granted before the first request that is not granted; or a limit value, which is independent of any finite prefix. A limit value may be an average, such as the average response time over an infinite sequence of requests and grants, or a supremum, such as the worst-case response time. Similarly, the value of a set of behaviors may be an extremum or an average across the values of all behaviors in the set: in this way one can measure the worst of all possible average-case response times, or the average of all possible worst-case response times, etc. Accordingly, the distance between two sets of behaviors may be defined as the worst or average difference between the values of corresponding behaviors. In summary, we propagate replacing boolean specifications for the correctness of systems with quantitative measures for the desirability of systems. In quantitative analysis, the aim is to compute the distance between a system and a property (or between two systems, or two properties); in quantitative synthesis, the objective is to construct a system that has minimal distance from a given property. Multiple quantitative measures can be prioritized (e.g., combined lexicographically into a single measure) or studied along the Pareto curve. Quantitative transformations, compositions, and abstractions of systems are useful if they allow us to bound the induced change in distance from a property. We present some initial results in some of these directions. We also give some potential applications, which not only generalize tradiditional correctness concerns in the functional, timed, and probabilistic domains, but also capture such system measures as resource use, performance, cost, reliability, and robustness.","lang":"eng"}],"_id":"3840","acknowledgement":"This talk surveys joint work with Roderick Bloem, Krishnendu Chatterjee, Laurent Doyen, and Barbara Jobstmann.","year":"2010","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 45","department":[{"_id":"ToHe"}],"publisher":"ACM","status":"public","title":"From boolean to quantitative notions of correctness","publication_status":"published","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"volume":45,"oa_version":"None","date_created":"2018-12-11T12:05:27Z","date_updated":"2021-01-12T07:52:34Z"},{"month":"01","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-11319-2_14","conference":{"start_date":"2010-01-17","location":"Madrid, Spain","end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"quality_controlled":"1","oa":1,"publist_id":"2357","file_date_updated":"2020-07-14T12:46:16Z","volume":5944,"date_updated":"2021-01-12T07:52:33Z","date_created":"2018-12-11T12:05:27Z","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Hottelier","first_name":"Thibaud","full_name":"Hottelier, Thibaud"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"first_name":"Andrei","last_name":"Voronkov","full_name":"Voronkov, Andrei"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","acknowledgement":"The research was supported by the Swiss NSF.","year":"2010","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2010-01-01T00:00:00Z","page":"163 - 179","citation":{"chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,” 5944:163–79. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_14.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.","mla":"Henzinger, Thomas A., et al. Invariant and Type Inference for Matrices. Vol. 5944, Springer, 2010, pp. 163–79, doi:10.1007/978-3-642-11319-2_14.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., & Voronkov, A. (2010). Invariant and type inference for matrices (Vol. 5944, pp. 163–179). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-642-11319-2_14","ista":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.","ama":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. Invariant and type inference for matrices. In: Vol 5944. Springer; 2010:163-179. doi:10.1007/978-3-642-11319-2_14"},"abstract":[{"text":"We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types), such as upper-triangular, diagonal, etc. To gen- erate loop properties, we first transform a nested loop iterating over a multi- dimensional array into an equivalent collection of unnested loops. Then, we in- fer quantified loop invariants for each unnested loop using a generalization of a recurrence-based invariant generation technique. These loop invariants give us conditions on matrices from which we can derive matrix types automatically us- ing theorem provers. Invariant generation is implemented in the software package Aligator and types are derived by theorem provers and SMT solvers, including Vampire and Z3. When run on the Java matrix package JAMA, our tool was able to infer automatically all matrix types describing the matrix shapes guaranteed by JAMA’s API.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","file":[{"date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:13:09Z","checksum":"da69b13a2d9a7a316c909e09c1090cef","file_id":"4989","relation":"main_file","creator":"system","file_size":251265,"content_type":"application/pdf","file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"69","intvolume":" 5944","status":"public","title":"Invariant and type inference for matrices","ddc":["005"],"_id":"3839","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"year":"2010","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"full_name":"Mikeev, Linar","last_name":"Mikeev","first_name":"Linar"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"date_created":"2018-12-11T12:05:27Z","date_updated":"2021-01-12T07:52:33Z","publist_id":"2356","file_date_updated":"2020-07-14T12:46:16Z","oa":1,"quality_controlled":"1","doi":"10.1145/1839764.1839772","conference":{"name":"CMSB: Computational Methods in Systems Biology","end_date":"2010-10-01","location":"Trento, Italy","start_date":"2010-09-29"},"language":[{"iso":"eng"}],"month":"09","_id":"3838","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"title":"Hybrid numerical solution of the chemical master equation","status":"public","pubrep_id":"68","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"5179","date_created":"2018-12-12T10:15:55Z","date_updated":"2020-07-14T12:46:16Z","checksum":"81cb6f0babd97151b171d1ce86582831","file_name":"IST-2012-68-v1+1_Hybrid_Numerical_Solution_of_the_Chemical_Master_Equation.pdf","access_level":"open_access","file_size":671790,"content_type":"application/pdf","creator":"system"}],"type":"conference","abstract":[{"lang":"eng","text":"We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe net- works of biochemical reactions and play an important role in the stochastic modeling of biological systems. Our approach is based on the construction of a stochastic hybrid model in which certain discrete random variables of the original Markov chain are approximated by continuous deterministic variables. We compute the solution of the stochastic hybrid model using a numerical algorithm that discretizes time and in each step performs a mutual update of the transient prob- ability distribution of the discrete stochastic variables and the values of the continuous deterministic variables. We im- plemented the algorithm and we demonstrate its usefulness and efficiency on several case studies from systems biology."}],"citation":{"chicago":"Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,” 55–65. Springer, 2010. https://doi.org/10.1145/1839764.1839772.","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.","mla":"Henzinger, Thomas A., et al. Hybrid Numerical Solution of the Chemical Master Equation. Springer, 2010, pp. 55–65, doi:10.1145/1839764.1839772.","apa":"Henzinger, T. A., Mateescu, M., Mikeev, L., & Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. https://doi.org/10.1145/1839764.1839772","ieee":"T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.","ista":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65.","ama":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:10.1145/1839764.1839772"},"page":"55 - 65","date_published":"2010-09-29T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"29"},{"file_date_updated":"2020-07-14T12:46:17Z","ec_funded":1,"publist_id":"2328","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2010","date_created":"2018-12-11T12:05:31Z","date_updated":"2021-01-12T07:52:40Z","volume":6269,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Philippe","last_name":"Rannou","full_name":"Rannou, Philippe"}],"month":"11","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France","end_date":"2010-09-03"},"doi":"10.1007/978-3-642-15375-4_19","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions.","lang":"eng"}],"title":"Mean-payoff automaton expressions","ddc":["000","005"],"status":"public","intvolume":" 6269","_id":"3853","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","creator":"system","file_size":233260,"content_type":"application/pdf","file_id":"5163","relation":"main_file","checksum":"4f753ae99d076553fb8733e2c8b390e2","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:15:41Z"}],"pubrep_id":"62","scopus_import":1,"day":"18","has_accepted_license":"1","page":"269 - 283","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_19.","mla":"Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:10.1007/978-3-642-15375-4_19"},"date_published":"2010-11-18T00:00:00Z"},{"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.FSTTCS.2010.505","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2010-12-18","location":"Chennai, India","start_date":"2010-12-15"},"month":"12","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2010","volume":8,"date_updated":"2021-01-12T07:52:44Z","date_created":"2018-12-11T12:05:34Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"publist_id":"2321","file_date_updated":"2020-07-14T12:46:18Z","page":"505 - 516","citation":{"mla":"Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505.","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:10.4230/LIPIcs.FSTTCS.2010.505","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505"},"date_published":"2010-12-13T00:00:00Z","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"13","intvolume":" 8","status":"public","title":"Generalized mean-payoff and energy games","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3860","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:46:18Z","date_created":"2018-12-12T10:15:27Z","checksum":"1caabd6319b979927208117a41192637","file_id":"5147","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":178278,"file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","access_level":"open_access"},{"relation":"main_file","file_id":"5148","checksum":"3a59759ceeacdb5b578f3803d5e6769b","date_created":"2018-12-12T10:15:28Z","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_name":"IST-2016-59-v2+1_2_1_.pdf","file_size":477976,"content_type":"application/pdf","creator":"system"}],"pubrep_id":"59","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.","lang":"eng"}]},{"date_published":"2010-07-09T00:00:00Z","page":"380 - 395","citation":{"ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:10.1007/978-3-642-14295-6_34","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-642-14295-6_34","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.","mla":"Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_34."},"day":"09","scopus_import":1,"oa_version":"Preprint","intvolume":" 6174","title":"Measuring and synthesizing systems in probabilistic environments","status":"public","_id":"3864","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-14295-6_34","conference":{"name":"CAV: Computer Aided Verification","start_date":"201-07-15","location":"Edinburgh, United Kingdom","end_date":"2010-07-19"},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1004.0739"}],"oa":1,"month":"07","volume":6174,"date_updated":"2023-02-23T10:17:28Z","date_created":"2018-12-11T12:05:35Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1856"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","year":"2010","publist_id":"2313"},{"intvolume":" 208","title":"Strategy construction for parity games with imperfect information","ddc":["005"],"status":"public","_id":"3863","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","creator":"system","file_size":287496,"content_type":"application/pdf","file_id":"5300","relation":"main_file","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","date_created":"2018-12-12T10:17:44Z","date_updated":"2020-07-14T12:46:18Z"}],"oa_version":"Submitted Version","pubrep_id":"58","type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs."}],"page":"1206 - 1220","citation":{"ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. Information and Computation. 2010;208(10):1206-1220. doi:10.1016/j.ic.2009.09.006","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” Information and Computation, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.","apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.09.006","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” Information and Computation, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.09.006."},"publication":"Information and Computation","date_published":"2010-10-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Elsevier","publication_status":"published","year":"2010","volume":208,"date_created":"2018-12-11T12:05:35Z","date_updated":"2023-02-23T11:46:47Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3880"}]},"author":[{"full_name":"Berwanger, Dietmar","last_name":"Berwanger","first_name":"Dietmar"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"De Wulf, Martin","last_name":"De Wulf","first_name":"Martin"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"ec_funded":1,"publist_id":"2319","file_date_updated":"2020-07-14T12:46:18Z","project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2009.09.006","month":"10"},{"month":"06","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2009.07.004","publist_id":"2317","file_date_updated":"2020-07-14T12:46:18Z","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","year":"2010","volume":208,"date_created":"2018-12-11T12:05:34Z","date_updated":"2023-02-23T11:46:57Z","related_material":{"record":[{"id":"3884","relation":"earlier_version","status":"public"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"scopus_import":1,"has_accepted_license":"1","day":"01","page":"677 - 693","citation":{"ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information and Computation, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.","apa":"Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. Information and Computation. 2010;208(6):677-693. doi:10.1016/j.ic.2009.07.004","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.07.004.","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” Information and Computation, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693."},"publication":"Information and Computation","date_published":"2010-06-01T00:00:00Z","type":"journal_article","issue":"6","abstract":[{"text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).","lang":"eng"}],"intvolume":" 208","status":"public","title":"Strategy logic","ddc":["000","004"],"_id":"3861","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"13bff93f3c2a014e2908145a4517f177","date_created":"2018-12-12T10:11:54Z","date_updated":"2020-07-14T12:46:18Z","file_id":"4911","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":189120,"access_level":"open_access","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf"}],"oa_version":"Submitted Version","pubrep_id":"56"},{"author":[{"full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"}],"volume":6418,"oa_version":"None","date_updated":"2021-01-12T07:56:25Z","date_created":"2018-12-11T12:08:28Z","year":"2010","_id":"4362","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 6418","editor":[{"first_name":"Oleg","last_name":"Sokolsky","full_name":"Sokolsky, Oleg"},{"full_name":"Rosu, Grigore","first_name":"Grigore","last_name":"Rosu"},{"full_name":"Tilmann, Nikolai","last_name":"Tilmann","first_name":"Nikolai"},{"full_name":"Barringer, Howard","first_name":"Howard","last_name":"Barringer"},{"last_name":"Falcone","first_name":"Ylies","full_name":"Falcone, Ylies"},{"full_name":"Finkbeiner, Bernd","first_name":"Bernd","last_name":"Finkbeiner"},{"full_name":"Havelund, Klaus","last_name":"Havelund","first_name":"Klaus"},{"full_name":"Lee, Insup","last_name":"Lee","first_name":"Insup"},{"full_name":"Pace, Gordon","first_name":"Gordon","last_name":"Pace"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"status":"public","publication_status":"published","title":"Runtime verification for software transactional memories","publist_id":"1096","abstract":[{"text":"Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict graph algorithm for verifying correctness of STMs, we develop TRACER, a tool for runtime verification of STM implementations. The novelty of TRACER lies in the way it combines coarse and precise runtime analyses to guarantee sound and complete verification in an efficient manner. We implement TRACER in the TL2 STM implementation. We evaluate the performance of TRACER on STAMP benchmarks. While a precise runtime verification technique based on conflict graphs results in an average slowdown of 60x, the two-level approach of TRACER performs complete verification with an average slowdown of around 25x across different benchmarks.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"date_published":"2010-01-01T00:00:00Z","doi":"10.1007/978-3-642-16612-9_32","conference":{"location":"St. Julians, Malta","start_date":"2010-11-01","end_date":"2010-11-04","name":"RV: International Conference on Runtime Verification"},"language":[{"iso":"eng"}],"citation":{"chicago":"Singh, Vasu. “Runtime Verification for Software Transactional Memories.” edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010. https://doi.org/10.1007/978-3-642-16612-9_32.","short":"V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.","mla":"Singh, Vasu. Runtime Verification for Software Transactional Memories. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:10.1007/978-3-642-16612-9_32.","apa":"Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. https://doi.org/10.1007/978-3-642-16612-9_32","ieee":"V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435.","ama":"Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:10.1007/978-3-642-16612-9_32"},"page":"421 - 435","quality_controlled":"1","month":"01","day":"01","scopus_import":1},{"publist_id":"1081","date_updated":"2021-01-12T07:56:31Z","date_created":"2018-12-11T12:08:33Z","volume":5944,"author":[{"full_name":"Kuncak, Viktor","last_name":"Kuncak","first_name":"Viktor"},{"full_name":"Piskac, Ruzica","last_name":"Piskac","first_name":"Ruzica"},{"full_name":"Suter, Philippe","last_name":"Suter","first_name":"Philippe"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"}],"publication_status":"published","editor":[{"full_name":"Barthe, Gilles","first_name":"Gilles","last_name":"Barthe"},{"full_name":"Hermenegildo, Manuel","last_name":"Hermenegildo","first_name":"Manuel"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"year":"2010","month":"01","language":[{"iso":"eng"}],"conference":{"location":"Madrid, Spain","start_date":"2010-01-17","end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"doi":"10.1007/978-3-642-11319-2_6","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"abstract":[{"text":"Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures. To automate the proofs of such formulas we propose a logic (a “calculus”) of such data structures. We build the calculus by starting from decidable logics of individual data structures, and connecting them through functions and sets, in ways that go beyond the frameworks such as Nelson-Oppen. The result are new decidable logics that can simultaneously specify properties of different kinds of data structures and overcome the limitations of the individual logics. Several of our decidable logics include abstraction functions that map a data structure into its more abstract view (a tree into a multiset, a multiset into a set), into a numerical quantity (the size or the height), or into the truth value of a candidate data structure invariant (sortedness, or the heap property). For algebraic data types, we identify an asymptotic many-to-one condition on the abstraction function that guarantees the existence of a decision procedure. In addition to the combination based on abstraction functions, we can combine multiple data structure theories if they all reduce to the same data structure logic. As an instance of this approach, we describe a decidable logic whose formulas are propositional combinations of formulas in: weak monadic second-order logic of two successors, two-variable logic with counting, multiset algebra with Presburger arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the logic of algebraic data types with the set content function. The subformulas in this combination can share common variables that refer to sets of objects along with the common set algebra operations. Such sound and complete combination is possible because the relations on sets definable in the component logics are all expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic and its new extensions play an important role in our decidability results. In several cases, when we combine logics that belong to NP, we can prove the satisfiability for the combined logic is still in NP.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","status":"public","title":"Building a calculus of data structures","intvolume":" 5944","_id":"4378","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2010-01-01T00:00:00Z","page":"26 - 44","citation":{"mla":"Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.","chicago":"Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_6.","ama":"Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:10.1007/978-3-642-11319-2_6","ista":"Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 26–44.","ieee":"V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.","apa":"Kuncak, V., Piskac, R., Suter, P., & Wies, T. (2010). Building a calculus of data structures. In G. Barthe & M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-642-11319-2_6"}},{"day":"26","has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"date_published":"2010-08-26T00:00:00Z","citation":{"ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning of resources in a cloud environment. In: IEEE; 2010:83-90. doi:10.1109/CLOUD.2010.71","ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. FlexPRICE: Flexible provisioning of resources in a cloud environment. CLOUD: Cloud Computing, 83–90.","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., & Zufferey, D. (2010). FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90). Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE. https://doi.org/10.1109/CLOUD.2010.71","mla":"Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,” 83–90. IEEE, 2010. https://doi.org/10.1109/CLOUD.2010.71."},"page":"83 - 90","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We claim that, in order to realize the full potential of cloud computing, the user must be presented with a pricing model that offers flexibility at the requirements level, such as a choice between different degrees of execution speed and the cloud provider must be presented with a programming model that offers flexibility at the execution level, such as a choice between different scheduling policies. In such a flexible framework, with each job, the user purchases a virtual computer with the desired speed and cost characteristics, and the cloud provider can optimize the utilization of resources across a stream of jobs from different users. We designed a flexible framework to test our hypothesis, which is called FlexPRICE (Flexible Provisioning of Resources in a Cloud Environment) and works as follows. A user presents a job to the cloud. The cloud finds different schedules to execute the job and presents a set of quotes to the user in terms of price and duration for the execution. The user then chooses a particular quote and the cloud is obliged to execute the job according to the chosen quote. FlexPRICE thus hides the complexity of the actual scheduling decisions from the user, but still provides enough flexibility to meet the users actual demands. We implemented FlexPRICE in a simulator called PRICES that allows us to experiment with our framework. We observe that FlexPRICE provides a wide range of execution options-from fast and expensive to slow and cheap-- for the whole spectrum of data-intensive and computation-intensive jobs. We also observe that the set of quotes computed by FlexPRICE do not vary as the number of simultaneous jobs increases.","lang":"eng"}],"type":"conference","pubrep_id":"47","oa_version":"Submitted Version","file":[{"file_name":"IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":467436,"file_id":"5188","relation":"main_file","date_created":"2018-12-12T10:16:03Z","date_updated":"2020-07-14T12:46:28Z","checksum":"98e534675339a8e2beca08890d048145"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"4381","status":"public","ddc":["004"],"title":"FlexPRICE: Flexible provisioning of resources in a cloud environment","month":"08","conference":{"name":"CLOUD: Cloud Computing","location":"Miami, USA","start_date":"2010-07-05","end_date":"2010-07-10"},"doi":"10.1109/CLOUD.2010.71","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z","publist_id":"1077","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Anmol","last_name":"Tomar","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","full_name":"Tomar, Anmol"},{"full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"},{"first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"}],"date_created":"2018-12-11T12:08:33Z","date_updated":"2021-01-12T07:56:33Z","year":"2010","publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}]},{"quality_controlled":"1","page":"263 - 272","oa":1,"citation":{"mla":"Guerraoui, Rachid, et al. Transactions in the Jungle. ACM, 2010, pp. 263–72, doi:10.1145/1810479.1810529.","short":"R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh. “Transactions in the Jungle,” 263–72. ACM, 2010. https://doi.org/10.1145/1810479.1810529.","ama":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle. In: ACM; 2010:263-272. doi:10.1145/1810479.1810529","ista":"Guerraoui R, Henzinger TA, Kapalka M, Singh V. 2010. Transactions in the jungle. SPAA: ACM Symposium on Parallel Algorithms and Architectures, 263–272.","ieee":"R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272.","apa":"Guerraoui, R., Henzinger, T. A., Kapalka, M., & Singh, V. (2010). Transactions in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece: ACM. https://doi.org/10.1145/1810479.1810529"},"language":[{"iso":"eng"}],"conference":{"end_date":"2010-06-15","start_date":"2010-06-13","location":"Santorini, Greece","name":"SPAA: ACM Symposium on Parallel Algorithms and Architectures"},"doi":"10.1145/1810479.1810529","date_published":"2010-06-13T00:00:00Z","day":"13","month":"06","has_accepted_license":"1","status":"public","publication_status":"published","ddc":["005"],"title":"Transactions in the jungle","department":[{"_id":"ToHe"}],"publisher":"ACM","_id":"4382","year":"2010","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:34Z","date_updated":"2021-01-12T07:56:33Z","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"5080","date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:14:28Z","checksum":"f2ad6c00a6304da34bf21bcdcfd36c4b","file_name":"IST-2012-46-v1+1_Transactions_in_the_jungle.pdf","access_level":"open_access","content_type":"application/pdf","file_size":246409,"creator":"system"}],"author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kapalka, Michal","last_name":"Kapalka","first_name":"Michal"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu"}],"pubrep_id":"46","type":"conference","abstract":[{"text":"Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that accesses to shared data are solely performed through transactions. In practice, due to legacy code and concurrency libraries, transactions in a TM have to share data with non-transactional operations. The semantics of such interaction, while widely discussed by practitioners, lacks a clear formal specification. Those interactions can vary, sometimes in subtle ways, between TM implementations and underlying memory models. We propose a correctness condition for TMs, parametrized opacity, to formally capture the now folklore notion of strong atomicity by stipulating the two following intuitive requirements: first, every transaction appears as if it is executed instantaneously with respect to other transactions and non-transactional operations, and second, non-transactional operations conform to the given underlying memory model. We investigate the inherent cost of implementing parametrized opacity. We first prove that parametrized opacity requires either instrumenting non-transactional operations (for most memory models) or writing to memory by transactions using potentially expensive read-modify-write instructions (such as compare-and-swap). Then, we show that for a class of practical relaxed memory models, parametrized opacity can indeed be implemented with constant-time instrumentation of non-transactional writes and no instrumentation of non-transactional reads. We show that, in practice, parametrizing the notion of correctness allows developing more efficient TM implementations.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:28Z","publist_id":"1076"},{"oa":1,"quality_controlled":"1","doi":"10.1145/1879021.1879022","conference":{"start_date":"2010-10-24","location":"Arizona, USA","end_date":"2010-10-29","name":"EMSOFT: Embedded Software "},"language":[{"iso":"eng"}],"month":"10","year":"2010","publisher":"ACM","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Tomar, Anmol","id":"3D8D36B6-F248-11E8-B48F-1D18A9856A87","first_name":"Anmol","last_name":"Tomar"},{"full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:08:33Z","date_updated":"2021-01-12T07:56:32Z","publist_id":"1078","file_date_updated":"2020-07-14T12:46:28Z","citation":{"ista":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for cloud resources. EMSOFT: Embedded Software , 1–8.","apa":"Henzinger, T. A., Tomar, A., Singh, V., Wies, T., & Zufferey, D. (2010). A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded Software , Arizona, USA: ACM. https://doi.org/10.1145/1879021.1879022","ieee":"T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.","ama":"Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:10.1145/1879021.1879022","chicago":"Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. https://doi.org/10.1145/1879021.1879022.","mla":"Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM, 2010, pp. 1–8, doi:10.1145/1879021.1879022.","short":"T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8."},"page":"1 - 8","date_published":"2010-10-24T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"24","_id":"4380","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"title":"A marketplace for cloud resources","status":"public","pubrep_id":"48","file":[{"checksum":"7680dd24016810710f7c977bc94f85e9","date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:09:42Z","file_id":"4767","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":222626,"access_level":"open_access","file_name":"IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf"}],"oa_version":"Submitted Version","type":"conference","abstract":[{"lang":"eng","text":"Cloud computing is an emerging paradigm aimed to offer users pay-per-use computing resources, while leaving the burden of managing the computing infrastructure to the cloud provider. We present a new programming and pricing model that gives the cloud user the flexibility of trading execution speed and price on a per-job basis. We discuss the scheduling and resource management challenges for the cloud provider that arise in the implementation of this model. We argue that techniques from real-time and embedded software can be useful in this context."}]},{"day":"23","has_accepted_license":"1","scopus_import":1,"date_published":"2010-08-23T00:00:00Z","page":"77 - 84","citation":{"chicago":"Doyen, Laurent, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Robustness of Sequential Circuits,” 77–84. IEEE, 2010. https://doi.org/10.1109/ACSD.2010.26.","short":"L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.","mla":"Doyen, Laurent, et al. Robustness of Sequential Circuits. IEEE, 2010, pp. 77–84, doi:10.1109/ACSD.2010.26.","apa":"Doyen, L., Henzinger, T. A., Legay, A., & Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE. https://doi.org/10.1109/ACSD.2010.26","ieee":"L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic, “Robustness of sequential circuits,” presented at the ACSD: Application of Concurrency to System Design, 2010, pp. 77–84.","ista":"Doyen L, Henzinger TA, Legay A, Nickovic D. 2010. Robustness of sequential circuits. ACSD: Application of Concurrency to System Design, 77–84.","ama":"Doyen L, Henzinger TA, Legay A, Nickovic D. Robustness of sequential circuits. In: IEEE; 2010:77-84. doi:10.1109/ACSD.2010.26"},"abstract":[{"text":"Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not.","lang":"eng"}],"type":"conference","file":[{"file_id":"4733","relation":"main_file","checksum":"42b2952bfc6b6974617bd554842b904a","date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:09:10Z","access_level":"open_access","file_name":"IST-2012-44-v1+1_Robustness_of_sequential_circuits.pdf","creator":"system","file_size":159920,"content_type":"application/pdf"}],"oa_version":"Submitted Version","pubrep_id":"44","status":"public","ddc":["004"],"title":"Robustness of sequential circuits","_id":"4389","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"08","language":[{"iso":"eng"}],"conference":{"name":"ACSD: Application of Concurrency to System Design"},"doi":"10.1109/ACSD.2010.26","quality_controlled":"1","oa":1,"file_date_updated":"2020-07-14T12:46:28Z","publist_id":"1069","date_updated":"2021-01-12T07:56:36Z","date_created":"2018-12-11T12:08:36Z","author":[{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}],"year":"2010"},{"oa_version":"None","title":"Quantitative Simulation Games","status":"public","intvolume":" 6200","_id":"4392","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"While a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a distance function on systems and properties, where the distance between a system and a property provides a measure of “fit” or “desirability.” In this article, we explore several ways how the simulation preorder can be generalized to a distance function. This is done by equipping the classical simulation game between a system and a property with quantitative objectives. In particular, for systems that satisfy a property, a quantitative simulation game can measure the “robustness” of the satisfaction, that is, how much the system can deviate from its nominal behavior while still satisfying the property. For systems that violate a property, a quantitative simulation game can measure the “seriousness” of the violation, that is, how much the property has to be modified so that it is satisfied by the system. These distances can be computed in polynomial time, since the computation reduces to the value problem in limit average games with constant weights. Finally, we demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes. "}],"alternative_title":["LNCS"],"type":"book_chapter","date_published":"2010-07-29T00:00:00Z","page":"42 - 60","publication":"Time For Verification: Essays in Memory of Amir Pnueli","citation":{"short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:10.1007/978-3-642-13754-9_3.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. https://doi.org/10.1007/978-3-642-13754-9_3.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. Time For Verification: Essays in Memory of Amir Pnueli. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:10.1007/978-3-642-13754-9_3","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna & D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli (Vol. 6200, pp. 42–60). Springer. https://doi.org/10.1007/978-3-642-13754-9_3","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in Time For Verification: Essays in Memory of Amir Pnueli, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60."},"day":"29","series_title":"Essays in Memory of Amir Pnueli","scopus_import":1,"date_updated":"2021-01-12T07:56:38Z","date_created":"2018-12-11T12:08:37Z","volume":6200,"author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"publication_status":"published","publisher":"Springer","editor":[{"first_name":"Zohar","last_name":"Manna","full_name":"Manna, Zohar"},{"full_name":"Peled, Doron","first_name":"Doron","last_name":"Peled"}],"department":[{"_id":"ToHe"}],"year":"2010","publist_id":"1064","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-13754-9_3","quality_controlled":"1","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"month":"07"},{"pubrep_id":"41","file":[{"relation":"main_file","file_id":"5332","checksum":"7d26e59a9681487d7283eba337292b2c","date_created":"2018-12-12T10:18:13Z","date_updated":"2020-07-14T12:46:29Z","access_level":"open_access","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf","content_type":"application/pdf","file_size":312147,"creator":"system"}],"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"4396","title":"Shape refinement through explicit heap analysis","status":"public","ddc":["004"],"intvolume":" 6013","abstract":[{"text":"Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"date_published":"2010-04-21T00:00:00Z","citation":{"ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:10.1007/978-3-642-12029-9_19","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277.","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., & Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum & G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_19","ieee":"D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.","mla":"Beyer, Dirk, et al. Shape Refinement through Explicit Heap Analysis. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:10.1007/978-3-642-12029-9_19.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. https://doi.org/10.1007/978-3-642-12029-9_19."},"page":"263 - 277","day":"21","has_accepted_license":"1","scopus_import":1,"author":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Grégory","last_name":"Théoduloz","full_name":"Théoduloz, Grégory"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"}],"date_updated":"2021-01-12T07:56:40Z","date_created":"2018-12-11T12:08:38Z","volume":6013,"year":"2010","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"editor":[{"first_name":"David","last_name":"Rosenblum","full_name":"Rosenblum, David"},{"full_name":"Taenzer, Gabriele","first_name":"Gabriele","last_name":"Taenzer"}],"file_date_updated":"2020-07-14T12:46:29Z","publist_id":"1061","conference":{"name":"FASE: Fundamental Approaches To Software Engineering","location":"Paphos, Cyprus","start_date":"2010-03-20","end_date":"2010-03-28"},"doi":"10.1007/978-3-642-12029-9_19","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"04"},{"date_created":"2018-12-11T12:05:36Z","date_updated":"2023-02-23T12:15:42Z","volume":6,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"4540"}]},"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"International Federation of Computational Logic","year":"2010","file_date_updated":"2020-07-14T12:46:19Z","ec_funded":1,"publist_id":"2311","language":[{"iso":"eng"}],"doi":"10.2168/LMCS-6(3:10)2010","quality_controlled":"1","project":[{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}],"oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"month":"08","oa_version":"Published Version","file":[{"date_created":"2018-12-12T10:17:54Z","date_updated":"2020-07-14T12:46:19Z","checksum":"0243da726476817f2ea33b48b78be696","file_id":"5312","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":216598,"file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","access_level":"open_access"},{"file_id":"5313","relation":"main_file","checksum":"5e512b8503a9cb263de26331c4ee9cf2","date_created":"2018-12-12T10:17:55Z","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access","file_name":"IST-2016-55-v2+1_1007.4018.pdf","creator":"system","content_type":"application/pdf","file_size":302416}],"pubrep_id":"504","title":"Expressiveness and closure properties for quantitative languages","ddc":["000","004"],"status":"public","intvolume":" 6","_id":"3867","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations."}],"issue":"3","type":"journal_article","date_published":"2010-08-30T00:00:00Z","page":"1 - 23","publication":"Logical Methods in Computer Science","citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” Logical Methods in Computer Science, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-6(3:10)2010","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 2010;6(3):1-23. doi:10.2168/LMCS-6(3:10)2010","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” Logical Methods in Computer Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:10)2010.","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23."},"day":"30","has_accepted_license":"1","scopus_import":1},{"date_published":"2010-01-01T00:00:00Z","page":"1 - 12","citation":{"short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","mla":"Alur, Rajeev, and Pavol Cerny. Expressiveness of Streaming String Transducers. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:10.4230/LIPIcs.FSTTCS.2010.1.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1.","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:10.4230/LIPIcs.FSTTCS.2010.1","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","apa":"Alur, R., & Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12."},"day":"01","has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","file":[{"file_id":"4690","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:08:29Z","checksum":"5845be5aa19791830f7407d8853f2df0","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","access_level":"open_access","creator":"system","file_size":492344,"content_type":"application/pdf"}],"pubrep_id":"948","title":"Expressiveness of streaming string transducers","status":"public","ddc":["005"],"intvolume":" 8","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"488","abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of "regular" transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","language":[{"iso":"eng"}],"conference":{"start_date":"2010-12-15","location":"Chennai, India","end_date":"2010-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"doi":"10.4230/LIPIcs.FSTTCS.2010.1","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"month":"01","date_updated":"2021-01-12T08:01:00Z","date_created":"2018-12-11T11:46:45Z","volume":8,"author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"year":"2010","file_date_updated":"2020-07-14T12:46:35Z","publist_id":"7331"},{"scopus_import":1,"day":"01","month":"12","quality_controlled":"1","page":"171 - 199","publication":"Formal Methods in System Design","citation":{"ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., & Wies, T. (2010). Doomed program points. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-010-0102-0","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. Formal Methods in System Design. 2010;37(2-3):171-199. doi:10.1007/s10703-010-0102-0","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-010-0102-0.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0."},"language":[{"iso":"eng"}],"doi":"10.1007/s10703-010-0102-0","date_published":"2010-12-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives ("noise") or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool."}],"issue":"2-3","publist_id":"7284","title":"Doomed program points","publication_status":"published","status":"public","publisher":"Springer","intvolume":" 37","department":[{"_id":"ToHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"533","year":"2010","date_updated":"2021-01-12T08:01:28Z","date_created":"2018-12-11T11:47:01Z","oa_version":"None","volume":37,"author":[{"full_name":"Hoenicke, Jochen","last_name":"Hoenicke","first_name":"Jochen"},{"full_name":"Leino, Kari","last_name":"Leino","first_name":"Kari"},{"full_name":"Podelski, Andreas","last_name":"Podelski","first_name":"Andreas"},{"full_name":"Schäf, Martin","last_name":"Schäf","first_name":"Martin"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies","full_name":"Wies, Thomas"}]},{"language":[{"iso":"eng"}],"conference":{"name":"CONCUR: Concurrency Theory","location":"Paris, France","start_date":"2010-08-31","end_date":"2010-09-03"},"doi":"10.1007/978-3-642-15375-4_18","quality_controlled":"1","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"oa":1,"month":"11","date_updated":"2023-02-23T12:24:04Z","date_created":"2018-12-11T12:08:37Z","volume":6269,"author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun"}],"related_material":{"record":[{"id":"3249","relation":"later_version","status":"public"},{"relation":"earlier_version","status":"public","id":"5389"}]},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"year":"2010","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","file_date_updated":"2020-07-14T12:46:28Z","ec_funded":1,"publist_id":"1065","date_published":"2010-11-01T00:00:00Z","page":"235 - 268","citation":{"mla":"Cerny, Pavol, et al. Simulation Distances. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:10.1007/978-3-642-15375-4_18.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_18.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:10.1007/978-3-642-15375-4_18","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_18"},"day":"01","has_accepted_license":"1","scopus_import":1,"oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","creator":"system","file_size":198913,"content_type":"application/pdf","file_id":"5130","relation":"main_file","checksum":"ea567903676ba8afe0507ee11313dce5","date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:15:12Z"}],"pubrep_id":"42","title":"Simulation distances","ddc":["005"],"status":"public","intvolume":" 6269","_id":"4393","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference"},{"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"3366"}]},"pubrep_id":"24","date_created":"2018-12-12T11:39:03Z","date_updated":"2023-02-23T11:24:08Z","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5515","date_updated":"2020-07-14T12:46:42Z","date_created":"2018-12-12T11:53:53Z","checksum":"da38782d2388a6fa32109d10bb9bad67","file_name":"IST-2010-0004_IST-2010-0004.pdf","access_level":"open_access","file_size":429101,"content_type":"application/pdf","creator":"system"}],"year":"2010","_id":"5388","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"status":"public","publication_status":"published","title":"Quantitative synthesis for concurrent programs","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IST Austria","abstract":[{"lang":"eng","text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements."}],"file_date_updated":"2020-07-14T12:46:42Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2010-0004","date_published":"2010-10-07T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"citation":{"short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","mla":"Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.","chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0004.","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. Quantitative Synthesis for Concurrent Programs. IST Austria; 2010. doi:10.15479/AT:IST-2010-0004","apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.","ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p."},"page":"17","day":"07","month":"10","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"pubrep_id":"25","related_material":{"record":[{"relation":"later_version","status":"public","id":"3249"},{"id":"4393","status":"public","relation":"later_version"}]},"date_created":"2018-12-12T11:39:03Z","date_updated":"2023-02-23T12:09:16Z","file":[{"creator":"system","content_type":"application/pdf","file_size":367246,"file_name":"IST-2010-0003_IST-2010-0003.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:42Z","date_created":"2018-12-12T11:54:25Z","checksum":"284ded99764e32a583a8ea83fcea254b","file_id":"5547","relation":"main_file"}],"oa_version":"Published Version","_id":"5389","year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","ddc":["005"],"title":"Simulation distances","status":"public","publisher":"IST Austria","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:42Z","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2010-0003","date_published":"2010-06-04T00:00:00Z","language":[{"iso":"eng"}],"citation":{"chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0003.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.","mla":"Cerny, Pavol, et al. Simulation Distances. IST Austria, 2010, doi:10.15479/AT:IST-2010-0003.","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances. IST Austria. https://doi.org/10.15479/AT:IST-2010-0003","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation Distances. IST Austria; 2010. doi:10.15479/AT:IST-2010-0003"},"oa":1,"page":"24","month":"06","day":"04","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1"},{"month":"07","conference":{"name":"CAV: Computer Aided Verification","end_date":"2010-07-17","start_date":"2010-07-15","location":"Edinburgh, UK"},"doi":"10.1007/978-3-642-14295-6_41","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:28Z","publist_id":"1066","author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"last_name":"Chaudhuri","first_name":"Swarat","full_name":"Chaudhuri, Swarat"},{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"}],"related_material":{"record":[{"id":"5391","status":"public","relation":"earlier_version"}]},"date_created":"2018-12-11T12:08:36Z","date_updated":"2023-02-23T12:24:12Z","volume":6174,"year":"2010","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"day":"01","has_accepted_license":"1","article_processing_charge":"No","date_published":"2010-07-01T00:00:00Z","citation":{"ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_41","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model checking of linearizability of concurrent list implementations. In: Vol 6174. Springer; 2010:465-479. doi:10.1007/978-3-642-14295-6_41","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_41.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, in:, Springer, 2010, pp. 465–479.","mla":"Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. Vol. 6174, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-14295-6_41."},"page":"465 - 479","abstract":[{"lang":"eng","text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable."}],"type":"conference","alternative_title":["LNCS"],"pubrep_id":"27","oa_version":"Submitted Version","file":[{"creator":"dernst","file_size":3633276,"content_type":"application/pdf","access_level":"open_access","file_name":"2010_CAV_Cerny.pdf","checksum":"2eb211ce40b3c4988bce3a3592980704","date_created":"2020-05-19T16:31:56Z","date_updated":"2020-07-14T12:46:28Z","file_id":"7873","relation":"main_file"}],"_id":"4390","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Model checking of linearizability of concurrent list implementations","ddc":["000"],"intvolume":" 6174"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-14295-6_57","conference":{"location":"Edinburgh, UK","start_date":"2010-07-15","end_date":"2010-07-17","name":"CAV: Computer Aided Verification"},"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"quality_controlled":"1","external_id":{"arxiv":["1004.2367"]},"oa":1,"month":"07","volume":6174,"date_created":"2018-12-11T12:08:36Z","date_updated":"2023-02-23T12:24:17Z","related_material":{"record":[{"id":"5393","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","year":"2010","ec_funded":1,"publist_id":"1068","file_date_updated":"2020-07-14T12:46:28Z","date_published":"2010-07-01T00:00:00Z","page":"665 - 669","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_57.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","mla":"Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games. Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_57","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:10.1007/978-3-642-14295-6_57"},"has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":1,"oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"5221","checksum":"0b2ef8c4037ffccc6902d93081af24f7","date_updated":"2020-07-14T12:46:28Z","date_created":"2018-12-12T10:16:33Z","access_level":"open_access","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","content_type":"application/pdf","file_size":293605,"creator":"system"}],"pubrep_id":"43","intvolume":" 6174","title":"GIST: A solver for probabilistic games","ddc":["004"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"4388","abstract":[{"lang":"eng","text":"GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}],"alternative_title":["LNCS"],"type":"conference"},{"doi":"10.15479/AT:IST-2010-0001","date_published":"2010-04-19T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"citation":{"mla":"Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model Checking of Linearizability of Concurrent List Implementations. IST Austria; 2010. doi:10.15479/AT:IST-2010-0001","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria. https://doi.org/10.15479/AT:IST-2010-0001"},"page":"27","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"04","day":"19","pubrep_id":"27","related_material":{"record":[{"id":"4390","status":"public","relation":"later_version"}]},"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"}],"oa_version":"Published Version","file":[{"creator":"system","file_size":372286,"content_type":"application/pdf","file_name":"IST-2010-0001_IST-2010-0001.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:43Z","date_created":"2018-12-12T11:53:44Z","checksum":"986645caad7dd85a6a091488f6c646dc","file_id":"5505","relation":"main_file"}],"date_updated":"2023-02-23T12:09:09Z","date_created":"2018-12-12T11:39:04Z","_id":"5391","year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publisher":"IST Austria","ddc":["004"],"status":"public","title":"Model checking of linearizability of concurrent list implementations","publication_status":"published","file_date_updated":"2020-07-14T12:46:43Z","abstract":[{"lang":"eng","text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"publist_id":"2324","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5392"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"volume":6252,"date_updated":"2023-02-23T12:24:14Z","date_created":"2018-12-11T12:05:33Z","year":"2010","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","month":"10","doi":"10.1007/978-3-642-15643-4_1","conference":{"end_date":"2010-09-24","start_date":"2010-09-21","location":"Singapore, Singapore","name":"ATVA: Automated Technology for Verification and Analysis"},"language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"pubrep_id":"28","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3857","intvolume":" 6252","status":"public","title":"Probabilistic Automata on infinite words: decidability and undecidability results","day":"12","scopus_import":1,"date_published":"2010-10-12T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. Vol. 6252, Springer, 2010, pp. 1–16, doi:10.1007/978-3-642-15643-4_1.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. https://doi.org/10.1007/978-3-642-15643-4_1.","ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:10.1007/978-3-642-15643-4_1","ista":"Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.","apa":"Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. https://doi.org/10.1007/978-3-642-15643-4_1","ieee":"K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16."},"page":"1 - 16"},{"file":[{"relation":"main_file","file_id":"5038","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","date_created":"2018-12-12T10:13:51Z","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","file_size":173948,"content_type":"application/pdf","creator":"system"}],"oa_version":"Submitted Version","pubrep_id":"61","intvolume":" 6281","ddc":["004"],"title":"Qualitative analysis of partially-observable Markov Decision Processes","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3855","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives."}],"alternative_title":["LNCS"],"type":"conference","date_published":"2010-08-01T00:00:00Z","page":"258 - 269","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_24.","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. Vol. 6281, Springer, 2010, pp. 258–69, doi:10.1007/978-3-642-15155-2_24.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_24","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:10.1007/978-3-642-15155-2_24"},"has_accepted_license":"1","day":"01","scopus_import":1,"volume":6281,"date_updated":"2023-02-23T12:24:22Z","date_created":"2018-12-11T12:05:32Z","related_material":{"record":[{"id":"5395","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","year":"2010","ec_funded":1,"publist_id":"2326","file_date_updated":"2020-07-14T12:46:17Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15155-2_24","conference":{"end_date":"2010-08-27","location":"Brno, Czech Republic","start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science"},"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"month":"08"},{"month":"03","oa":1,"quality_controlled":"1","doi":"10.1007/978-3-642-12032-9_8","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures","end_date":"2010-03-28","location":"Paphos, Cyprus","start_date":"2010-03-20"},"language":[{"iso":"eng"}],"publist_id":"1099","file_date_updated":"2020-07-14T12:46:27Z","year":"2010","editor":[{"full_name":"Ong, Luke","last_name":"Ong","first_name":"Luke"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"1405","status":"public","relation":"dissertation_contains"}]},"author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"volume":6014,"date_updated":"2023-09-07T11:36:36Z","date_created":"2018-12-11T12:08:27Z","scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-12032-9_8.","mla":"Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108.","apa":"Wies, T., Zufferey, D., & Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12032-9_8","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:10.1007/978-3-642-12032-9_8"},"page":"94 - 108","date_published":"2010-03-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"4361","intvolume":" 6014","ddc":["004"],"status":"public","title":"Forward analysis of depth-bounded processes","pubrep_id":"50","file":[{"checksum":"3e610de84937d821316362658239134a","date_updated":"2020-07-14T12:46:27Z","date_created":"2018-12-12T10:08:17Z","relation":"main_file","file_id":"4677","file_size":240766,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf"}],"oa_version":"Submitted Version"},{"publist_id":"2348","file_date_updated":"2020-07-14T12:46:17Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"3842"}]},"author":[{"full_name":"Didier, Frédéric","first_name":"Frédéric","last_name":"Didier"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Mateescu, Maria","last_name":"Mateescu","first_name":"Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"}],"volume":4,"date_created":"2018-12-11T12:05:28Z","date_updated":"2023-02-23T11:45:05Z","acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","year":"2009","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"publisher":"IEEE","publication_status":"published","month":"10","doi":"10.1109/HiBi.2009.23","conference":{"name":"HIBI: High-Performance Computational Systems Biology","end_date":"2009-10-16","location":"Trento, Italy","start_date":"2009-10-14"},"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","issue":"6","abstract":[{"lang":"eng","text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous- time Markov chain (CTMC).\r\nStandard Uniformization (SU) is an efficient method for the transient analysis of CTMCs. For systems with very different time scales, such as biochemical reaction networks, SU is computationally expensive. In these cases, a variant of SU, called adaptive uniformization (AU), is known to reduce the large number of iterations needed by SU. The additional difficulty of AU is that it requires the solution of a birth process.\r\nIn this paper we present an on-the-fly variant of AU, where we improve the original algorithm for AU at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks."}],"type":"conference","file":[{"file_name":"2009_HIBI_Didier.pdf","access_level":"open_access","file_size":222890,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7874","date_created":"2020-05-19T16:33:55Z","date_updated":"2020-07-14T12:46:17Z","checksum":"9a3bde48f43203991a0b3c6a277c2f5b"}],"oa_version":"Submitted Version","_id":"3843","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 4","ddc":["000"],"title":"Fast adaptive uniformization of the chemical master equation","status":"public","has_accepted_license":"1","article_processing_charge":"No","day":"30","scopus_import":1,"date_published":"2009-10-30T00:00:00Z","citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.","mla":"Didier, Frédéric, et al. Fast Adaptive Uniformization of the Chemical Master Equation. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:10.1109/HiBi.2009.23.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,” 4:118–27. IEEE, 2009. https://doi.org/10.1109/HiBi.2009.23.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. In: Vol 4. IEEE; 2009:118-127. doi:10.1109/HiBi.2009.23","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2009). Fast adaptive uniformization of the chemical master equation (Vol. 4, pp. 118–127). Presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy: IEEE. https://doi.org/10.1109/HiBi.2009.23","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Fast adaptive uniformization of the chemical master equation. HIBI: High-Performance Computational Systems Biology vol. 4, 118–127."},"page":"118 - 127"},{"month":"09","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Palaiseau, France","start_date":"2009-09-23","end_date":"2009-09-25","name":"RP: Reachability Problems"},"doi":"10.1007/978-3-642-04420-5_2","file_date_updated":"2020-07-14T12:46:16Z","publist_id":"2352","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2009","acknowledgement":"This research was supported in part by the Excellence Cluster on Multimodal Computing and Interaction and the Swiss National Science Foundation.","date_updated":"2023-02-23T11:24:49Z","date_created":"2018-12-11T12:05:28Z","volume":5797,"author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"related_material":{"record":[{"id":"3381","relation":"later_version","status":"public"}]},"scopus_import":1,"day":"07","has_accepted_license":"1","page":"3 - 23","citation":{"mla":"Henzinger, Thomas A., et al. Formalisms for Specifying Markovian Population Models. Vol. 5797, Springer, 2009, pp. 3–23, doi:10.1007/978-3-642-04420-5_2.","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,” 5797:3–23. Springer, 2009. https://doi.org/10.1007/978-3-642-04420-5_2.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. In: Vol 5797. Springer; 2009:3-23. doi:10.1007/978-3-642-04420-5_2","ista":"Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23.","apa":"Henzinger, T. A., Jobstmann, B., & Wolf, V. (2009). Formalisms for specifying Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability Problems, Palaiseau, France: Springer. https://doi.org/10.1007/978-3-642-04420-5_2"},"date_published":"2009-09-07T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model. ","lang":"eng"}],"status":"public","title":"Formalisms for specifying Markovian population models","ddc":["005"],"intvolume":" 5797","_id":"3841","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:08:41Z","checksum":"df88431872586c773fbcfea37d7b36a2","file_id":"4702","relation":"main_file","creator":"system","file_size":222840,"content_type":"application/pdf","file_name":"IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"67"},{"has_accepted_license":"1","day":"01","page":"171 - 180","citation":{"chicago":"Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,” 171–80. IEEE, 2009. https://doi.org/10.1109/RTSS.2009.9.","short":"T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180.","mla":"Henzinger, Thomas A., et al. Distributed, Modular HTL. IEEE, 2009, pp. 171–80, doi:10.1109/RTSS.2009.9.","apa":"Henzinger, T. A., Kirsch, C., Marques, E., & Sokolova, A. (2009). Distributed, modular HTL (pp. 171–180). Presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States: IEEE. https://doi.org/10.1109/RTSS.2009.9","ieee":"T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States, 2009, pp. 171–180.","ista":"Henzinger TA, Kirsch C, Marques E, Sokolova A. 2009. Distributed, modular HTL. RTSS: Real-Time Systems Symposium, 171–180.","ama":"Henzinger TA, Kirsch C, Marques E, Sokolova A. Distributed, modular HTL. In: IEEE; 2009:171-180. doi:10.1109/RTSS.2009.9"},"date_published":"2009-01-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety (schedulability of host computation). We present a modular abstract syntax and semantics for HTL, modular checks of well-formedness, race freedom, and transmission safety, and modular code distribution. Our contributions here complement previous results on HTL time safety and modular code generation. Modularity in HTL can be utilized in easy program composition as well as fast program analysis and code generation, but also in so-called runtime patching, where program components may be modified at runtime."}],"ddc":["000"],"status":"public","title":"Distributed, modular HTL","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3844","file":[{"access_level":"open_access","file_name":"IST-2012-65-v1+1_Distributed_modular_Htl.pdf","creator":"system","file_size":526458,"content_type":"application/pdf","file_id":"4655","relation":"main_file","checksum":"b2b15a5ef71eb50d62eaa5aea7efd8c4","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:07:56Z"}],"oa_version":"Submitted Version","pubrep_id":"65","month":"01","project":[{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"},{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/RTSS.2009.9","conference":{"name":"RTSS: Real-Time Systems Symposium","location":"Washington, DC, United States","start_date":"2009-12-01","end_date":"2009-12-04"},"ec_funded":1,"publist_id":"2346","file_date_updated":"2020-07-14T12:46:17Z","publisher":"IEEE","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2009","acknowledgement":"Supported by the EU ArtistDesign Network of Excellence on Embedded Systems Design, the EU project COMBEST, the Austrian Science Funds P18913-N15 and V00125, and Fundacao para a Ciencia e Tecnologia funds SFRH/BD/29461/2006 and PTDC/EIA/71462/2006","date_updated":"2021-01-12T07:52:36Z","date_created":"2018-12-11T12:05:28Z","author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"last_name":"Marques","first_name":"Eduardo","full_name":"Marques, Eduardo"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}]},{"day":"01","has_accepted_license":"1","publication":"EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software","citation":{"short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.","mla":"Tripakis, Stavros, et al. “On Relational Interfaces.” EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76, doi:10.1145/1629335.1629346.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.” In EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, 67–76. ACM, 2009. https://doi.org/10.1145/1629335.1629346.","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. On relational interfaces. In: EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software. ACM; 2009:67-76. doi:10.1145/1629335.1629346","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2009). On relational interfaces. In EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software (pp. 67–76). Grenoble, France: ACM. https://doi.org/10.1145/1629335.1629346","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,” in EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software, Grenoble, France, 2009, pp. 67–76.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2009. On relational interfaces. EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software. EMSOFT: Embedded Software , 67–76."},"page":"67 - 76","date_published":"2009-01-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"In this paper we extend the work of Alfaro, Henzinger et al. on interface theories for component-based design. Existing interface theories often fail to capture functional relations between the inputs and outputs of an interface. For example, a simple synchronous interface that takes as input a number n ≥ 0 and returns, at the same time, as output n + 1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports synchronous interfaces, both stateless and stateful. It includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions."}],"_id":"3837","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"On relational interfaces","ddc":["004"],"status":"public","pubrep_id":"70","oa_version":"Submitted Version","file":[{"file_size":310902,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2012-70-v1+1_On_Relational_Interfaces.pdf","checksum":"3a70e21527dfaad2f198549ae5710786","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:13:57Z","relation":"main_file","file_id":"5045"}],"month":"01","oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"conference":{"end_date":"2009-10-16","location":"Grenoble, France","start_date":"2009-10-12","name":"EMSOFT: Embedded Software "},"doi":"10.1145/1629335.1629346","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:16Z","publist_id":"2360","ec_funded":1,"acknowledgement":"This work is supported by the Center for Hybrid and Embedded Software Systems (CHESS) at UC Berkeley, which receives support from the National Science Foundation (NSF awards #0720882 (CSR-EHS: PRET) and #0720841 (CSR-CPS)), the U.S. Army Research Office (ARO #W911NF-07-2-0019), the U.S. Air Force Office of Scientific Research (MURI #FA9550-06-0312), the Air Force Research Lab (AFRL), the State of California Micro Program, and the following companies: Agilent, Bosch, Lockheed-Martin, National Instruments, Thales and Toyota. This work is also supported by the COMBEST and ArtistDesign projects of the European Union, and the Swiss National Science Foundation. ","year":"2009","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"ACM","author":[{"last_name":"Tripakis","first_name":"Stavros","full_name":"Tripakis, Stavros"},{"full_name":"Lickly, Ben","last_name":"Lickly","first_name":"Ben"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lee, Edward","last_name":"Lee","first_name":"Edward"}],"date_updated":"2021-01-12T07:52:33Z","date_created":"2018-12-11T12:05:26Z"},{"oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0003.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0003.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. Gist: A Solver for Probabilistic Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0003","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0003"},"page":"12","doi":"10.15479/AT:IST-2009-0003","date_published":"2009-10-09T00:00:00Z","language":[{"iso":"eng"}],"day":"09","month":"10","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"_id":"5393","year":"2009","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Gist: A solver for probabilistic games","ddc":["000","005"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IST Austria","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"4388"}]},"pubrep_id":"29","date_updated":"2023-02-23T12:09:01Z","date_created":"2018-12-12T11:39:05Z","file":[{"file_id":"5459","relation":"main_file","checksum":"49551ac552915b17593a14c993845274","date_updated":"2020-07-14T12:46:43Z","date_created":"2018-12-12T11:52:58Z","access_level":"open_access","file_name":"IST-2009-0003_IST-2009-0003.pdf","creator":"system","file_size":386866,"content_type":"application/pdf"}],"oa_version":"Published Version","type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:43Z","abstract":[{"lang":"eng","text":"Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides efficient implementations of several reduction based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}]},{"pubrep_id":"30","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian"}],"oa_version":"Published Version","file":[{"file_name":"IST-2009-0002_IST-2009-0002.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":238091,"file_id":"5511","relation":"main_file","date_created":"2018-12-12T11:53:50Z","date_updated":"2020-07-14T12:46:43Z","checksum":"1c50a9723fbae1b2c46d18138968efb3"}],"date_updated":"2020-07-14T23:07:47Z","date_created":"2018-12-12T11:39:05Z","_id":"5394","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IST Austria","status":"public","ddc":["004"],"publication_status":"published","title":"Improved lower bounds for request-response and finitary Streett games","file_date_updated":"2020-07-14T12:46:43Z","abstract":[{"text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"date_published":"2009-09-09T00:00:00Z","doi":"10.15479/AT:IST-2009-0002","language":[{"iso":"eng"}],"oa":1,"citation":{"ama":"Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002","ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.","apa":"Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002","mla":"Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0002."},"page":"11","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","month":"09","day":"09"},{"month":"09","day":"09","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0001.","mla":"Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable Markov decision processes. IST Austria, 2009.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria; 2009. doi:10.15479/AT:IST-2009-0001"},"oa":1,"page":"20","doi":"10.15479/AT:IST-2009-0001","date_published":"2009-09-09T00:00:00Z","language":[{"iso":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:43Z","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observa- tions. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDPs with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDPs with parity objectives and its subclasses."}],"_id":"5395","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","publication_status":"published","status":"public","title":"Qualitative analysis of partially-observable Markov decision processes","ddc":["005"],"publisher":"IST Austria","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"id":"3855","status":"public","relation":"later_version"}]},"pubrep_id":"31","date_updated":"2023-02-23T11:45:39Z","date_created":"2018-12-12T11:39:05Z","file":[{"creator":"system","file_size":342088,"content_type":"application/pdf","file_name":"IST-2009-0001_IST-2009-0001.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:43Z","date_created":"2018-12-12T11:53:25Z","checksum":"04d9cc065cc19598a4e8631c47f1a562","file_id":"5486","relation":"main_file"}],"oa_version":"Published Version"}]