[{"issue":"10","citation":{"short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 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>.","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 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>","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>.","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."},"date_updated":"2025-09-30T09:06:32Z","abstract":[{"lang":"eng","text":"Exploring the connection of biology with reactive systems to better understand living systems."}],"language":[{"iso":"eng"}],"project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":54,"type":"journal_article","page":"72 - 82","day":"01","publisher":"ACM","_id":"3352","scopus_import":"1","title":"Biology as reactivity","quality_controlled":"1","external_id":{"isi":["000296022500019"]},"doi":"10.1145/2001269.2001289","oa_version":"None","publication":"Communications of the ACM","article_processing_charge":"No","ec_funded":1,"date_published":"2011-10-01T00:00:00Z","publication_status":"published","department":[{"_id":"ToHe"}],"isi":1,"date_created":"2018-12-11T12:02:50Z","author":[{"full_name":"Fisher, Jasmin","last_name":"Fisher","first_name":"Jasmin"},{"last_name":"Harel","first_name":"David","full_name":"Harel, David"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"intvolume":"        54","publist_id":"3267","year":"2011","status":"public","month":"10"},{"publisher":"ACM","day":"01","_id":"3353","has_accepted_license":"1","issue":"4","article_number":"14","citation":{"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>.","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","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>","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>","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.","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>.","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."},"abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T09:05:52Z","type":"journal_article","volume":33,"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"ec_funded":1,"date_published":"2011-07-01T00:00:00Z","pubrep_id":"85","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Tripakis, Stavros","first_name":"Stavros","last_name":"Tripakis"},{"first_name":"Ben","last_name":"Lickly","full_name":"Lickly, Ben"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Lee, Edward","first_name":"Edward","last_name":"Lee"}],"publist_id":"3263","intvolume":"        33","date_created":"2018-12-11T12:02:51Z","isi":1,"status":"public","month":"07","year":"2011","title":"A theory of synchronous relational interfaces","quality_controlled":"1","scopus_import":"1","oa_version":"Submitted Version","external_id":{"isi":["000292766400003"]},"doi":"10.1145/1985342.1985345","file_date_updated":"2020-07-14T12:46:09Z","ddc":["000","005"],"file":[{"creator":"system","content_type":"application/pdf","file_id":"5235","file_size":775662,"checksum":"5d44a8aa81e33210649beae507602138","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:09Z","date_created":"2018-12-12T10:16:45Z","relation":"main_file"}],"publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","article_processing_charge":"No"},{"article_processing_charge":"No","publication":"ACM Transactions on Computational Logic (TOCL)","doi":"10.1145/1970398.1970404","external_id":{"isi":["000296202300006"]},"oa_version":"None","quality_controlled":"1","title":"Qualitative concurrent parity games","scopus_import":"1","month":"07","status":"public","year":"2011","publist_id":"3262","intvolume":"        12","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"isi":1,"date_created":"2018-12-11T12:02:51Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","date_published":"2011-07-04T00:00:00Z","corr_author":"1","volume":12,"type":"journal_article","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"date_updated":"2025-09-30T09:05:13Z","citation":{"ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.","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>","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>.","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.","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).","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>","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>."},"article_number":"28","issue":"4","_id":"3354","related_material":{"record":[{"relation":"later_version","id":"2054","status":"public"}]},"publisher":"ACM","day":"04"},{"doi":"10.1109/QEST.2011.40","file_date_updated":"2020-07-14T12:46:09Z","oa_version":"Submitted Version","ddc":["000","004"],"file":[{"date_updated":"2020-07-14T12:46:09Z","date_created":"2018-12-12T10:07:49Z","access_level":"open_access","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf","checksum":"4dc8750ab7921f51de992000b13d1b01","file_size":272017,"content_type":"application/pdf","file_id":"4648","creator":"system","relation":"main_file"}],"title":"Quantitative evaluation of BFT protocols","quality_controlled":"1","scopus_import":1,"status":"public","month":"10","year":"2011","author":[{"last_name":"Halalai","first_name":"Raluca","id":"584C6850-E996-11E9-805B-F01764644770","full_name":"Halalai, Raluca"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu"}],"publist_id":"3260","date_created":"2018-12-11T12:02:51Z","pubrep_id":"84","department":[{"_id":"ToHe"}],"publication_status":"published","date_published":"2011-10-13T00:00:00Z","corr_author":"1","type":"conference","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"language":[{"iso":"eng"}],"date_updated":"2024-10-09T20:54:27Z","citation":{"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>.","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.","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>","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>","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","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>."},"has_accepted_license":"1","conference":{"start_date":"2011-09-05","location":"Aachen, Germany","name":"QEST: Quantitative Evaluation of Systems","end_date":"2011-09-08"},"_id":"3355","publisher":"IEEE","day":"13","page":"255 - 264"},{"article_processing_charge":"No","external_id":{"isi":["000297350400007"]},"file_date_updated":"2020-07-14T12:46:09Z","oa_version":"Submitted Version","doi":"10.1109/LICS.2011.33","ddc":["000","004"],"file":[{"relation":"main_file","access_level":"open_access","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","date_updated":"2020-07-14T12:46:09Z","date_created":"2018-12-12T10:12:42Z","file_id":"4960","creator":"system","content_type":"application/pdf","checksum":"792128f5455f0f40f1105f0398e05fa9","file_size":225426}],"title":"Temporal specifications with accumulative values","scopus_import":"1","status":"public","month":"06","year":"2011","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"publist_id":"3259","date_created":"2018-12-11T12:02:52Z","isi":1,"pubrep_id":"83","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","ec_funded":1,"date_published":"2011-06-21T00:00:00Z","type":"conference","oa":1,"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","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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"}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T09:27:30Z","citation":{"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>","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.","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.","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.","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>"},"has_accepted_license":"1","conference":{"end_date":"2011-06-24","name":"LICS: Logic in Computer Science","location":"Toronto, Canada","start_date":"2011-06-21"},"article_number":"5970226","_id":"3356","related_material":{"record":[{"relation":"earlier_version","id":"5385","status":"public"},{"status":"public","id":"2038","relation":"later_version"}]},"publisher":"IEEE","day":"21"},{"date_published":"2011-01-01T00:00:00Z","corr_author":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"editor":[{"full_name":"Dediu, Adrian-Horia","last_name":"Dediu","first_name":"Adrian-Horia"},{"first_name":"Shunsuke","last_name":"Inenaga","full_name":"Inenaga, Shunsuke"},{"full_name":"Martín-Vide, Carlos","first_name":"Carlos","last_name":"Martín-Vide"}],"publication_status":"published","page":"227 - 237","intvolume":"      6638","publist_id":"3258","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","full_name":"Horn, Florian","last_name":"Horn","first_name":"Florian"}],"day":"01","publisher":"Springer","date_created":"2018-12-11T12:02:52Z","month":"01","_id":"3357","status":"public","year":"2011","quality_controlled":"1","title":"The complexity of request-response games","alternative_title":["LNCS"],"conference":{"end_date":"2011-05-31","name":"LATA: Language and Automata Theory and Applications","location":"Tarragona, Spain","start_date":"2011-05-26"},"scopus_import":1,"oa_version":"None","citation":{"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>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, 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>","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>","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>.","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.","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."},"doi":"10.1007/978-3-642-21254-3_17","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"date_updated":"2024-10-09T20:54:27Z","type":"conference","volume":6638,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"corr_author":"1","date_published":"2011-04-10T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf"}],"publication_status":"published","page":"329 - 342","department":[{"_id":"ToHe"}],"day":"10","publisher":"ACM","date_created":"2018-12-11T12:02:53Z","publist_id":"3257","author":[{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies"},{"last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"year":"2011","month":"04","_id":"3358","status":"public","conference":{"start_date":"2011-04-10","location":"Salzburg, Austria","name":"EuroSys","end_date":"2011-04-13"},"scopus_import":1,"quality_controlled":"1","title":"Scheduling large jobs by abstraction refinement","citation":{"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>","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.","ista":"Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 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>.","short":"T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 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>"},"oa_version":"Published Version","doi":"10.1145/1966445.1966476","date_updated":"2024-10-09T20:54:26Z","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_processing_charge":"No","type":"conference"},{"citation":{"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.","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>.","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>.","ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 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>"},"oa_version":"None","doi":"10.1145/2038642.2038666","quality_controlled":"1","title":"From boolean to quantitative synthesis","conference":{"location":"Taipei; Taiwan","end_date":"2011-10-14","name":"EMSOFT: Embedded Software ","start_date":"2011-10-09"},"scopus_import":"1","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"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.","date_updated":"2024-10-21T06:03:04Z","department":[{"_id":"ToHe"}],"publication_status":"published","page":"149 - 154","date_published":"2011-10-09T00:00:00Z","ec_funded":1,"corr_author":"1","month":"10","_id":"3359","status":"public","year":"2011","publist_id":"3256","author":[{"first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"day":"09","publisher":"ACM","date_created":"2018-12-11T12:02:53Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"journal_article","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.","date_updated":"2021-01-12T07:42:56Z","language":[{"iso":"eng"}],"publication":"Journal of Physical Chemistry C","abstract":[{"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. ","lang":"eng"}],"doi":"10.1021/jp2002904","oa_version":"None","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.","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>","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>.","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.","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.","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>","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>."},"issue":"16","quality_controlled":"1","title":"Growth kinetics of asymmetric Bi2S3 nanocrystals: Size distribution focusing in nanorods","year":"2011","_id":"336","month":"04","article_type":"original","status":"public","day":"28","publisher":"American Chemical Society","date_created":"2018-12-11T11:45:53Z","intvolume":"       115","publist_id":"7493","author":[{"last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843"},{"full_name":"Guardia, Pablo","last_name":"Guardia","first_name":"Pablo"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Morante","first_name":"Joan","full_name":"Morante, Joan"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"extern":"1","publication_status":"published","page":"7947 - 7955","date_published":"2011-04-28T00:00:00Z"},{"oa_version":"Published Version","doi":"10.4230/LIPIcs.CSL.2011.82","file_date_updated":"2020-07-14T12:46:10Z","ddc":["004"],"file":[{"content_type":"application/pdf","file_id":"4803","creator":"system","file_size":504270,"checksum":"250603c6be8ccad4fbd4d7b24221f0ee","file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:10:17Z","relation":"main_file"}],"title":"Determinizing discounted-sum automata","quality_controlled":"1","scopus_import":1,"alternative_title":["LIPIcs"],"status":"public","month":"08","year":"2011","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        12","publist_id":"3255","date_created":"2018-12-11T12:02:53Z","pubrep_id":"82","department":[{"_id":"ToHe"}],"publication_status":"published","ec_funded":1,"date_published":"2011-08-31T00:00:00Z","volume":12,"type":"conference","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"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"}],"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:42:56Z","citation":{"ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 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>","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.","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>.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","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>","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>."},"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","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)"},"has_accepted_license":"1","conference":{"start_date":"2011-09-12","location":"Bergen, Norway","end_date":"2011-09-15","name":"CSL: Computer Science Logic"},"_id":"3360","publisher":"Springer","day":"31","page":"82 - 96"},{"corr_author":"1","ec_funded":1,"date_published":"2011-06-27T00:00:00Z","publication_status":"published","pubrep_id":"81","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"isi":1,"date_created":"2018-12-11T12:02:54Z","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"publist_id":"3254","year":"2011","status":"public","month":"06","scopus_import":"1","title":"The complexity of quantitative information flow problems","quality_controlled":"1","file":[{"relation":"main_file","checksum":"1a25be0c62459fc7640db88af08ff63a","file_size":299069,"content_type":"application/pdf","file_id":"4792","creator":"system","date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:10:07Z","access_level":"open_access","file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf"}],"file_date_updated":"2020-07-14T12:46:10Z","external_id":{"isi":["000300766400014"]},"oa_version":"Submitted Version","doi":"10.1109/CSF.2011.21","ddc":["000","005"],"article_processing_charge":"No","page":"205 - 217","day":"27","publisher":"IEEE","_id":"3361","conference":{"name":"CSF: Computer Security Foundations","end_date":"2011-06-29","location":"Cernay-la-Ville, France","start_date":"2011-06-27"},"has_accepted_license":"1","citation":{"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>.","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>","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>.","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.","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>","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217."},"date_updated":"2025-09-30T09:04:15Z","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"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"conference"},{"has_accepted_license":"1","conference":{"end_date":"2011-09-09","name":"CONCUR: Concurrency Theory","location":"Aachen, Germany","start_date":"2011-09-06"},"citation":{"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.","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>.","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.","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>","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>.","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."},"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"}],"language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:42:57Z","type":"conference","volume":6901,"oa":1,"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"404 - 418","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","_id":"3362","title":"Dynamic reactive modules","quality_controlled":"1","scopus_import":1,"alternative_title":["LNCS"],"file_date_updated":"2020-07-14T12:46:10Z","doi":"10.1007/978-3-642-23217-6_27","oa_version":"Submitted Version","ddc":["000"],"file":[{"relation":"main_file","file_id":"7870","content_type":"application/pdf","creator":"dernst","file_size":337125,"checksum":"6bf2453d8e52e979ddb58d17325bad26","file_name":"2011_CONCUR_Fisher.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:10Z","date_created":"2020-05-19T16:17:48Z"}],"article_processing_charge":"No","ec_funded":1,"date_published":"2011-01-01T00:00:00Z","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"last_name":"Fisher","first_name":"Jasmin","full_name":"Fisher, Jasmin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan"},{"last_name":"Piterman","first_name":"Nir","full_name":"Piterman, Nir"},{"full_name":"Singh, Anmol","first_name":"Anmol","last_name":"Singh"},{"full_name":"Vardi, Moshe","first_name":"Moshe","last_name":"Vardi"}],"intvolume":"      6901","publist_id":"3253","date_created":"2018-12-11T12:02:54Z","status":"public","month":"01","year":"2011"},{"external_id":{"arxiv":["1104.0127"]},"doi":"10.48550/arXiv.1104.0127","oa_version":"Preprint","title":"The decidability frontier for probabilistic automata on infinite words","article_processing_charge":"No","publication_status":"submitted","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"corr_author":"1","ec_funded":1,"date_published":"2011-04-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1104.0127"}],"year":"2011","status":"public","month":"04","date_created":"2018-12-11T12:02:54Z","arxiv":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","full_name":"Tracol, Mathieu","last_name":"Tracol","first_name":"Mathieu"}],"publist_id":"3251","citation":{"ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. 1104.0127.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv. <a href=\"https://doi.org/10.48550/arXiv.1104.0127\">https://doi.org/10.48550/arXiv.1104.0127</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d. <a href=\"https://doi.org/10.48550/arXiv.1104.0127\">https://doi.org/10.48550/arXiv.1104.0127</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. doi:<a href=\"https://doi.org/10.48550/arXiv.1104.0127\">10.48550/arXiv.1104.0127</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Decidability Frontier for Probabilistic Automata on Infinite Words</i>. 1104.0127, ArXiv, doi:<a href=\"https://doi.org/10.48550/arXiv.1104.0127\">10.48550/arXiv.1104.0127</a>."},"article_number":"1104.0127","oa":1,"project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","date_updated":"2025-06-26T09:19:59Z","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.","lang":"eng"}],"language":[{"iso":"eng"}],"page":"19","_id":"3363","publisher":"ArXiv","day":"01"},{"year":"2011","month":"05","status":"public","date_created":"2018-12-11T12:02:55Z","isi":1,"publist_id":"3249","intvolume":"       412","author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Mateescu","first_name":"Maria","full_name":"Mateescu, Maria"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"publication_status":"published","department":[{"_id":"ToHe"}],"pubrep_id":"79","date_published":"2011-05-06T00:00:00Z","article_processing_charge":"No","publication":"Theoretical Computer Science","file":[{"relation":"main_file","creator":"system","file_id":"4862","content_type":"application/pdf","file_size":230503,"checksum":"e5503e25ce020d753e06b3431e16841e","file_name":"IST-2012-79-v1+1_Approximation_of_event_probabilities_in_noisy_cellular_processes.pdf","access_level":"open_access","date_created":"2018-12-12T10:11:09Z","date_updated":"2020-07-14T12:46:10Z"}],"ddc":["000","004"],"doi":"10.1016/j.tcs.2010.10.022","external_id":{"isi":["000290078000005"]},"file_date_updated":"2020-07-14T12:46:10Z","oa_version":"Submitted Version","scopus_import":"1","quality_controlled":"1","title":"Approximation of event probabilities in noisy cellular processes","_id":"3364","day":"06","publisher":"Elsevier","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"4535"}]},"page":"2128 - 2141","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"type":"journal_article","volume":412,"date_updated":"2025-09-30T09:03:30Z","language":[{"iso":"eng"}],"abstract":[{"text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive. We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required.","lang":"eng"}],"citation":{"ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. <i>Theoretical Computer Science</i>. 2011;412(21):2128-2141. doi:<a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">10.1016/j.tcs.2010.10.022</a>","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.","mla":"Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.” <i>Theoretical Computer Science</i>, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:<a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">10.1016/j.tcs.2010.10.022</a>.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.” <i>Theoretical Computer Science</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">https://doi.org/10.1016/j.tcs.2010.10.022</a>.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” <i>Theoretical Computer Science</i>, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">https://doi.org/10.1016/j.tcs.2010.10.022</a>"},"issue":"21","has_accepted_license":"1"},{"date_published":"2011-09-29T00:00:00Z","publication_status":"published","pubrep_id":"77","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:02:55Z","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"intvolume":"      6605","publist_id":"3248","year":"2011","status":"public","month":"09","scopus_import":1,"alternative_title":["LNCS"],"title":"QUASY: quantitative synthesis tool","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:13:37Z","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","access_level":"open_access","file_size":475661,"checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","creator":"system","file_id":"5022","content_type":"application/pdf","relation":"main_file"}],"file_date_updated":"2020-07-14T12:46:10Z","doi":"10.1007/978-3-642-19835-9_24","oa_version":"Submitted Version","ddc":["000","005"],"page":"267 - 271","day":"29","publisher":"Springer","_id":"3365","conference":{"start_date":"2011-03-26","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2011-04-03","location":"Saarbrucken, Germany"},"has_accepted_license":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>QUASY: Quantitative Synthesis Tool</i>. Vol. 6605, Springer, 2011, pp. 267–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271."},"date_updated":"2021-01-12T07:42:58Z","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"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":6605},{"day":"21","publisher":"Springer","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5388"}]},"_id":"3366","page":"243 - 259","date_updated":"2024-10-21T06:03:04Z","language":[{"iso":"eng"}],"abstract":[{"text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized &quot;specification free&quot;, in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. ","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"oa":1,"type":"conference","volume":6806,"conference":{"start_date":"2011-07-14","location":"Snowbird, USA","name":"CAV: Computer Aided Verification","end_date":"2011-07-20"},"has_accepted_license":"1","citation":{"apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>.","ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","mla":"Cerny, Pavol, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>"},"date_created":"2018-12-11T12:02:55Z","publist_id":"3247","intvolume":"      6806","author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"year":"2011","month":"04","status":"public","corr_author":"1","date_published":"2011-04-21T00:00:00Z","ec_funded":1,"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"pubrep_id":"76","editor":[{"last_name":"Gopalakrishnan","first_name":"Ganesh","full_name":"Gopalakrishnan, Ganesh"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"article_processing_charge":"No","alternative_title":["LNCS"],"scopus_import":"1","quality_controlled":"1","title":"Quantitative synthesis for concurrent programs","file":[{"relation":"main_file","file_id":"5174","creator":"system","content_type":"application/pdf","file_size":508946,"checksum":"c033689355f45742dc7c99b5af13ce7a","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","access_level":"open_access","date_created":"2018-12-12T10:15:51Z","date_updated":"2020-07-14T12:46:10Z"}],"ddc":["000","004"],"file_date_updated":"2020-07-14T12:46:10Z","oa_version":"Submitted Version","doi":"10.1007/978-3-642-22110-1_20"},{"date_created":"2018-12-11T12:02:56Z","day":"13","publisher":"ACM","author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chao"},{"first_name":"Michael","last_name":"Kerber","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"2939"}]},"publist_id":"3245","year":"2011","status":"public","_id":"3367","month":"06","corr_author":"1","date_published":"2011-06-13T00:00:00Z","publication_status":"published","page":"207 - 216","department":[{"_id":"HeEd"}],"date_updated":"2025-09-29T13:26:20Z","abstract":[{"lang":"eng","text":"In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ&gt;0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via column operations, our algorithm performs rank computations on submatrices of the boundary matrix. For an arbitrary constant δ ∈ (0,1), the running time is O(C(1-δ)ΓR(n)log n), where C(1-δ)Γ is the number of homology classes with persistence at least (1-δ)Γ, n is the total number of simplices, and R(n) is the complexity of computing the rank of an n x n matrix with O(n) nonzero entries. Depending on the choice of the rank algorithm, this yields a deterministic O(C(1-δ)Γn2.376) algorithm, a O(C(1-δ)Γn2.28) Las-Vegas algorithm, or a O(C(1-δ)Γn2+ε) Monte-Carlo algorithm for an arbitrary ε&gt;0."}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"conference","scopus_import":1,"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2011-06-15","location":"Paris, France","start_date":"2011-06-13"},"title":"An output sensitive algorithm for persistent homology","quality_controlled":"1","doi":"10.1145/1998196.1998228","oa_version":"None","citation":{"short":"C. Chen, M. Kerber, in:, ACM, 2011, pp. 207–216.","ama":"Chen C, Kerber M. An output sensitive algorithm for persistent homology. In: ACM; 2011:207-216. doi:<a href=\"https://doi.org/10.1145/1998196.1998228\">10.1145/1998196.1998228</a>","mla":"Chen, Chao, and Michael Kerber. <i>An Output Sensitive Algorithm for Persistent Homology</i>. ACM, 2011, pp. 207–16, doi:<a href=\"https://doi.org/10.1145/1998196.1998228\">10.1145/1998196.1998228</a>.","ista":"Chen C, Kerber M. 2011. An output sensitive algorithm for persistent homology. SoCG: Symposium on Computational Geometry, 207–216.","apa":"Chen, C., &#38; Kerber, M. (2011). An output sensitive algorithm for persistent homology (pp. 207–216). Presented at the SoCG: Symposium on Computational Geometry, Paris, France: ACM. <a href=\"https://doi.org/10.1145/1998196.1998228\">https://doi.org/10.1145/1998196.1998228</a>","ieee":"C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.","chicago":"Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology,” 207–16. ACM, 2011. <a href=\"https://doi.org/10.1145/1998196.1998228\">https://doi.org/10.1145/1998196.1998228</a>."}},{"department":[{"_id":"CaHe"}],"publication_status":"published","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024655","open_access":"1"}],"date_published":"2011-01-18T00:00:00Z","corr_author":"1","status":"public","month":"01","year":"2011","author":[{"first_name":"Gabriel","last_name":"Krens","orcid":"0000-0003-4761-5996","id":"2B819732-F248-11E8-B48F-1D18A9856A87","full_name":"Krens, Gabriel"},{"id":"260FD49C-E911-11E9-B5EA-D9538404589B","full_name":"Möllmert, Stephanie","last_name":"Möllmert","first_name":"Stephanie"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"publist_id":"3244","intvolume":"       108","isi":1,"date_created":"2018-12-11T12:02:56Z","oa_version":"Submitted Version","doi":"10.1073/pnas.1010767108","external_id":{"isi":["000286310300003"],"pmid":["21212360"]},"title":"Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","publication":"PNAS","pmid":1,"page":"E9 - E10","_id":"3368","day":"18","publisher":"National Academy of Sciences","citation":{"apa":"Krens, G., Möllmert, S., &#38; Heisenberg, C.-P. J. (2011). Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1010767108\">https://doi.org/10.1073/pnas.1010767108</a>","ieee":"G. Krens, S. Möllmert, and C.-P. J. Heisenberg, “Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants,” <i>PNAS</i>, vol. 108, no. 3. National Academy of Sciences, pp. E9–E10, 2011.","chicago":"Krens, Gabriel, Stephanie Möllmert, and Carl-Philipp J Heisenberg. “Enveloping Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1010767108\">https://doi.org/10.1073/pnas.1010767108</a>.","ista":"Krens G, Möllmert S, Heisenberg C-PJ. 2011. Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. PNAS. 108(3), E9–E10.","mla":"Krens, Gabriel, et al. “Enveloping Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>, vol. 108, no. 3, National Academy of Sciences, 2011, pp. E9–10, doi:<a href=\"https://doi.org/10.1073/pnas.1010767108\">10.1073/pnas.1010767108</a>.","short":"G. Krens, S. Möllmert, C.-P.J. Heisenberg, PNAS 108 (2011) E9–E10.","ama":"Krens G, Möllmert S, Heisenberg C-PJ. Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. 2011;108(3):E9-E10. doi:<a href=\"https://doi.org/10.1073/pnas.1010767108\">10.1073/pnas.1010767108</a>"},"issue":"3","volume":108,"type":"journal_article","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"Tissue surface tension (TST) is an important mechanical property influencing cell sorting and tissue envelopment. The study by Manning et al. (1) reported on a mathematical model describing TST on the basis of the balance between adhesive and tensile properties of the constituent cells. The model predicts that, in high-adhesion cell aggregates, surface cells will be stretched to maintain the same area of cell–cell contact as interior bulk cells, resulting in an elongated and flattened cell shape. The authors (1) observed flat and elongated cells at the surface of high-adhesion zebrafish germ-layer explants, which they argue are undifferentiated stretched germ-layer progenitor cells, and they use this observation as a validation of their model.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T09:02:21Z"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":69,"type":"journal_article","date_updated":"2025-09-30T09:01:26Z","abstract":[{"lang":"eng","text":"Rab3 interacting molecules (RIMs) are highly enriched in the active zones of presynaptic terminals. It is generally thought that they operate as effectors of the small G protein Rab3. Three recent papers, by Han et al. (this issue of Neuron), Deng et al. (this issue of Neuron), and Kaeser et al. (a recent issue of Cell), shed new light on the functional role of RIM in presynaptic terminals. First, RIM tethers Ca2+ channels to active zones. Second, RIM contributes to priming of synaptic vesicles by interacting with another presynaptic protein, Munc13."}],"language":[{"iso":"eng"}],"citation":{"short":"A. Pernia-Andrade, P.M. Jonas, Neuron 69 (2011) 185–187.","ama":"Pernia-Andrade A, Jonas PM. The multiple faces of RIM. <i>Neuron</i>. 2011;69(2):185-187. doi:<a href=\"https://doi.org/10.1016/j.neuron.2011.01.010\">10.1016/j.neuron.2011.01.010</a>","mla":"Pernia-Andrade, Alejandro, and Peter M. Jonas. “The Multiple Faces of RIM.” <i>Neuron</i>, vol. 69, no. 2, Elsevier, 2011, pp. 185–87, doi:<a href=\"https://doi.org/10.1016/j.neuron.2011.01.010\">10.1016/j.neuron.2011.01.010</a>.","ista":"Pernia-Andrade A, Jonas PM. 2011. The multiple faces of RIM. Neuron. 69(2), 185–187.","apa":"Pernia-Andrade, A., &#38; Jonas, P. M. (2011). The multiple faces of RIM. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2011.01.010\">https://doi.org/10.1016/j.neuron.2011.01.010</a>","ieee":"A. Pernia-Andrade and P. M. Jonas, “The multiple faces of RIM,” <i>Neuron</i>, vol. 69, no. 2. Elsevier, pp. 185–187, 2011.","chicago":"Pernia-Andrade, Alejandro, and Peter M Jonas. “The Multiple Faces of RIM.” <i>Neuron</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.neuron.2011.01.010\">https://doi.org/10.1016/j.neuron.2011.01.010</a>."},"issue":"2","_id":"3369","publisher":"Elsevier","day":"27","page":"185 - 187","article_processing_charge":"No","publication":"Neuron","doi":"10.1016/j.neuron.2011.01.010","external_id":{"isi":["000286792900002"]},"oa_version":"None","scopus_import":"1","title":"The multiple faces of RIM","quality_controlled":"1","year":"2011","status":"public","month":"01","isi":1,"date_created":"2018-12-11T12:02:56Z","author":[{"id":"36963E98-F248-11E8-B48F-1D18A9856A87","full_name":"Pernia-Andrade, Alejandro","last_name":"Pernia-Andrade","first_name":"Alejandro"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"}],"publist_id":"3243","intvolume":"        69","publication_status":"published","department":[{"_id":"PeJo"}],"corr_author":"1","date_published":"2011-01-27T00:00:00Z"},{"doi":"10.1093/sysbio/syq086","external_id":{"isi":["000287255100009"]},"oa_version":"Submitted Version","title":"Consequences of different null models on the tree shape bias of supertree methods","quality_controlled":"1","article_processing_charge":"No","publication":"Systematic Biology","department":[{"_id":"JoBo"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://eprints.cs.univie.ac.at/3226/"}],"date_published":"2011-03-01T00:00:00Z","corr_author":"1","status":"public","month":"03","year":"2011","author":[{"first_name":"Anne","last_name":"Kupczok","full_name":"Kupczok, Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        60","publist_id":"3241","date_created":"2018-12-11T12:02:57Z","isi":1,"citation":{"apa":"Kupczok, A. (2011). Consequences of different null models on the tree shape bias of supertree methods. <i>Systematic Biology</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/sysbio/syq086\">https://doi.org/10.1093/sysbio/syq086</a>","ieee":"A. Kupczok, “Consequences of different null models on the tree shape bias of supertree methods,” <i>Systematic Biology</i>, vol. 60, no. 2. Oxford University Press, pp. 218–225, 2011.","chicago":"Kupczok, Anne. “Consequences of Different Null Models on the Tree Shape Bias of Supertree Methods.” <i>Systematic Biology</i>. Oxford University Press, 2011. <a href=\"https://doi.org/10.1093/sysbio/syq086\">https://doi.org/10.1093/sysbio/syq086</a>.","ista":"Kupczok A. 2011. Consequences of different null models on the tree shape bias of supertree methods. Systematic Biology. 60(2), 218–225.","mla":"Kupczok, Anne. “Consequences of Different Null Models on the Tree Shape Bias of Supertree Methods.” <i>Systematic Biology</i>, vol. 60, no. 2, Oxford University Press, 2011, pp. 218–25, doi:<a href=\"https://doi.org/10.1093/sysbio/syq086\">10.1093/sysbio/syq086</a>.","short":"A. Kupczok, Systematic Biology 60 (2011) 218–225.","ama":"Kupczok A. Consequences of different null models on the tree shape bias of supertree methods. <i>Systematic Biology</i>. 2011;60(2):218-225. doi:<a href=\"https://doi.org/10.1093/sysbio/syq086\">10.1093/sysbio/syq086</a>"},"issue":"2","type":"journal_article","volume":60,"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Supertree methods are widely applied and give rise to new conclusions about phylogenies (e.g., Bininda-Emonds et al. 2007). Although several desiderata for supertree methods exist (Wilkinson, Thorley, et al. 2004), only few of them have been studied in greater detail, examples include shape bias (Wilkinson et al. 2005) or pareto properties (Wilkinson et al. 2007). Here I look more closely at two matrix representation methods, matrix representation with compatibility (MRC) and matrix representation with parsimony (MRP). Different null models of random data are studied and the resulting tree shapes are investigated. Thereby I consider unrooted trees and a bias in tree shape is determined by a tree balance measure. The measure for unrooted trees is a modification of a tree balance measure for rooted trees. I observe that depending on the underlying null model of random data, the methods may resolve conflict in favor of more balanced tree shapes. The analyses refer only to trees with the same taxon set, also known as the consensus setting (e.g., Wilkinson et al. 2007), but I will be able to draw conclusions on how to deal with missing data."}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T08:59:18Z","page":"218 - 225","_id":"3370","publisher":"Oxford University Press","day":"01"}]