[{"department":[{"_id":"KrCh"}],"month":"09","day":"28","intvolume":"      6907","arxiv":1,"citation":{"ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.","ama":"Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. Vol. 6907, Springer, 2011, pp. 206–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>","short":"K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.","ieee":"K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218."},"conference":{"end_date":"2011-08-26","location":"Warsaw, Poland","start_date":"2011-08-22","name":"MFCS: Mathematical Foundations of Computer Science"},"scopus_import":1,"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"arxiv":["1104.2909"]},"_id":"3345","date_created":"2018-12-11T12:02:48Z","volume":6907,"date_updated":"2023-02-23T12:23:59Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Energy and mean-payoff parity Markov Decision Processes","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2909"}],"doi":"10.1007/978-3-642-22993-0_21","abstract":[{"text":"We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives. In system design, the parity objective is used to encode ω-regular specifications, and the mean-payoff and energy objectives can be used to model quantitative resource constraints. The energy condition re- quires that the resource level never drops below 0, and the mean-payoff condi- tion requires that the limit-average value of the resource consumption is within a threshold. While these two (energy and mean-payoff) classical conditions are equivalent for two-player games, we show that they differ for MDPs. We show that the problem of deciding whether a state is almost-sure winning (i.e., winning with probability 1) in energy parity MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound.","lang":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5387"}]},"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"status":"public","oa_version":"Preprint","publist_id":"3276","oa":1,"publication_status":"published","year":"2011","date_published":"2011-09-28T00:00:00Z","publisher":"Springer","quality_controlled":"1","page":"206 - 218"},{"scopus_import":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1109/LICS.2011.10","conference":{"location":"Toronto, Canada","start_date":"2011-06-21","name":"LICS: Logic in Computer Science","end_date":"2011-06-24"},"citation":{"apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.10\">https://doi.org/10.1109/LICS.2011.10</a>","mla":"Brázdil, Tomáš, et al. <i>Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes</i>. 5970225, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.10\">10.1109/LICS.2011.10</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.10\">https://doi.org/10.1109/LICS.2011.10</a>.","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.10\">10.1109/LICS.2011.10</a>","ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011."},"abstract":[{"lang":"eng","text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k reward functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the single-objective case, both randomization and memory are necessary for strategies, and that finite-memory randomized strategies are sufficient. Under the satisfaction objective, in contrast to the single-objective case, infinite memory is necessary for strategies, and that randomized memoryless strategies are sufficient for epsilon-approximation, for all epsilon&gt;;0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be epsilon-approximated in time polynomial in the size of the MDP and 1/epsilon, and exponential in the number of reward functions, for all epsilon&gt;;0. Our results also reveal flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, correct the flaws and obtain improved results."}],"month":"06","department":[{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3489"}],"title":"Two views on multiple mean payoff objectives in Markov Decision Processes","type":"conference","day":"21","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2011-06-21T00:00:00Z","year":"2011","publication_status":"published","date_updated":"2021-01-12T07:42:49Z","quality_controlled":"1","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"first_name":"Václav","last_name":"Brožek","full_name":"Brožek, Václav"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"}],"publisher":"IEEE","date_created":"2018-12-11T12:02:48Z","language":[{"iso":"eng"}],"article_number":"5970225","_id":"3346","ec_funded":1,"oa":1,"publist_id":"3275","oa_version":"Submitted Version","status":"public"},{"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël","last_name":"Fijalkow","id":"A1B5DD72-E997-11E9-8398-E808B6C6ADC0"}],"date_updated":"2021-01-12T07:42:50Z","volume":6638,"_id":"3347","date_created":"2018-12-11T12:02:48Z","external_id":{"arxiv":["1101.1727"]},"citation":{"ista":"Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.","ama":"Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">10.1007/978-3-642-21254-3_16</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">https://doi.org/10.1007/978-3-642-21254-3_16</a>.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Finitary Languages</i>. Vol. 6638, Springer, 2011, pp. 216–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">10.1007/978-3-642-21254-3_16</a>.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">https://doi.org/10.1007/978-3-642-21254-3_16</a>","short":"K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.","ieee":"K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226."},"conference":{"end_date":"2011-05-31","location":"Tarragona, Spain","start_date":"2011-05-26","name":"LATA: Language and Automata Theory and Applications"},"scopus_import":1,"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"day":"16","intvolume":"      6638","arxiv":1,"department":[{"_id":"KrCh"}],"month":"06","publisher":"Springer","quality_controlled":"1","page":"216 - 226","publication_status":"published","year":"2011","date_published":"2011-06-16T00:00:00Z","status":"public","oa_version":"Preprint","oa":1,"publist_id":"3274","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The class of omega-regular languages provides a robust specification language in verification. Every omega-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens &quot;eventually&quot;. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness. It requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider automata with finitary acceptance conditions defined by finitary Buchi, parity and Streett languages. We study languages expressible by such automata: we give their topological complexity and present a regular-expression characterization. We compare the expressive power of finitary automata and give optimal algorithms for classical decisions questions. We show that the finitary languages are Sigma 2-complete; we present a complete picture of the expressive power of various classes of automata with finitary and infinitary acceptance conditions; we show that the languages defined by finitary parity automata exactly characterize the star-free fragment of omega B-regular languages; and we show that emptiness is NLOGSPACE-complete and universality as well as language inclusion are PSPACE-complete for finitary parity and Streett automata."}],"doi":"10.1007/978-3-642-21254-3_16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","title":"Finitary languages","main_file_link":[{"url":"http://arxiv.org/abs/1101.1727","open_access":"1"}]},{"citation":{"ieee":"K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.","ista":"Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. <a href=\"https://doi.org/10.1145/1967701.1967734\">https://doi.org/10.1145/1967701.1967734</a>.","ama":"Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:<a href=\"https://doi.org/10.1145/1967701.1967734\">10.1145/1967701.1967734</a>","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. <i>Synthesis of Memory Efficient Real Time Controllers for Safety Objectives</i>. Springer, 2011, pp. 221–30, doi:<a href=\"https://doi.org/10.1145/1967701.1967734\">10.1145/1967701.1967734</a>.","apa":"Chatterjee, K., &#38; Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. <a href=\"https://doi.org/10.1145/1967701.1967734\">https://doi.org/10.1145/1967701.1967734</a>","short":"K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230."},"conference":{"end_date":"2011-04-14","start_date":"2011-04-12","name":"HSCC: Hybrid Systems - Computation and Control","location":"Chicago, USA"},"doi":"10.1145/1967701.1967734","scopus_import":1,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"}],"abstract":[{"lang":"eng","text":"We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two-player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a linear (in the number of clocks) number of memory bits. Precisely, we show that for safety objectives, a memory of size (3 · |C|+lg(|C|+1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential bound. We also settle the open question of whether winning region controller strategies require memory for safety objectives by showing with an example the necessity of memory for region strategies to win for safety objectives."}],"month":"01","department":[{"_id":"KrCh"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","day":"31","title":"Synthesis of memory efficient real time controllers for safety objectives","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1101.5842"}],"date_updated":"2021-01-12T07:42:50Z","publication_status":"published","year":"2011","date_published":"2011-01-31T00:00:00Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak"}],"publisher":"Springer","quality_controlled":"1","page":"221 - 230","_id":"3348","date_created":"2018-12-11T12:02:49Z","language":[{"iso":"eng"}],"status":"public","oa_version":"Submitted Version","publist_id":"3273","oa":1},{"scopus_import":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"doi":"10.4204/EPTCS.54.6","conference":{"location":"Minori, Italy","start_date":"2011-06-15","name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2011-06-17"},"citation":{"apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>","short":"K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>A Reduction from Parity Games to Simple Stochastic Games</i>. Vol. 54, EPTCS, 2011, pp. 74–86, doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>.","ama":"Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games. In: Vol 54. EPTCS; 2011:74-86. doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>","ista":"Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.","ieee":"K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86."},"abstract":[{"text":"Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions. In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena.","lang":"eng"}],"department":[{"_id":"KrCh"}],"month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1106.1232"}],"intvolume":"        54","title":"A reduction from parity games to simple stochastic games","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"04","date_published":"2011-06-04T00:00:00Z","publication_status":"published","year":"2011","date_updated":"2021-01-12T07:42:51Z","page":"74 - 86","publisher":"EPTCS","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow","first_name":"Nathanaël"}],"date_created":"2018-12-11T12:02:49Z","language":[{"iso":"eng"}],"alternative_title":["EPTCS"],"_id":"3349","volume":54,"publist_id":"3272","oa":1,"oa_version":"Submitted Version","status":"public"},{"volume":23,"issue":"12","publist_id":"7492","oa_version":"None","extern":"1","status":"public","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:45:53Z","_id":"335","article_processing_charge":"No","page":"3095 - 3104","quality_controlled":"1","article_type":"original","publisher":"American Chemical Society","author":[{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"},{"first_name":"Jiandong","last_name":"Fan","full_name":"Fan, Jiandong"},{"full_name":"Li, Wenhua","last_name":"Li","first_name":"Wenhua"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"last_name":"Nafria","first_name":"Raquel","full_name":"Nafria, Raquel"},{"first_name":"Alex","last_name":"Carrete","full_name":"Carrete, Alex"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"date_published":"2011-05-24T00:00:00Z","publication_status":"published","year":"2011","date_updated":"2021-01-12T07:42:51Z","intvolume":"        23","title":"Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect","day":"24","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","month":"05","publication":"Chemistry of Materials","abstract":[{"lang":"eng","text":"Recently reported synthetic routes for the production of hollow nanoparticles have stimulated significant interest for the possibilities this novel geometry offers. While advantageous properties have been found and innovative applications have been proposed, the development of the full potential of these new nanostructures is still strongly tied to the extent of control that can be accomplished over their characteristics (e.g., composition, size, shell thickness, and nanocrystalline structure). In the present work, we investigate the means and limits of control over these parameters that can be obtained by the Kirkendall effect synthetic route on cadmium chalcogenide nanocrystalline shells. We demonstrate that the selection of the reactants and oxidation conditions allows some extent of control of the nanocrystalline structure and thickness of the shell. However, the tuning range is limited by the intrinsic restrictions of the synthetic procedure and by the dependence of the particle geometry on the same reaction conditions. Thus, we further explore the range of control over the shell parameters that can be accomplished through post-synthesis processes, such as chemical etching and thermal annealing. "}],"doi":"10.1021/cm2006633","citation":{"ieee":"M. Ibáñez <i>et al.</i>, “Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect,” <i>Chemistry of Materials</i>, vol. 23, no. 12. American Chemical Society, pp. 3095–3104, 2011.","short":"M. Ibáñez, J. Fan, W. Li, D. Cadavid, R. Nafria, A. Carrete, A. Cabot, Chemistry of Materials 23 (2011) 3095–3104.","mla":"Ibáñez, Maria, et al. “Means and Limits of Control of the Shell Parameters in Hollow Nanoparticles Obtained by the Kirkendall Effect.” <i>Chemistry of Materials</i>, vol. 23, no. 12, American Chemical Society, 2011, pp. 3095–104, doi:<a href=\"https://doi.org/10.1021/cm2006633\">10.1021/cm2006633</a>.","apa":"Ibáñez, M., Fan, J., Li, W., Cadavid, D., Nafria, R., Carrete, A., &#38; Cabot, A. (2011). Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. <i>Chemistry of Materials</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/cm2006633\">https://doi.org/10.1021/cm2006633</a>","ista":"Ibáñez M, Fan J, Li W, Cadavid D, Nafria R, Carrete A, Cabot A. 2011. Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. Chemistry of Materials. 23(12), 3095–3104.","ama":"Ibáñez M, Fan J, Li W, et al. Means and limits of control of the shell parameters in hollow nanoparticles obtained by the Kirkendall effect. <i>Chemistry of Materials</i>. 2011;23(12):3095-3104. doi:<a href=\"https://doi.org/10.1021/cm2006633\">10.1021/cm2006633</a>","chicago":"Ibáñez, Maria, Jiandong Fan, Wenhua Li, Doris Cadavid, Raquel Nafria, Alex Carrete, and Andreu Cabot. “Means and Limits of Control of the Shell Parameters in Hollow Nanoparticles Obtained by the Kirkendall Effect.” <i>Chemistry of Materials</i>. American Chemical Society, 2011. <a href=\"https://doi.org/10.1021/cm2006633\">https://doi.org/10.1021/cm2006633</a>."}},{"date_updated":"2021-01-12T07:42:51Z","year":"2011","publication_status":"published","date_published":"2011-01-01T00:00:00Z","publisher":"Springer","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"}],"quality_controlled":"1","page":"145 - 159","_id":"3350","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:49Z","status":"public","oa_version":"None","publist_id":"3271","volume":6919,"citation":{"ieee":"K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.","ama":"Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">10.1007/978-3-642-24310-3_11</a>","ista":"Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">https://doi.org/10.1007/978-3-642-24310-3_11</a>.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Minimum Attention Controller Synthesis for Omega Regular Objectives</i>. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">10.1007/978-3-642-24310-3_11</a>.","short":"K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.","apa":"Chatterjee, K., &#38; Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg &#38; S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">https://doi.org/10.1007/978-3-642-24310-3_11</a>"},"editor":[{"full_name":"Fahrenberg, Uli","last_name":"Fahrenberg","first_name":"Uli"},{"full_name":"Tripakis, Stavros","last_name":"Tripakis","first_name":"Stavros"}],"conference":{"location":"Aalborg, Denmark","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2011-09-21","end_date":"2011-09-23"},"doi":"10.1007/978-3-642-24310-3_11","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"scopus_import":1,"abstract":[{"lang":"eng","text":"A controller for a discrete game with ω-regular objectives requires attention if, intuitively, it requires measuring the state and switching from the current control action. Minimum attention controllers are preferable in modern shared implementations of cyber-physical systems because they produce the least burden on system resources such as processor time or communication bandwidth. We give algorithms to compute minimum attention controllers for ω-regular objectives in imperfect information discrete two-player games. We show a polynomial-time reduction from minimum attention controller synthesis to synthesis of controllers for mean-payoff parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete synthesis algorithm. We show that the minimum attention controller problem is decidable for infinite state systems with finite bisimulation quotients. In particular, the problem is decidable for timed and rectangular automata."}],"department":[{"_id":"KrCh"}],"month":"01","type":"conference","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":"      6919","title":"Minimum attention controller synthesis for omega regular objectives"},{"publist_id":"3270","oa":1,"oa_version":"Submitted Version","status":"public","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"page":"148 - 159","quality_controlled":"1","publisher":"Springer","date_published":"2011-04-16T00:00:00Z","publication_status":"published","year":"2011","main_file_link":[{"url":"http://arxiv.org/abs/1104.3211","open_access":"1"}],"title":"On memoryless quantitative objectives","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and the discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions."}],"doi":"10.1007/978-3-642-22953-4_13","volume":6914,"date_created":"2018-12-11T12:02:50Z","_id":"3351","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"date_updated":"2021-01-12T07:42:52Z","intvolume":"      6914","day":"16","month":"04","department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"scopus_import":1,"conference":{"end_date":"2011-08-25","location":"Oslo, Norway","name":"FCT: Fundamentals of Computation Theory","start_date":"2011-08-22"},"editor":[{"first_name":"Olaf","last_name":"Owe","full_name":"Owe, Olaf"},{"full_name":"Steffen, Martin","last_name":"Steffen","first_name":"Martin"},{"full_name":"Telle, Jan Arne","last_name":"Telle","first_name":"Jan Arne"}],"citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">https://doi.org/10.1007/978-3-642-22953-4_13</a>.","ista":"Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.","ama":"Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>","short":"K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.","apa":"Chatterjee, K., Doyen, L., &#38; Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, &#38; J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">https://doi.org/10.1007/978-3-642-22953-4_13</a>","mla":"Chatterjee, Krishnendu, et al. <i>On Memoryless Quantitative Objectives</i>. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>.","ieee":"K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159."}},{"publication":"Communications of the ACM","abstract":[{"text":"Exploring the connection of biology with reactive systems to better understand living systems.","lang":"eng"}],"doi":"10.1145/2001269.2001289","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"}],"citation":{"chicago":"Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” <i>Communications of the ACM</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/2001269.2001289\">https://doi.org/10.1145/2001269.2001289</a>.","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.","ama":"Fisher J, Harel D, Henzinger TA. Biology as reactivity. <i>Communications of the ACM</i>. 2011;54(10):72-82. doi:<a href=\"https://doi.org/10.1145/2001269.2001289\">10.1145/2001269.2001289</a>","mla":"Fisher, Jasmin, et al. “Biology as Reactivity.” <i>Communications of the ACM</i>, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:<a href=\"https://doi.org/10.1145/2001269.2001289\">10.1145/2001269.2001289</a>.","short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.","apa":"Fisher, J., Harel, D., &#38; Henzinger, T. A. (2011). Biology as reactivity. <i>Communications of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2001269.2001289\">https://doi.org/10.1145/2001269.2001289</a>","ieee":"J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” <i>Communications of the ACM</i>, vol. 54, no. 10. ACM, pp. 72–82, 2011."},"day":"01","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Biology as reactivity","intvolume":"        54","month":"10","department":[{"_id":"ToHe"}],"page":"72 - 82","publisher":"ACM","author":[{"last_name":"Fisher","first_name":"Jasmin","full_name":"Fisher, Jasmin"},{"full_name":"Harel, David","first_name":"David","last_name":"Harel"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"quality_controlled":"1","date_published":"2011-10-01T00:00:00Z","date_updated":"2021-01-12T07:42:52Z","publication_status":"published","year":"2011","publist_id":"3267","issue":"10","volume":54,"status":"public","oa_version":"None","_id":"3352","ec_funded":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:50Z"},{"ddc":["000","005"],"file":[{"creator":"system","access_level":"open_access","content_type":"application/pdf","checksum":"5d44a8aa81e33210649beae507602138","relation":"main_file","date_created":"2018-12-12T10:16:45Z","file_size":775662,"file_id":"5235","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","date_updated":"2020-07-14T12:46:09Z"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","title":"A theory of synchronous relational interfaces","doi":"10.1145/1985342.1985345","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."}],"publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","article_number":"14","ec_funded":1,"language":[{"iso":"eng"}],"status":"public","oa_version":"Submitted Version","oa":1,"publist_id":"3263","has_accepted_license":"1","year":"2011","publication_status":"published","date_published":"2011-07-01T00:00:00Z","publisher":"ACM","quality_controlled":"1","department":[{"_id":"ToHe"}],"month":"07","day":"01","intvolume":"        33","citation":{"short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>, vol. 33, no. 4, 14, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. ACM. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>","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.","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. 2011;33(4). doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>.","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>, vol. 33, no. 4. ACM, 2011."},"pubrep_id":"85","scopus_import":1,"project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"}],"_id":"3353","date_created":"2018-12-11T12:02:51Z","issue":"4","file_date_updated":"2020-07-14T12:46:09Z","volume":33,"date_updated":"2021-01-12T07:42:52Z","author":[{"last_name":"Tripakis","first_name":"Stavros","full_name":"Tripakis, Stavros"},{"full_name":"Lickly, Ben","first_name":"Ben","last_name":"Lickly"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Lee","first_name":"Edward","full_name":"Lee, Edward"}]},{"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."}],"publication":"ACM Transactions on Computational Logic (TOCL)","citation":{"ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 12, no. 4. ACM, 2011.","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.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2011;12(4). doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>.","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011)."},"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"scopus_import":1,"doi":"10.1145/1970398.1970404","intvolume":"        12","title":"Qualitative concurrent parity games","day":"04","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"07","quality_controlled":"1","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"publisher":"ACM","year":"2011","publication_status":"published","date_updated":"2023-02-23T10:26:18Z","date_published":"2011-07-04T00:00:00Z","oa_version":"None","status":"public","volume":12,"issue":"4","publist_id":"3262","related_material":{"record":[{"status":"public","id":"2054","relation":"later_version"}]},"date_created":"2018-12-11T12:02:51Z","language":[{"iso":"eng"}],"article_number":"28","_id":"3354"},{"publication_status":"published","year":"2011","date_published":"2011-10-13T00:00:00Z","publisher":"IEEE","quality_controlled":"1","page":"255 - 264","language":[{"iso":"eng"}],"status":"public","oa_version":"Submitted Version","oa":1,"publist_id":"3260","has_accepted_license":"1","doi":"10.1109/QEST.2011.40","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."}],"file":[{"file_id":"4648","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf","date_updated":"2020-07-14T12:46:09Z","file_size":272017,"date_created":"2018-12-12T10:07:49Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system","checksum":"4dc8750ab7921f51de992000b13d1b01"}],"ddc":["000","004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","title":"Quantitative evaluation of BFT protocols","date_updated":"2021-01-12T07:42:53Z","author":[{"last_name":"Halalai","id":"584C6850-E996-11E9-805B-F01764644770","first_name":"Raluca","full_name":"Halalai, Raluca"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"}],"_id":"3355","date_created":"2018-12-11T12:02:51Z","file_date_updated":"2020-07-14T12:46:09Z","citation":{"mla":"Halalai, Raluca, et al. <i>Quantitative Evaluation of BFT Protocols</i>. IEEE, 2011, pp. 255–64, doi:<a href=\"https://doi.org/10.1109/QEST.2011.40\">10.1109/QEST.2011.40</a>.","apa":"Halalai, R., Henzinger, T. A., &#38; Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/QEST.2011.40\">https://doi.org/10.1109/QEST.2011.40</a>","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.","chicago":"Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. <a href=\"https://doi.org/10.1109/QEST.2011.40\">https://doi.org/10.1109/QEST.2011.40</a>.","ama":"Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:<a href=\"https://doi.org/10.1109/QEST.2011.40\">10.1109/QEST.2011.40</a>","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."},"pubrep_id":"84","conference":{"location":"Aachen, Germany","name":"QEST: Quantitative Evaluation of Systems","start_date":"2011-09-05","end_date":"2011-09-08"},"scopus_import":1,"month":"10","department":[{"_id":"ToHe"}],"day":"13"},{"author":[{"full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"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":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"date_updated":"2023-02-23T12:23:54Z","file_date_updated":"2020-07-14T12:46:09Z","_id":"3356","date_created":"2018-12-11T12:02:52Z","conference":{"location":"Toronto, Canada","name":"LICS: Logic in Computer Science","start_date":"2011-06-21","end_date":"2011-06-24"},"scopus_import":1,"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. 5970226, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>","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."},"pubrep_id":"83","day":"21","month":"06","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IEEE","date_published":"2011-06-21T00:00:00Z","year":"2011","publication_status":"published","oa":1,"publist_id":"3259","has_accepted_license":"1","status":"public","oa_version":"Submitted Version","ec_funded":1,"article_number":"5970226","related_material":{"record":[{"relation":"later_version","status":"public","id":"2038"},{"id":"5385","status":"public","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"doi":"10.1109/LICS.2011.33","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Temporal specifications with accumulative values","file":[{"checksum":"792128f5455f0f40f1105f0398e05fa9","access_level":"open_access","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:12:42Z","relation":"main_file","file_size":225426,"file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","date_updated":"2020-07-14T12:46:09Z","file_id":"4960"}],"ddc":["000","004"]},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","day":"01","title":"The complexity of request-response games","intvolume":"      6638","doi":"10.1007/978-3-642-21254-3_17","conference":{"end_date":"2011-05-31","location":"Tarragona, Spain","start_date":"2011-05-26","name":"LATA: Language and Automata Theory and Applications"},"scopus_import":1,"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.","ama":"Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>","ista":"Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &#38; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Request-Response Games</i>. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>."},"editor":[{"full_name":"Dediu, Adrian-Horia","first_name":"Adrian-Horia","last_name":"Dediu"},{"full_name":"Inenaga, Shunsuke","last_name":"Inenaga","first_name":"Shunsuke"},{"full_name":"Martín-Vide, Carlos","first_name":"Carlos","last_name":"Martín-Vide"}],"abstract":[{"lang":"eng","text":"We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form \"if a state with property Rq is visited, then later a state with property Rp is visited\". The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that this problem is, in fact, EXPTIME-complete. We show that the problem becomes PSPACE-complete if we only consider games played on DAGs, and NP-complete or PTIME-complete if there is only one player (depending on whether he wants to enforce or spoil the request-response condition). We also present near-optimal bounds on the memory needed to design winning strategies for each player, in each case."}],"_id":"3357","date_created":"2018-12-11T12:02:52Z","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"publist_id":"3258","volume":6638,"status":"public","oa_version":"None","date_published":"2011-01-01T00:00:00Z","date_updated":"2021-01-12T07:42:54Z","year":"2011","publication_status":"published","page":"227 - 237","publisher":"Springer","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian","full_name":"Horn, Florian"}],"quality_controlled":"1"},{"year":"2011","publication_status":"published","date_updated":"2021-01-12T07:42:55Z","date_published":"2011-04-10T00:00:00Z","quality_controlled":"1","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singh, Vasu","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"},{"first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","full_name":"Wies, Thomas"},{"first_name":"Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien"}],"publisher":"ACM","page":"329 - 342","article_processing_charge":"No","date_created":"2018-12-11T12:02:53Z","language":[{"iso":"eng"}],"_id":"3358","oa_version":"Published Version","status":"public","publist_id":"3257","oa":1,"citation":{"short":"T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.","mla":"Henzinger, Thomas A., et al. <i>Scheduling Large Jobs by Abstraction Refinement</i>. ACM, 2011, pp. 329–42, doi:<a href=\"https://doi.org/10.1145/1966445.1966476\">10.1145/1966445.1966476</a>.","apa":"Henzinger, T. A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM. <a href=\"https://doi.org/10.1145/1966445.1966476\">https://doi.org/10.1145/1966445.1966476</a>","ista":"Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.","ama":"Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:<a href=\"https://doi.org/10.1145/1966445.1966476\">10.1145/1966445.1966476</a>","chicago":"Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. <a href=\"https://doi.org/10.1145/1966445.1966476\">https://doi.org/10.1145/1966445.1966476</a>.","ieee":"T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342."},"scopus_import":1,"doi":"10.1145/1966445.1966476","conference":{"start_date":"2011-04-10","name":"EuroSys","location":"Salzburg, Austria","end_date":"2011-04-13"},"abstract":[{"lang":"eng","text":"The static scheduling problem often arises as a fundamental problem in real-time systems and grid computing. We consider the problem of statically scheduling a large job expressed as a task graph on a large number of computing nodes, such as a data center. This paper solves the large-scale static scheduling problem using abstraction refinement, a technique commonly used in formal verification to efficiently solve computationally hard problems. A scheduler based on abstraction refinement first attempts to solve the scheduling problem with abstract representations of the job and the computing resources. As abstract representations are generally small, the scheduling can be done reasonably fast. If the obtained schedule does not meet specified quality conditions (like data center utilization or schedule makespan) then the scheduler refines the job and data center abstractions and, again solves the scheduling problem. We develop different schedulers based on abstraction refinement. We implemented these schedulers and used them to schedule task graphs from various computing domains on simulated data centers with realistic topologies. We compared the speed of scheduling and the quality of the produced schedules with our abstraction refinement schedulers against a baseline scheduler that does not use any abstraction. We conclude that abstraction refinement techniques give a significant speed-up compared to traditional static scheduling heuristics, at a reasonable cost in the quality of the produced schedules. We further used our static schedulers in an actual system that we deployed on Amazon EC2 and compared it against the Hadoop dynamic scheduler for large MapReduce jobs. Our experiments indicate that there is great potential for static scheduling techniques."}],"month":"04","department":[{"_id":"ToHe"}],"title":"Scheduling large jobs by abstraction refinement","day":"10","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf","open_access":"1"}]},{"department":[{"_id":"ToHe"}],"month":"10","title":"From boolean to quantitative synthesis","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"09","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"conference":{"name":"EMSOFT: Embedded Software ","start_date":"2011-10-09","location":"Taipei; Taiwan","end_date":"2011-10-14"},"doi":"10.1145/2038642.2038666","citation":{"ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.","ista":"Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.","chicago":"Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>.","ama":"Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>","short":"P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.","apa":"Cerny, P., &#38; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>","mla":"Cerny, Pavol, and Thomas A. Henzinger. <i>From Boolean to Quantitative Synthesis</i>. ACM, 2011, pp. 149–54, doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>."},"abstract":[{"text":"Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective approach for increasing programmer productivity. The goal of the approach is to allow the programmer to specify a part of her intent imperatively (that is, give a partial program) and a part of her intent declaratively, by specifying which conditions need to be achieved or maintained. The task of the synthesizer is to construct a program that satisfies the specification. As an example, consider a partial program where threads access shared data without using any synchronization mechanism, and a declarative specification that excludes data races and deadlocks. The task of the synthesizer is then to place locks into the program code in order for the program to meet the specification.\r\n\r\nIn this paper, we argue that quantitative objectives are needed in partial-program synthesis in order to produce higher-quality programs, while enabling simpler specifications. Returning to the example, the synthesizer could construct a naive solution that uses one global lock for shared data. This can be prevented either by constraining the solution space further (which is error-prone and partly defeats the point of synthesis), or by optimizing a quantitative objective that models performance. Other quantitative notions useful in synthesis include fault tolerance, robustness, resource (memory, power) consumption, and information flow.","lang":"eng"}],"date_created":"2018-12-11T12:02:53Z","language":[{"iso":"eng"}],"ec_funded":1,"_id":"3359","acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.","publist_id":"3256","oa_version":"None","status":"public","date_published":"2011-10-09T00:00:00Z","publication_status":"published","year":"2011","date_updated":"2021-01-12T07:42:55Z","page":"149 - 154","quality_controlled":"1","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publisher":"ACM"},{"article_processing_charge":"No","date_created":"2018-12-11T11:45:53Z","language":[{"iso":"eng"}],"_id":"336","oa_version":"None","extern":"1","status":"public","volume":115,"acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, and ENE2008-03277-E/CON. Maria Ibáñez thanks the Ph.D. grant from the Spanish MICINN.","publist_id":"7493","issue":"16","publication_status":"published","year":"2011","date_updated":"2021-01-12T07:42:56Z","date_published":"2011-04-28T00:00:00Z","quality_controlled":"1","publisher":"American Chemical Society","author":[{"first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"first_name":"Pablo","last_name":"Guardia","full_name":"Guardia, Pablo"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"full_name":"Morante, Joan","last_name":"Morante","first_name":"Joan"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"article_type":"original","page":"7947 - 7955","month":"04","intvolume":"       115","title":"Growth kinetics of asymmetric Bi2S3 nanocrystals: Size distribution focusing in nanorods","day":"28","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ibáñez M, Guardia P, Shavel A, Cadavid D, Arbiol J, Morante J, Cabot A. 2011. Growth kinetics of asymmetric Bi2S3 nanocrystals: Size distribution focusing in nanorods. Journal of Physical Chemistry C. 115(16), 7947–7955.","chicago":"Ibáñez, Maria, Pablo Guardia, Alexey Shavel, Doris Cadavid, Jordi Arbiol, Joan Morante, and Andreu Cabot. “Growth Kinetics of Asymmetric Bi2S3 Nanocrystals: Size Distribution Focusing in Nanorods.” <i>Journal of Physical Chemistry C</i>. American Chemical Society, 2011. <a href=\"https://doi.org/10.1021/jp2002904\">https://doi.org/10.1021/jp2002904</a>.","ama":"Ibáñez M, Guardia P, Shavel A, et al. Growth kinetics of asymmetric Bi2S3 nanocrystals: Size distribution focusing in nanorods. <i>Journal of Physical Chemistry C</i>. 2011;115(16):7947-7955. doi:<a href=\"https://doi.org/10.1021/jp2002904\">10.1021/jp2002904</a>","short":"M. Ibáñez, P. Guardia, A. Shavel, D. Cadavid, J. Arbiol, J. Morante, A. Cabot, Journal of Physical Chemistry C 115 (2011) 7947–7955.","apa":"Ibáñez, M., Guardia, P., Shavel, A., Cadavid, D., Arbiol, J., Morante, J., &#38; Cabot, A. (2011). Growth kinetics of asymmetric Bi2S3 nanocrystals: Size distribution focusing in nanorods. <i>Journal of Physical Chemistry C</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jp2002904\">https://doi.org/10.1021/jp2002904</a>","mla":"Ibáñez, Maria, et al. “Growth Kinetics of Asymmetric Bi2S3 Nanocrystals: Size Distribution Focusing in Nanorods.” <i>Journal of Physical Chemistry C</i>, vol. 115, no. 16, American Chemical Society, 2011, pp. 7947–55, doi:<a href=\"https://doi.org/10.1021/jp2002904\">10.1021/jp2002904</a>.","ieee":"M. Ibáñez <i>et al.</i>, “Growth kinetics of asymmetric Bi2S3 nanocrystals: Size distribution focusing in nanorods,” <i>Journal of Physical Chemistry C</i>, vol. 115, no. 16. American Chemical Society, pp. 7947–7955, 2011."},"doi":"10.1021/jp2002904","abstract":[{"lang":"eng","text":"The growth kinetics of colloidal Bi2S3 nanorods was investigated. After nucleation, the length distribution of the growing Bi 2S3 nanorods narrows with the reaction time until a bimodal length distribution appears. From this critical reaction time on, the smallest nanorods of the ensemble dissolve, feeding with monomer the growth of the largest ones. A comprehensive characterization of the size-distribution evolution of Bi2S3 nanorods is used here to illustrate the dependences of the anisotropic growth rates of cylindrical nanoparticles on the nanoparticle dimensions and the monomer concentration in solution. With this goal in mind, a diffusion-reaction model is presented to explain the origin of the experimentally obtained length distribution focusing mechanism. The model is able to reproduce the decrease of the growth rate in the nanorod axial direction with both its thickness and length. On the other hand, low lateral reaction rates prevent the nanorod thickness distribution to be focused. In both crystallographic growth directions, a concentration-dependent critical thickness exists, which discriminates between nanorods with positive growth rates and those dissolving in the reaction solution. "}],"publication":"Journal of Physical Chemistry C"},{"doi":"10.4230/LIPIcs.CSL.2011.82","abstract":[{"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 &lt; lambda &lt; 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. ","lang":"eng"}],"file":[{"checksum":"250603c6be8ccad4fbd4d7b24221f0ee","access_level":"open_access","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:10:17Z","relation":"main_file","file_size":504270,"date_updated":"2020-07-14T12:46:10Z","file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","file_id":"4803"}],"ddc":["004"],"title":"Determinizing discounted-sum automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","year":"2011","publication_status":"published","date_published":"2011-08-31T00:00:00Z","quality_controlled":"1","publisher":"Springer","page":"82 - 96","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"ec_funded":1,"oa_version":"Published Version","status":"public","has_accepted_license":"1","publist_id":"3255","oa":1,"pubrep_id":"82","citation":{"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.","mla":"Boker, Udi, and Thomas A. Henzinger. <i>Determinizing Discounted-Sum Automata</i>. Vol. 12, Springer, 2011, pp. 82–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","apa":"Boker, U., &#38; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>","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. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>.","ama":"Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>"},"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"scopus_import":1,"conference":{"location":"Bergen, Norway","start_date":"2011-09-12","name":"CSL: Computer Science Logic","end_date":"2011-09-15"},"department":[{"_id":"ToHe"}],"month":"08","intvolume":"        12","day":"31","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_updated":"2021-01-12T07:42:56Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","author":[{"first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"date_created":"2018-12-11T12:02:53Z","_id":"3360","volume":12,"file_date_updated":"2020-07-14T12:46:10Z"},{"project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"scopus_import":1,"conference":{"end_date":"2011-06-29","name":"CSF: Computer Security Foundations","start_date":"2011-06-27","location":"Cernay-la-Ville, France"},"pubrep_id":"81","citation":{"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.","mla":"Cerny, Pavol, et al. <i>The Complexity of Quantitative Information Flow Problems</i>. IEEE, 2011, pp. 205–17, doi:<a href=\"https://doi.org/10.1109/CSF.2011.21\">10.1109/CSF.2011.21</a>.","apa":"Cerny, P., Chatterjee, K., &#38; 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. <a href=\"https://doi.org/10.1109/CSF.2011.21\">https://doi.org/10.1109/CSF.2011.21</a>","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. <a href=\"https://doi.org/10.1109/CSF.2011.21\">https://doi.org/10.1109/CSF.2011.21</a>.","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.","ama":"Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:<a href=\"https://doi.org/10.1109/CSF.2011.21\">10.1109/CSF.2011.21</a>"},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"month":"06","day":"27","date_updated":"2021-01-12T07:42:56Z","author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"date_created":"2018-12-11T12:02:54Z","_id":"3361","file_date_updated":"2020-07-14T12:46:10Z","doi":"10.1109/CSF.2011.21","abstract":[{"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.","lang":"eng"}],"file":[{"relation":"main_file","date_created":"2018-12-12T10:10:07Z","checksum":"1a25be0c62459fc7640db88af08ff63a","access_level":"open_access","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:10Z","file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf","file_id":"4792","file_size":299069}],"ddc":["000","005"],"title":"The complexity of quantitative information flow problems","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","date_published":"2011-06-27T00:00:00Z","year":"2011","publication_status":"published","page":"205 - 217","quality_controlled":"1","publisher":"IEEE","language":[{"iso":"eng"}],"ec_funded":1,"has_accepted_license":"1","publist_id":"3254","oa":1,"oa_version":"Submitted Version","status":"public"},{"date_updated":"2021-01-12T07:42:57Z","author":[{"full_name":"Fisher, Jasmin","last_name":"Fisher","first_name":"Jasmin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"},{"full_name":"Singh, Anmol","last_name":"Singh","first_name":"Anmol"},{"full_name":"Vardi, Moshe","last_name":"Vardi","first_name":"Moshe"}],"date_created":"2018-12-11T12:02:54Z","_id":"3362","volume":6901,"file_date_updated":"2020-07-14T12:46:10Z","scopus_import":1,"project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"}],"conference":{"start_date":"2011-09-06","name":"CONCUR: Concurrency Theory","location":"Aachen, Germany","end_date":"2011-09-09"},"citation":{"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.","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.","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. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>.","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:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>","mla":"Fisher, Jasmin, et al. <i>Dynamic Reactive Modules</i>. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>.","apa":"Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>","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."},"month":"01","department":[{"_id":"ToHe"}],"intvolume":"      6901","day":"01","date_published":"2011-01-01T00:00:00Z","publication_status":"published","year":"2011","page":"404 - 418","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"ec_funded":1,"article_processing_charge":"No","has_accepted_license":"1","publist_id":"3253","oa":1,"oa_version":"Submitted Version","status":"public","doi":"10.1007/978-3-642-23217-6_27","abstract":[{"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.","lang":"eng"}],"file":[{"file_size":337125,"file_id":"7870","file_name":"2011_CONCUR_Fisher.pdf","date_updated":"2020-07-14T12:46:10Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","checksum":"6bf2453d8e52e979ddb58d17325bad26","date_created":"2020-05-19T16:17:48Z","relation":"main_file"}],"ddc":["000"],"title":"Dynamic reactive modules","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference"}]