[{"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"title":"Ideal abstractions for well structured transition systems","author":[{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"},{"full_name":"Wies, Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"3406","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.","ista":"Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460.","mla":"Zufferey, Damien, et al. Ideal Abstractions for Well Structured Transition Systems. Vol. 7148, Springer, 2012, pp. 445–60, doi:10.1007/978-3-642-27940-9_29.","apa":"Zufferey, D., Wies, T., & Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_29","ama":"Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:10.1007/978-3-642-27940-9_29","ieee":"D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.","short":"D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460."},"publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"This research was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.","date_published":"2012-01-01T00:00:00Z","doi":"10.1007/978-3-642-27940-9_29","date_created":"2018-12-11T12:02:16Z","page":"445 - 460","day":"01","has_accepted_license":"1","year":"2012","status":"public","pubrep_id":"100","type":"conference","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2012-01-22","end_date":"2012-01-24","location":"Philadelphia, PA, USA"},"_id":"3251","file_date_updated":"2020-07-14T12:46:05Z","department":[{"_id":"ToHe"}],"ddc":["000","005"],"date_updated":"2023-09-07T11:36:36Z","month":"01","intvolume":" 7148","alternative_title":["LNCS"],"oa_version":"Submitted Version","abstract":[{"text":"Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward analyses for computing the covering set. Termination of these algorithms can only be guaranteed for flattable WSTS. Yet, many WSTS of practical interest are not flattable and the question whether any given WSTS is flattable is itself undecidable. We therefore propose an analysis that computes the covering set and captures the essence of acceleration-based algorithms, but sacrifices precision for guaranteed termination. Our analysis is an abstract interpretation whose abstract domain builds on the ideal completion of the well-quasi-ordered state space, and a widening operator that mimics acceleration and controls the loss of precision of the analysis. We present instances of our framework for various classes of WSTS. Our experience with a prototype implementation indicates that, despite the inherent precision loss, our analysis often computes the precise covering set of the analyzed system.","lang":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"1405","status":"public"}]},"volume":7148,"ec_funded":1,"file":[{"creator":"system","date_updated":"2020-07-14T12:46:05Z","file_size":217104,"date_created":"2018-12-12T10:09:35Z","file_name":"IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4759","checksum":"f2f0d55efa32309ad1fe65a5fcaad90c"}],"language":[{"iso":"eng"}],"publication_status":"published"},{"_id":"3264","conference":{"name":"APLAS: Asian Symposium on Programming Languages and Systems","location":"Kenting, Taiwan","end_date":"2011-12-07","start_date":"2011-12-05"},"type":"conference","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"status":"public","date_updated":"2021-01-12T07:42:15Z","citation":{"chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. https://doi.org/10.1007/978-3-642-25318-8_16.","ista":"Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.","mla":"Gupta, Ashutosh, et al. Solving Recursion-Free Horn Clauses over LI+UIF. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:10.1007/978-3-642-25318-8_16.","ama":"Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:10.1007/978-3-642-25318-8_16","apa":"Gupta, A., Popeea, C., & Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3383","author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey","first_name":"Andrey"}],"editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}],"title":"Solving recursion-free Horn clauses over LI+UIF","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms."}],"oa_version":"None","quality_controlled":"1","alternative_title":["LNCS"],"publisher":"Springer","intvolume":" 7078","month":"12","year":"2011","publication_status":"published","language":[{"iso":"eng"}],"day":"05","page":"188 - 203","ec_funded":1,"date_created":"2018-12-11T12:02:20Z","date_published":"2011-12-05T00:00:00Z","doi":"10.1007/978-3-642-25318-8_16","volume":7078},{"month":"06","oa":1,"quality_controlled":"1","publisher":"USENIX","oa_version":"Submitted Version","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler.","lang":"eng"}],"date_created":"2018-12-11T12:02:33Z","date_published":"2011-06-14T00:00:00Z","page":"1 - 6","language":[{"iso":"eng"}],"day":"14","file":[{"file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf","date_created":"2018-12-12T10:18:14Z","file_size":232770,"date_updated":"2020-07-14T12:46:06Z","creator":"system","checksum":"21a461ac004bb535c83320fe79b30375","file_id":"5333","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"year":"2011","publication_status":"published","has_accepted_license":"1","pubrep_id":"90","status":"public","conference":{"name":"HotCloud: Workshop on Hot Topics in Cloud Computing","start_date":"2011-06-14","end_date":"2011-06-15"},"type":"conference","_id":"3302","department":[{"_id":"ToHe"}],"title":"Static scheduling in clouds","file_date_updated":"2020-07-14T12:46:06Z","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Singh","full_name":"Singh, Anmol","id":"72A86902-E99F-11E9-9F62-915534D1B916","first_name":"Anmol"},{"last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu"},{"last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"publist_id":"3338","ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.","ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","mla":"Henzinger, Thomas A., et al. Static Scheduling in Clouds. USENIX, 2011, pp. 1–6.","short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.","ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.","apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., & Zufferey, D. (2011). Static scheduling in clouds (pp. 1–6). Presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, USENIX.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: USENIX; 2011:1-6."},"date_updated":"2021-01-12T07:42:31Z"},{"date_created":"2018-12-11T12:02:33Z","date_published":"2011-01-01T00:00:00Z","language":[{"iso":"eng"}],"file":[{"file_size":240820,"date_updated":"2020-07-14T12:46:06Z","creator":"system","file_name":"IST-2012-91-v1+1_Tail_approximation_for_the_chemical_master_equation.pdf","date_created":"2018-12-12T10:18:12Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5331","checksum":"aa4d7a832a5419e6c0090650ebff2b9a"}],"day":"01","publication_status":"published","year":"2011","has_accepted_license":"1","month":"01","oa":1,"publisher":"Tampere International Center for Signal Processing","quality_controlled":"1","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The chemical master equation is a differential equation describing the time evolution of the probability distribution over the possible “states” of a biochemical system. The solution of this equation is of interest within the systems biology field ever since the importance of the molec- ular noise has been acknowledged. Unfortunately, most of the systems do not have analytical solutions, and numerical solutions suffer from the course of dimensionality and therefore need to be approximated. Here, we introduce the concept of tail approximation, which retrieves an approximation of the probabilities in the tail of a distribution from the total probability of the tail and its conditional expectation. This approximation method can then be used to numerically compute the solution of the chemical master equation on a subset of the state space, thus fighting the explosion of the state space, for which this problem is renowned."}],"file_date_updated":"2020-07-14T12:46:06Z","department":[{"_id":"ToHe"}],"title":"Tail approximation for the chemical master equation","publist_id":"3339","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"}],"ddc":["005","570"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Henzinger, T. A., & Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.","ama":"Henzinger TA, Mateescu M. Tail approximation for the chemical master equation. In: Tampere International Center for Signal Processing; 2011.","ieee":"T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.","short":"T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.","mla":"Henzinger, Thomas A., and Maria Mateescu. Tail Approximation for the Chemical Master Equation. Tampere International Center for Signal Processing, 2011.","ista":"Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011."},"date_updated":"2021-01-12T07:42:30Z","pubrep_id":"91","status":"public","conference":{"name":"WCSB: Workshop on Computational Systems Biology (TICSP)"},"type":"conference","_id":"3301"},{"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"7f5c65509db1a9fb049abedd9663ed06","file_id":"4649","date_updated":"2020-07-14T12:46:06Z","file_size":255780,"creator":"system","date_created":"2018-12-12T10:07:50Z","file_name":"IST-2012-92-v1+1_Propagation_models_for_computing_biochemical_reaction_networks.pdf"}],"publication_status":"published","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We introduce propagation models, a formalism designed to support general and efficient data structures for the transient analysis of biochemical reaction networks. We give two use cases for propagation abstract data types: the uniformization method and numerical integration. We also sketch an implementation of a propagation abstract data type, which uses abstraction to approximate states."}],"month":"09","scopus_import":1,"ddc":["000","004"],"date_updated":"2021-01-12T07:42:29Z","file_date_updated":"2020-07-14T12:46:06Z","department":[{"_id":"ToHe"}],"_id":"3299","pubrep_id":"92","status":"public","conference":{"start_date":"2011-09-21","location":"Paris, France","end_date":"2011-09-23","name":"CMSB: Computational Methods in Systems Biology"},"type":"conference","day":"21","year":"2011","has_accepted_license":"1","date_created":"2018-12-11T12:02:32Z","date_published":"2011-09-21T00:00:00Z","doi":"10.1145/2037509.2037510","page":"1 - 3","oa":1,"publisher":"Springer","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,” 1–3. Springer, 2011. https://doi.org/10.1145/2037509.2037510.","ieee":"T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.","short":"T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3.","ama":"Henzinger TA, Mateescu M. Propagation models for computing biochemical reaction networks. In: Springer; 2011:1-3. doi:10.1145/2037509.2037510","apa":"Henzinger, T. A., & Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. https://doi.org/10.1145/2037509.2037510","mla":"Henzinger, Thomas A., and Maria Mateescu. Propagation Models for Computing Biochemical Reaction Networks. Springer, 2011, pp. 1–3, doi:10.1145/2037509.2037510."},"title":"Propagation models for computing biochemical reaction networks","publist_id":"3341","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"}]},{"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"In addition to being correct, a system should be robust, that is, it should behave reasonably even after receiving unexpected inputs. In this paper, we summarize two formal notions of robustness that we have introduced previously for reactive systems. One of the notions is based on assigning costs for failures on a user-provided notion of incorrect transitions in a specification. Here, we define a system to be robust if a finite number of incorrect inputs does not lead to an infinite number of incorrect outputs. We also give a more refined notion of robustness that aims to minimize the ratio of output failures to input failures. The second notion is aimed at liveness. In contrast to the previous notion, it has no concept of recovery from an error. Instead, it compares the ratio of the number of liveness constraints that the system violates to the number of liveness constraints that the environment violates."}],"month":"07","scopus_import":1,"main_file_link":[{"url":"https://openlib.tugraz.at/download.php?id=5cb57c8a49344&location=browse","open_access":"1"}],"date_updated":"2021-01-12T07:42:36Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3316","status":"public","type":"conference","conference":{"name":" SIES: International Symposium on Industrial Embedded Systems","location":"Vasteras, Sweden","end_date":"2011-06-17","start_date":"2011-06-15"},"day":"14","publication":"6th IEEE International Symposium on Industrial and Embedded Systems","year":"2011","doi":"10.1109/SIES.2011.5953660","date_published":"2011-07-14T00:00:00Z","date_created":"2018-12-11T12:02:38Z","page":"176 - 185","publisher":"IEEE","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered robustness. In: 6th IEEE International Symposium on Industrial and Embedded Systems. IEEE; 2011:176-185. doi:10.1109/SIES.2011.5953660","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660","mla":"Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660."},"title":"Specification-centered robustness","author":[{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Greimel","full_name":"Greimel, Karin","first_name":"Karin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"}],"publist_id":"3323","article_processing_charge":"No","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]},{"citation":{"chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011. https://doi.org/10.1145/1985342.1985345.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14.","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM. https://doi.org/10.1145/1985342.1985345","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 2011;33(4). doi:10.1145/1985342.1985345","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Stavros","full_name":"Tripakis, Stavros","last_name":"Tripakis"},{"full_name":"Lickly, Ben","last_name":"Lickly","first_name":"Ben"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Lee, Edward","last_name":"Lee","first_name":"Edward"}],"publist_id":"3263","title":"A theory of synchronous relational interfaces","article_number":"14","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"}],"has_accepted_license":"1","year":"2011","day":"01","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","date_published":"2011-07-01T00:00:00Z","doi":"10.1145/1985342.1985345","date_created":"2018-12-11T12:02:51Z","quality_controlled":"1","publisher":"ACM","oa":1,"date_updated":"2021-01-12T07:42:52Z","ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}],"_id":"3353","type":"journal_article","status":"public","pubrep_id":"85","publication_status":"published","file":[{"file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","date_created":"2018-12-12T10:16:45Z","file_size":775662,"date_updated":"2020-07-14T12:46:09Z","creator":"system","checksum":"5d44a8aa81e33210649beae507602138","file_id":"5235","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"volume":33,"issue":"4","ec_funded":1,"abstract":[{"lang":"eng","text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces."}],"oa_version":"Submitted Version","scopus_import":1,"month":"07","intvolume":" 33"},{"quality_controlled":"1","publisher":"IEEE","oa":1,"has_accepted_license":"1","year":"2011","day":"13","page":"255 - 264","doi":"10.1109/QEST.2011.40","date_published":"2011-10-13T00:00:00Z","date_created":"2018-12-11T12:02:51Z","citation":{"mla":"Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40.","ieee":"R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","apa":"Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40","ama":"Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40","chicago":"Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.","ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Halalai, Raluca","last_name":"Halalai","id":"584C6850-E996-11E9-805B-F01764644770","first_name":"Raluca"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Singh","full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3260","title":"Quantitative evaluation of BFT protocols","abstract":[{"lang":"eng","text":"Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems."}],"oa_version":"Submitted Version","scopus_import":1,"month":"10","publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"4dc8750ab7921f51de992000b13d1b01","file_id":"4648","creator":"system","date_updated":"2020-07-14T12:46:09Z","file_size":272017,"date_created":"2018-12-12T10:07:49Z","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf"}],"language":[{"iso":"eng"}],"_id":"3355","type":"conference","conference":{"name":"QEST: Quantitative Evaluation of Systems","start_date":"2011-09-05","location":"Aachen, Germany","end_date":"2011-09-08"},"status":"public","pubrep_id":"84","date_updated":"2021-01-12T07:42:53Z","ddc":["000","004"],"file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}]},{"publication_status":"published","year":"2011","day":"04","language":[{"iso":"eng"}],"publication":"ACM Transactions on Computational Logic (TOCL)","doi":"10.1145/1970398.1970404","issue":"4","date_published":"2011-07-04T00:00:00Z","related_material":{"record":[{"status":"public","id":"2054","relation":"later_version"}]},"volume":12,"date_created":"2018-12-11T12:02:51Z","abstract":[{"lang":"eng","text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory."}],"oa_version":"None","scopus_import":1,"publisher":"ACM","quality_controlled":"1","month":"07","intvolume":" 12","citation":{"ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404.","apa":"Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404."},"date_updated":"2023-02-23T10:26:18Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"De Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3262","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Qualitative concurrent parity games","_id":"3354","article_number":"28","type":"journal_article","status":"public","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"page":"72 - 82","date_published":"2011-10-01T00:00:00Z","volume":54,"doi":"10.1145/2001269.2001289","issue":"10","ec_funded":1,"date_created":"2018-12-11T12:02:50Z","year":"2011","publication_status":"published","day":"01","publication":"Communications of the ACM","language":[{"iso":"eng"}],"publisher":"ACM","quality_controlled":"1","month":"10","intvolume":" 54","abstract":[{"text":"Exploring the connection of biology with reactive systems to better understand living systems.","lang":"eng"}],"oa_version":"None","publist_id":"3267","author":[{"last_name":"Fisher","full_name":"Fisher, Jasmin","first_name":"Jasmin"},{"full_name":"Harel, David","last_name":"Harel","first_name":"David"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"department":[{"_id":"ToHe"}],"title":"Biology as reactivity","citation":{"ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.","chicago":"Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” Communications of the ACM. ACM, 2011. https://doi.org/10.1145/2001269.2001289.","short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.","ieee":"J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011.","ama":"Fisher J, Harel D, Henzinger TA. Biology as reactivity. Communications of the ACM. 2011;54(10):72-82. doi:10.1145/2001269.2001289","apa":"Fisher, J., Harel, D., & Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM. https://doi.org/10.1145/2001269.2001289","mla":"Fisher, Jasmin, et al. “Biology as Reactivity.” Communications of the ACM, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289."},"date_updated":"2021-01-12T07:42:52Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"_id":"3352"},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","page":"404 - 418","date_created":"2018-12-11T12:02:54Z","doi":"10.1007/978-3-642-23217-6_27","date_published":"2011-01-01T00:00:00Z","year":"2011","has_accepted_license":"1","day":"01","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"article_processing_charge":"No","author":[{"first_name":"Jasmin","full_name":"Fisher, Jasmin","last_name":"Fisher"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"},{"first_name":"Anmol","last_name":"Singh","full_name":"Singh, Anmol"},{"first_name":"Moshe","full_name":"Vardi, Moshe","last_name":"Vardi"}],"publist_id":"3253","title":"Dynamic reactive modules","citation":{"chicago":"Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. https://doi.org/10.1007/978-3-642-23217-6_27.","ista":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.","mla":"Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27.","apa":"Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27","ama":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:10.1007/978-3-642-23217-6_27","ieee":"J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.","short":"J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 6901","month":"01","abstract":[{"lang":"eng","text":"State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables."}],"oa_version":"Submitted Version","ec_funded":1,"volume":6901,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"2011_CONCUR_Fisher.pdf","date_created":"2020-05-19T16:17:48Z","file_size":337125,"date_updated":"2020-07-14T12:46:10Z","creator":"dernst","file_id":"7870","checksum":"6bf2453d8e52e979ddb58d17325bad26","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"conference":{"start_date":"2011-09-06","end_date":"2011-09-09","location":"Aachen, Germany","name":"CONCUR: Concurrency Theory"},"type":"conference","status":"public","_id":"3362","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:10Z","date_updated":"2021-01-12T07:42:57Z","ddc":["000"]},{"publisher":"Springer","quality_controlled":"1","oa":1,"page":"267 - 271","date_published":"2011-09-29T00:00:00Z","doi":"10.1007/978-3-642-19835-9_24","date_created":"2018-12-11T12:02:55Z","has_accepted_license":"1","year":"2011","day":"29","publist_id":"3248","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"title":"QUASY: quantitative synthesis tool","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24","mla":"Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"scopus_import":1,"month":"09","intvolume":" 6605","abstract":[{"text":"We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives.","lang":"eng"}],"oa_version":"Submitted Version","volume":6605,"publication_status":"published","file":[{"creator":"system","date_updated":"2020-07-14T12:46:10Z","file_size":475661,"date_created":"2018-12-12T10:13:37Z","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","file_id":"5022"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2011-04-03","location":"Saarbrucken, Germany","start_date":"2011-03-26"},"status":"public","pubrep_id":"77","_id":"3365","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:10Z","date_updated":"2021-01-12T07:42:58Z","ddc":["000","005"]},{"day":"01","language":[{"iso":"eng"}],"publication_status":"submitted","year":"2011","date_published":"2011-04-01T00:00:00Z","date_created":"2018-12-11T12:02:54Z","ec_funded":1,"page":"19","oa_version":"Preprint","abstract":[{"lang":"eng","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 a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"month":"04","publisher":"ArXiv","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1104.0127","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-01-21T13:20:24Z","citation":{"mla":"Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","apa":"Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.","ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"The decidability frontier for probabilistic automata on infinite words","publist_id":"3251","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Tracol, Mathieu","last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu"}],"external_id":{"arxiv":["1104.0127"]},"_id":"3363","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"status":"public","type":"preprint"},{"doi":"10.1142/S0129054111008441","date_published":"2011-06-01T00:00:00Z","date_created":"2018-12-11T12:03:00Z","page":"823 - 841","day":"01","publication":"IJFCS: International Journal of Foundations of Computer Science","has_accepted_license":"1","year":"2011","publisher":"World Scientific Publishing","quality_controlled":"1","oa":1,"title":"Formalisms for specifying Markovian population models","publist_id":"3226","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:10.1142/S0129054111008441.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 2011;22(4):823-841. doi:10.1142/S0129054111008441","apa":"Henzinger, T. A., Jobstmann, B., & Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054111008441","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.” IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing, 2011. https://doi.org/10.1142/S0129054111008441.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2011. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 22(4), 823–841."},"issue":"4","related_material":{"record":[{"id":"3841","status":"public","relation":"earlier_version"}]},"volume":22,"file":[{"file_name":"IST-2016-628-v1+1_journals-ijfcs-HenzingerJW11.pdf","date_created":"2018-12-12T10:08:45Z","file_size":222840,"date_updated":"2020-07-14T12:46:11Z","creator":"system","checksum":"df88431872586c773fbcfea37d7b36a2","file_id":"4707","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"06","intvolume":" 22","scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"In this survey, we compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages — matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models — describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, and ease of use. Moreover, they provide different support for checking the well-formedness of a model and for analyzing a model.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:11Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2023-02-23T11:45:03Z","status":"public","pubrep_id":"628","type":"journal_article","_id":"3381"},{"language":[{"iso":"eng"}],"file":[{"file_id":"5231","checksum":"3480e1594bbef25ff7462fa93a8a814e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf","date_created":"2018-12-12T10:16:42Z","creator":"system","file_size":588863,"date_updated":"2020-07-14T12:46:07Z"}],"publication_status":"published","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","issue":"4","related_material":{"record":[{"relation":"earlier_version","id":"3876","status":"public"}]},"volume":7,"oa_version":"Published Version","abstract":[{"text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers.","lang":"eng"}],"intvolume":" 7","month":"12","scopus_import":1,"ddc":["000","005"],"date_updated":"2023-02-23T11:46:35Z","file_date_updated":"2020-07-14T12:46:07Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3315","pubrep_id":"506","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"type":"journal_article","publication":"Logical Methods in Computer Science","day":"14","year":"2011","has_accepted_license":"1","date_created":"2018-12-11T12:02:37Z","doi":"10.2168/LMCS-7(4:8)2011","date_published":"2011-12-14T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"International Federation of Computational Logic","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011","apa":"Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science. International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4)."},"title":"Timed parity games: Complexity and robustness","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"publist_id":"3324","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}]},{"citation":{"apa":"Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37","ama":"Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37","short":"S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.","mla":"Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.","ista":"Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3309","author":[{"last_name":"Almagor","full_name":"Almagor, Shaull","first_name":"Shaull"},{"last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"article_processing_charge":"No","title":"What’s decidable about weighted automata ","has_accepted_license":"1","year":"2011","day":"14","page":"482 - 491","date_published":"2011-10-14T00:00:00Z","doi":"10.1007/978-3-642-24372-1_37","date_created":"2018-12-11T12:02:41Z","publisher":"Springer","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T07:42:40Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:07Z","_id":"3326","type":"conference","conference":{"start_date":"2011-10-11","end_date":"2011-10-14","location":"Taipei, Taiwan","name":"ATVA: Automated Technology for Verification and Analysis"},"status":"public","publication_status":"published","file":[{"file_id":"7868","checksum":"a7ca08a2cb1b6925f4c18a3034ae5659","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2011_LNCS_Almagor.pdf","date_created":"2020-05-19T16:08:32Z","file_size":182309,"date_updated":"2020-07-14T12:46:07Z","creator":"dernst"}],"language":[{"iso":"eng"}],"volume":6996,"abstract":[{"lang":"eng","text":"Weighted automata map input words to numerical values. Ap- plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. A weighted au- tomaton is defined with respect to a semiring. For the tropical semiring, the weight of a run is the sum of the weights of the transitions taken along the run, and the value of a word is the minimal weight of an accepting run on it. In the 90’s, Krob studied the decidability of problems on rational series defined with respect to the tropical semiring. Rational series are strongly related to weighted automata, and Krob’s results apply to them. In par- ticular, it follows from Krob’s results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata defined with respect to the tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable when the domain is ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob’s reasoning, make the un- decidability result accessible to the automata-theoretic community, and strengthen it to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights on the transitions are from the set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten also the decidability re- sults and to show that the universality problem for weighted automata defined with respect to the tropical semiring with domain ∪ {∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of containment vs. universality and the front of the ∪ {∞} vs. the ∪ {∞} domains."}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"month":"10","intvolume":" 6996"},{"publist_id":"3310","author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"}],"article_processing_charge":"No","department":[{"_id":"ToHe"}],"title":"Streaming transducers for algorithmic verification of single pass list processing programs","citation":{"ista":"Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.","chicago":"Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. https://doi.org/10.1145/1926385.1926454.","short":"R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.","ieee":"R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.","ama":"Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454","apa":"Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454","mla":"Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454."},"date_updated":"2022-03-21T08:12:51Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"start_date":"2011-01-26","location":"Texas, USA","end_date":"2011-01-28","name":"POPL: Principles of Programming Languages"},"status":"public","_id":"3325","page":"599 - 610","volume":46,"doi":"10.1145/1926385.1926454","issue":"1","date_published":"2011-01-26T00:00:00Z","date_created":"2018-12-11T12:02:41Z","year":"2011","publication_status":"published","day":"26","language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":"1","publisher":"ACM","month":"01","intvolume":" 46","abstract":[{"lang":"eng","text":"We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of data values, tagged with symbols from a finite set, over a potentially infinite data do- main that supports only the operations of equality and ordering. The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data strings. At every step, it can make decisions based on the next in- put symbol, updating its state, remembering the input data value in its data variables, and updating data-string variables by concatenat- ing data-string variables and new symbols formed from data vari- ables, while avoiding duplication. We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over in- put/output data-strings, are in PSPACE. We identify a class of imperative and a class of functional pro- grams, manipulating lists of data items, which can be effectively translated to streaming data-string transducers. The imperative pro- grams dynamically modify a singly-linked heap by changing next- pointers of heap-nodes and by adding new nodes. The main re- striction specifies how the next-pointers can be used for traversal. We also identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls. Our results lead to algorithms for assertion checking and for checking functional equivalence of two programs, written possibly in different programming styles, for commonly used routines such as insert, delete, and reverse."}],"oa_version":"None"},{"doi":"10.1007/978-3-642-18275-4_26","date_published":"2011-01-01T00:00:00Z","date_created":"2018-12-11T12:02:40Z","page":"371 - 386","day":"01","year":"2011","quality_controlled":"1","publisher":"Springer","oa":1,"title":"Decision procedures for automating termination proofs","editor":[{"full_name":"Jhala, Ranjit","last_name":"Jhala","first_name":"Ranjit"},{"first_name":"David","full_name":"Schmidt, David","last_name":"Schmidt"}],"author":[{"last_name":"Piskac","full_name":"Piskac, Ruzica","first_name":"Ruzica"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3311","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26.","ieee":"R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.","short":"R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.","ama":"Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26","apa":"Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26","chicago":"Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26.","ista":"Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386."},"volume":6538,"language":[{"iso":"eng"}],"publication_status":"published","month":"01","intvolume":" 6538","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://infoscience.epfl.ch/record/170697/","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"text":"Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear arithmetic) to express them. We believe we can significantly increase the class of programs that are amenable to automated termination proofs by identifying more expressive decidable logics for reasoning about well-founded relations. We therefore present a new decision procedure for reasoning about multiset orderings, which are among the most powerful orderings used to prove termination. We show that, using our decision procedure, one can automatically prove termination of natural abstractions of programs.","lang":"eng"}],"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:39Z","status":"public","type":"conference","conference":{"name":"VMCAI: Verification Model Checking and Abstract Interpretation","location":"Texas, USA","end_date":"2011-01-25","start_date":"2011-01-23"},"_id":"3324"},{"alternative_title":["LIPIcs"],"scopus_import":1,"month":"08","intvolume":" 12","abstract":[{"lang":"eng","text":"A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 < lambda < 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. "}],"oa_version":"Published Version","volume":12,"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication_status":"published","file":[{"file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","date_created":"2018-12-12T10:10:17Z","creator":"system","file_size":504270,"date_updated":"2020-07-14T12:46:10Z","file_id":"4803","checksum":"250603c6be8ccad4fbd4d7b24221f0ee","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2011-09-12","location":"Bergen, Norway","end_date":"2011-09-15","name":"CSL: Computer Science Logic"},"tmp":{"short":"CC BY-NC-ND (4.0)","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","image":"/images/cc_by_nc_nd.png"},"status":"public","pubrep_id":"82","_id":"3360","file_date_updated":"2020-07-14T12:46:10Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:56Z","ddc":["004"],"quality_controlled":"1","publisher":"Springer","oa":1,"page":"82 - 96","doi":"10.4230/LIPIcs.CSL.2011.82","date_published":"2011-08-31T00:00:00Z","date_created":"2018-12-11T12:02:53Z","has_accepted_license":"1","year":"2011","day":"31","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publist_id":"3255","author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"title":"Determinizing discounted-sum automata","citation":{"ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.","chicago":"Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","ieee":"U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.","apa":"Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82","ama":"Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82","mla":"Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"page":"205 - 217","doi":"10.1109/CSF.2011.21","date_published":"2011-06-27T00:00:00Z","date_created":"2018-12-11T12:02:54Z","has_accepted_license":"1","year":"2011","day":"27","publisher":"IEEE","quality_controlled":"1","oa":1,"author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"3254","title":"The complexity of quantitative information flow problems","citation":{"mla":"Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.","ieee":"P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.","ama":"Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:10.1109/CSF.2011.21","apa":"Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21","chicago":"Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"ec_funded":1,"publication_status":"published","file":[{"checksum":"1a25be0c62459fc7640db88af08ff63a","file_id":"4792","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:10:07Z","file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf","creator":"system","date_updated":"2020-07-14T12:46:10Z","file_size":299069}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"06","abstract":[{"lang":"eng","text":"In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (based on Shannon entropy)have been introduced to enable more fine-grained reasoning about programs in situations where limited information flow is acceptable. The QIF bounding problem asks whether the information flow in a given program is bounded by a constant $d$. Our first result is that the QIF bounding problem is PSPACE-complete. The QIF memoryless synthesis problem asks whether it is possible to resolve nondeterministic choices in a given partial program in such a way that in the resulting deterministic program, the quantitative information flow is bounded by a given constant $d$. Our second result is that the QIF memoryless synthesis problem is also EXPTIME-complete. The QIF memoryless synthesis problem generalizes to QIF general synthesis problem which does not impose the memoryless requirement (that is, by allowing the synthesized program to have more variables then the original partial program). Our third result is that the QIF general synthesis problem is EXPTIME-hard."}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:46:10Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2021-01-12T07:42:56Z","ddc":["000","005"],"type":"conference","conference":{"name":"CSF: Computer Security Foundations","start_date":"2011-06-27","location":"Cernay-la-Ville, France","end_date":"2011-06-29"},"status":"public","pubrep_id":"81","_id":"3361"}]