[{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"01","title":"Decision procedures for automating termination proofs","year":"2011","day":"01","_id":"3324","publisher":"Springer","doi":"10.1007/978-3-642-18275-4_26","editor":[{"last_name":"Jhala","full_name":"Jhala, Ranjit","first_name":"Ranjit"},{"last_name":"Schmidt","first_name":"David","full_name":"Schmidt, David"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T07:42:39Z","volume":6538,"fulldoi":"https://doi.org/10.1007/978-3-642-18275-4_26","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/170697/"}],"oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_published":"2011-01-01T00:00:00Z","abstract":[{"text":"Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear arithmetic) to express them. We believe we can significantly increase the class of programs that are amenable to automated termination proofs by identifying more expressive decidable logics for reasoning about well-founded relations. We therefore present a new decision procedure for reasoning about multiset orderings, which are among the most powerful orderings used to prove termination. We show that, using our decision procedure, one can automatically prove termination of natural abstractions of programs.","lang":"eng"}],"intvolume":"      6538","publist_id":"3311","status":"public","scopus_import":1,"citation":{"short":"R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.","apa":"Piskac, R., &#38; Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala &#38; D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">https://doi.org/10.1007/978-3-642-18275-4_26</a>","ista":"Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386.","ieee":"R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.","mla":"Piskac, Ruzica, and Thomas Wies. <i>Decision Procedures for Automating Termination Proofs</i>. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:<a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">10.1007/978-3-642-18275-4_26</a>.","ama":"Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:<a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">10.1007/978-3-642-18275-4_26</a>","chicago":"Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18275-4_26\">https://doi.org/10.1007/978-3-642-18275-4_26</a>."},"conference":{"end_date":"2011-01-25","location":"Texas, USA","name":"VMCAI: Verification Model Checking and Abstract Interpretation","start_date":"2011-01-23"},"publication_status":"published","author":[{"first_name":"Ruzica","full_name":"Piskac, Ruzica","last_name":"Piskac"},{"first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies"}],"alternative_title":["LNCS"],"type":"conference","date_created":"2018-12-11T12:02:40Z","page":"371 - 386"},{"citation":{"ista":"Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.","ieee":"R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.","ama":"Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:<a href=\"https://doi.org/10.1145/1926385.1926454\">10.1145/1926385.1926454</a>","chicago":"Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. <a href=\"https://doi.org/10.1145/1926385.1926454\">https://doi.org/10.1145/1926385.1926454</a>.","mla":"Alur, Rajeev, and Pavol Cerny. <i>Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs</i>. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:<a href=\"https://doi.org/10.1145/1926385.1926454\">10.1145/1926385.1926454</a>.","apa":"Alur, R., &#38; Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. <a href=\"https://doi.org/10.1145/1926385.1926454\">https://doi.org/10.1145/1926385.1926454</a>","short":"R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610."},"conference":{"start_date":"2011-01-26","name":"POPL: Principles of Programming Languages","end_date":"2011-01-28","location":"Texas, USA"},"publication_status":"published","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol"}],"issue":"1","type":"conference","date_created":"2018-12-11T12:02:41Z","page":"599 - 610","article_processing_charge":"No","language":[{"iso":"eng"}],"external_id":{"isi":["000289656100050"]},"date_published":"2011-01-26T00:00:00Z","department":[{"_id":"ToHe"}],"abstract":[{"text":"We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of data values, tagged with symbols from a finite set, over a potentially infinite data do- main that supports only the operations of equality and ordering. The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data strings. At every step, it can make decisions based on the next in- put symbol, updating its state, remembering the input data value in its data variables, and updating data-string variables by concatenat- ing data-string variables and new symbols formed from data vari- ables, while avoiding duplication. We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over in- put/output data-strings, are in PSPACE. We identify a class of imperative and a class of functional pro- grams, manipulating lists of data items, which can be effectively translated to streaming data-string transducers. The imperative pro- grams dynamically modify a singly-linked heap by changing next- pointers of heap-nodes and by adding new nodes. The main re- striction specifies how the next-pointers can be used for traversal. We also identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls. Our results lead to algorithms for assertion checking and for checking functional equivalence of two programs, written possibly in different programming styles, for commonly used routines such as insert, delete, and reverse.","lang":"eng"}],"intvolume":"        46","publist_id":"3310","status":"public","scopus_import":"1","isi":1,"oa_version":"None","date_updated":"2025-09-30T09:10:38Z","volume":46,"fulldoi":"https://doi.org/10.1145/1926385.1926454","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","title":"Streaming transducers for algorithmic verification of single pass list processing programs","year":"2011","day":"26","_id":"3325","publisher":"ACM","doi":"10.1145/1926385.1926454"},{"quality_controlled":"1","fulldoi":"https://doi.org/10.1007/978-3-642-24372-1_37","volume":6996,"date_updated":"2025-01-14T12:09:37Z","oa_version":"Submitted Version","_id":"3326","publisher":"Springer","doi":"10.1007/978-3-642-24372-1_37","year":"2011","day":"14","title":"What’s decidable about weighted automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","file_date_updated":"2020-07-14T12:46:07Z","date_created":"2018-12-11T12:02:41Z","page":"482 - 491","author":[{"last_name":"Almagor","full_name":"Almagor, Shaull","first_name":"Shaull"},{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"type":"conference","alternative_title":["LNCS"],"publication_status":"published","conference":{"end_date":"2011-10-14","location":"Taipei, Taiwan","start_date":"2011-10-11","name":"ATVA: Automated Technology for Verification and Analysis"},"file":[{"date_created":"2020-05-19T16:08:32Z","relation":"main_file","checksum":"a7ca08a2cb1b6925f4c18a3034ae5659","file_id":"7868","date_updated":"2020-07-14T12:46:07Z","content_type":"application/pdf","file_name":"2011_LNCS_Almagor.pdf","creator":"dernst","access_level":"open_access","file_size":182309}],"citation":{"ista":"Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata,” 6996:482–91. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">https://doi.org/10.1007/978-3-642-24372-1_37</a>.","mla":"Almagor, Shaull, et al. <i>What’s Decidable about Weighted Automata</i>. Vol. 6996, Springer, 2011, pp. 482–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">10.1007/978-3-642-24372-1_37</a>.","ama":"Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata. In: Vol 6996. Springer; 2011:482-491. doi:<a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">10.1007/978-3-642-24372-1_37</a>","ieee":"S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.","short":"S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24372-1_37\">https://doi.org/10.1007/978-3-642-24372-1_37</a>"},"scopus_import":"1","has_accepted_license":"1","ddc":["000"],"publist_id":"3309","status":"public","department":[{"_id":"ToHe"}],"date_published":"2011-10-14T00:00:00Z","abstract":[{"lang":"eng","text":"Weighted automata map input words to numerical values. Ap- plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. A weighted au- tomaton is defined with respect to a semiring. For the tropical semiring, the weight of a run is the sum of the weights of the transitions taken along the run, and the value of a word is the minimal weight of an accepting run on it. In the 90’s, Krob studied the decidability of problems on rational series defined with respect to the tropical semiring. Rational series are strongly related to weighted automata, and Krob’s results apply to them. In par- ticular, it follows from Krob’s results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata defined with respect to the tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable when the domain is ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob’s reasoning, make the un- decidability result accessible to the automata-theoretic community, and strengthen it to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights on the transitions are from the set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten also the decidability re- sults and to show that the universality problem for weighted automata defined with respect to the tropical semiring with domain ∪ {∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of containment vs. universality and the front of the ∪ {∞} vs. the ∪ {∞} domains."}],"intvolume":"      6996","article_processing_charge":"No","language":[{"iso":"eng"}],"oa":1},{"publication":"Communications of the ACM","status":"public","publist_id":"3267","scopus_import":"1","abstract":[{"text":"Exploring the connection of biology with reactive systems to better understand living systems.","lang":"eng"}],"intvolume":"        54","department":[{"_id":"ToHe"}],"date_published":"2011-10-01T00:00:00Z","external_id":{"isi":["000296022500019"]},"language":[{"iso":"eng"}],"ec_funded":1,"article_processing_charge":"No","page":"72 - 82","date_created":"2018-12-11T12:02:50Z","type":"journal_article","issue":"10","author":[{"full_name":"Fisher, Jasmin","first_name":"Jasmin","last_name":"Fisher"},{"last_name":"Harel","first_name":"David","full_name":"Harel, David"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"citation":{"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.","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>.","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>.","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>","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.","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>"},"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"publication_status":"published","day":"01","year":"2011","title":"Biology as reactivity","doi":"10.1145/2001269.2001289","_id":"3352","publisher":"ACM","month":"10","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":54,"date_updated":"2025-09-30T09:06:32Z","quality_controlled":"1","fulldoi":"https://doi.org/10.1145/2001269.2001289","isi":1,"oa_version":"None"},{"doi":"10.1109/QEST.2011.40","publisher":"IEEE","_id":"3355","day":"13","year":"2011","corr_author":"1","title":"Quantitative evaluation of BFT protocols","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","fulldoi":"https://doi.org/10.1109/QEST.2011.40","date_updated":"2024-10-09T20:54:27Z","oa_version":"Submitted Version","ddc":["000","004"],"has_accepted_license":"1","scopus_import":1,"publist_id":"3260","status":"public","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."}],"department":[{"_id":"ToHe"}],"date_published":"2011-10-13T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"file_date_updated":"2020-07-14T12:46:09Z","page":"255 - 264","date_created":"2018-12-11T12:02:51Z","type":"conference","author":[{"id":"584C6850-E996-11E9-805B-F01764644770","last_name":"Halalai","first_name":"Raluca","full_name":"Halalai, Raluca"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Singh, Vasu","first_name":"Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","conference":{"name":"QEST: Quantitative Evaluation of Systems","start_date":"2011-09-05","end_date":"2011-09-08","location":"Aachen, Germany"},"citation":{"short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 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>","ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.","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.","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>","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>.","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>."},"pubrep_id":"84","file":[{"date_created":"2018-12-12T10:07:49Z","relation":"main_file","checksum":"4dc8750ab7921f51de992000b13d1b01","file_id":"4648","date_updated":"2020-07-14T12:46:09Z","creator":"system","access_level":"open_access","file_size":272017,"file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf","content_type":"application/pdf"}]},{"doi":"10.1007/978-3-642-21254-3_17","publisher":"Springer","_id":"3357","corr_author":"1","title":"The complexity of request-response games","day":"01","year":"2011","month":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1007/978-3-642-21254-3_17","quality_controlled":"1","date_updated":"2024-10-09T20:54:27Z","volume":6638,"oa_version":"None","editor":[{"last_name":"Dediu","first_name":"Adrian-Horia","full_name":"Dediu, Adrian-Horia"},{"last_name":"Inenaga","full_name":"Inenaga, Shunsuke","first_name":"Shunsuke"},{"first_name":"Carlos","full_name":"Martín-Vide, Carlos","last_name":"Martín-Vide"}],"scopus_import":1,"status":"public","publist_id":"3258","language":[{"iso":"eng"}],"intvolume":"      6638","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."}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2011-01-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","full_name":"Horn, Florian","first_name":"Florian"}],"page":"227 - 237","date_created":"2018-12-11T12:02:52Z","publication_status":"published","citation":{"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>","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, 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.","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>.","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.","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>.","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>"},"conference":{"location":"Tarragona, Spain","end_date":"2011-05-31","start_date":"2011-05-26","name":"LATA: Language and Automata Theory and Applications"}},{"conference":{"start_date":"2011-04-10","name":"EuroSys","location":"Salzburg, Austria","end_date":"2011-04-13"},"citation":{"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>","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.","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>.","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>.","ista":"Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.","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>","short":"T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342."},"publication_status":"published","date_created":"2018-12-11T12:02:53Z","page":"329 - 342","author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vasu","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"first_name":"Damien","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey"}],"type":"conference","main_file_link":[{"open_access":"1","url":"http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf"}],"date_published":"2011-04-10T00:00:00Z","department":[{"_id":"ToHe"}],"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."}],"article_processing_charge":"No","language":[{"iso":"eng"}],"oa":1,"status":"public","publist_id":"3257","scopus_import":"1","ddc":["000"],"oa_version":"Published Version","date_updated":"2026-06-18T18:44:21Z","quality_controlled":"1","fulldoi":"https://doi.org/10.1145/1966445.1966476","month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2011","day":"10","title":"Scheduling large jobs by abstraction refinement","corr_author":"1","publisher":"ACM","_id":"3358","doi":"10.1145/1966445.1966476"},{"_id":"3359","scopus_import":"1","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.","publisher":"ACM","doi":"10.1145/2038642.2038666","title":"From boolean to quantitative synthesis","status":"public","corr_author":"1","publist_id":"3256","year":"2011","day":"09","ec_funded":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_published":"2011-10-09T00:00:00Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"10","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."}],"fulldoi":"https://doi.org/10.1145/2038642.2038666","quality_controlled":"1","author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"date_updated":"2024-10-21T06:03:04Z","type":"conference","date_created":"2018-12-11T12:02:53Z","page":"149 - 154","publication_status":"published","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"oa_version":"None","citation":{"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>","short":"P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.","ista":"Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 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>.","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>","ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154."},"conference":{"end_date":"2011-10-14","location":"Taipei; Taiwan","name":"EMSOFT: Embedded Software ","start_date":"2011-10-09"}},{"page":"82 - 96","date_created":"2018-12-11T12:02:53Z","type":"conference","alternative_title":["LIPIcs"],"author":[{"first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"file_date_updated":"2020-07-14T12:46:10Z","conference":{"location":"Bergen, Norway","end_date":"2011-09-15","name":"CSL: Computer Science Logic","start_date":"2011-09-12"},"citation":{"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>","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","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>.","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>.","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>"},"file":[{"file_size":504270,"access_level":"open_access","creator":"system","file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:10Z","checksum":"250603c6be8ccad4fbd4d7b24221f0ee","file_id":"4803","relation":"main_file","date_created":"2018-12-12T10:10:17Z"}],"pubrep_id":"82","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication_status":"published","publist_id":"3255","status":"public","ddc":["004"],"scopus_import":1,"has_accepted_license":"1","intvolume":"        12","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"}],"department":[{"_id":"ToHe"}],"date_published":"2011-08-31T00:00:00Z","oa":1,"language":[{"iso":"eng"}],"ec_funded":1,"volume":12,"date_updated":"2021-01-12T07:42:56Z","quality_controlled":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2011.82","oa_version":"Published Version","day":"31","year":"2011","title":"Determinizing discounted-sum automata","doi":"10.4230/LIPIcs.CSL.2011.82","publisher":"Springer","_id":"3360","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)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08"},{"quality_controlled":"1","fulldoi":"https://doi.org/10.1109/CSF.2011.21","date_updated":"2025-09-30T09:04:15Z","oa_version":"Submitted Version","isi":1,"publisher":"IEEE","_id":"3361","doi":"10.1109/CSF.2011.21","year":"2011","day":"27","title":"The complexity of quantitative information flow problems","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06","file_date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-11T12:02:54Z","page":"205 - 217","author":[{"first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"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"}],"publication_status":"published","conference":{"location":"Cernay-la-Ville, France","end_date":"2011-06-29","start_date":"2011-06-27","name":"CSF: Computer Security Foundations"},"pubrep_id":"81","file":[{"creator":"system","access_level":"open_access","file_size":299069,"file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:10:07Z","relation":"main_file","file_id":"4792","checksum":"1a25be0c62459fc7640db88af08ff63a","date_updated":"2020-07-14T12:46:10Z"}],"citation":{"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>.","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>","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>.","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217."},"scopus_import":"1","has_accepted_license":"1","ddc":["000","005"],"status":"public","publist_id":"3254","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_published":"2011-06-27T00:00:00Z","abstract":[{"lang":"eng","text":"In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (based on Shannon entropy)have been introduced to enable more fine-grained reasoning about programs in situations where limited information flow is acceptable. The QIF bounding problem asks whether the information flow in a given program is bounded by a constant $d$. Our first result is that the QIF bounding problem is PSPACE-complete. The QIF memoryless synthesis problem asks whether it is possible to resolve nondeterministic choices in a given partial program in such a way that in the resulting deterministic program, the quantitative information flow is bounded by a given constant $d$. Our second result is that the QIF memoryless synthesis problem is also EXPTIME-complete. The QIF memoryless synthesis problem generalizes to QIF general synthesis problem which does not impose the memoryless requirement (that is, by allowing the synthesized program to have more variables then the original partial program). Our third result is that the QIF general synthesis problem is EXPTIME-hard."}],"article_processing_charge":"No","ec_funded":1,"language":[{"iso":"eng"}],"external_id":{"isi":["000300766400014"]},"oa":1},{"title":"Dynamic reactive modules","year":"2011","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"3362","doi":"10.1007/978-3-642-23217-6_27","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:57Z","volume":6901,"fulldoi":"https://doi.org/10.1007/978-3-642-23217-6_27","quality_controlled":"1","oa_version":"Submitted Version","publist_id":"3253","status":"public","has_accepted_license":"1","scopus_import":1,"ddc":["000"],"ec_funded":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa":1,"date_published":"2011-01-01T00:00:00Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables."}],"intvolume":"      6901","author":[{"first_name":"Jasmin","full_name":"Fisher, Jasmin","last_name":"Fisher"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Nickovic, Dejan","first_name":"Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"},{"first_name":"Anmol","full_name":"Singh, Anmol","last_name":"Singh"},{"first_name":"Moshe","full_name":"Vardi, Moshe","last_name":"Vardi"}],"type":"conference","alternative_title":["LNCS"],"date_created":"2018-12-11T12:02:54Z","page":"404 - 418","file_date_updated":"2020-07-14T12:46:10Z","file":[{"date_updated":"2020-07-14T12:46:10Z","checksum":"6bf2453d8e52e979ddb58d17325bad26","file_id":"7870","date_created":"2020-05-19T16:17:48Z","relation":"main_file","file_size":337125,"access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_name":"2011_CONCUR_Fisher.pdf"}],"citation":{"chicago":"Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. <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>.","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>.","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.","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>","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.","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.","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>"},"conference":{"end_date":"2011-09-09","location":"Aachen, Germany","name":"CONCUR: Concurrency Theory","start_date":"2011-09-06"},"publication_status":"published","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}]},{"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1104.0127","open_access":"1"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1104.0127"]},"oa":1,"ec_funded":1,"article_processing_charge":"No","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2011-04-01T00:00:00Z","publist_id":"3251","status":"public","citation":{"ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. 1104.0127.","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>.","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>.","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>","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.).","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>"},"publication_status":"submitted","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"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"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"type":"preprint","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"full_name":"Tracol, Mathieu","first_name":"Mathieu","last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"page":"19","article_number":"1104.0127","date_created":"2018-12-11T12:02:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","corr_author":"1","title":"The decidability frontier for probabilistic automata on infinite words","day":"01","year":"2011","doi":"10.48550/arXiv.1104.0127","_id":"3363","publisher":"ArXiv","oa_version":"Preprint","date_updated":"2025-06-26T09:19:59Z","fulldoi":"https://doi.org/10.48550/arXiv.1104.0127"},{"pubrep_id":"79","file":[{"checksum":"e5503e25ce020d753e06b3431e16841e","file_id":"4862","relation":"main_file","date_created":"2018-12-12T10:11:09Z","date_updated":"2020-07-14T12:46:10Z","creator":"system","file_size":230503,"access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-79-v1+1_Approximation_of_event_probabilities_in_noisy_cellular_processes.pdf"}],"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>","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.","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>.","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>.","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.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.","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>"},"publication_status":"published","issue":"21","author":[{"last_name":"Didier","full_name":"Didier, Frédéric","first_name":"Frédéric"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Mateescu, Maria","first_name":"Maria","last_name":"Mateescu"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"type":"journal_article","date_created":"2018-12-11T12:02:55Z","page":"2128 - 2141","file_date_updated":"2020-07-14T12:46:10Z","article_processing_charge":"No","external_id":{"isi":["000290078000005"]},"language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"ToHe"}],"date_published":"2011-05-06T00:00:00Z","abstract":[{"lang":"eng","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."}],"intvolume":"       412","publication":"Theoretical Computer Science","status":"public","publist_id":"3249","has_accepted_license":"1","scopus_import":"1","ddc":["000","004"],"isi":1,"oa_version":"Submitted Version","date_updated":"2025-09-30T09:03:30Z","volume":412,"fulldoi":"https://doi.org/10.1016/j.tcs.2010.10.022","quality_controlled":"1","month":"05","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Approximation of event probabilities in noisy cellular processes","year":"2011","day":"06","related_material":{"record":[{"status":"public","id":"4535","relation":"earlier_version"}]},"_id":"3364","publisher":"Elsevier","doi":"10.1016/j.tcs.2010.10.022"},{"oa":1,"language":[{"iso":"eng"}],"date_published":"2011-09-29T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"intvolume":"      6605","abstract":[{"lang":"eng","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."}],"scopus_import":1,"has_accepted_license":"1","ddc":["000","005"],"status":"public","publist_id":"3248","publication_status":"published","pubrep_id":"77","file":[{"date_created":"2018-12-12T10:13:37Z","relation":"main_file","file_id":"5022","checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","date_updated":"2020-07-14T12:46:10Z","creator":"system","access_level":"open_access","file_size":475661,"content_type":"application/pdf","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf"}],"citation":{"short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","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>","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>.","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>.","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>","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."},"conference":{"end_date":"2011-04-03","location":"Saarbrucken, Germany","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2011-03-26"},"file_date_updated":"2020-07-14T12:46:10Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"last_name":"Singh","full_name":"Singh, Rohit","first_name":"Rohit"}],"alternative_title":["LNCS"],"type":"conference","date_created":"2018-12-11T12:02:55Z","page":"267 - 271","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"09","_id":"3365","publisher":"Springer","doi":"10.1007/978-3-642-19835-9_24","title":"QUASY: quantitative synthesis tool","year":"2011","day":"29","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-642-19835-9_24","quality_controlled":"1","date_updated":"2021-01-12T07:42:58Z","volume":6605},{"editor":[{"last_name":"Gopalakrishnan","first_name":"Ganesh","full_name":"Gopalakrishnan, Ganesh"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"}],"oa_version":"Submitted Version","quality_controlled":"1","fulldoi":"https://doi.org/10.1007/978-3-642-22110-1_20","volume":6806,"date_updated":"2024-10-21T06:03:04Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"04","doi":"10.1007/978-3-642-22110-1_20","related_material":{"record":[{"id":"5388","relation":"earlier_version","status":"public"}]},"_id":"3366","publisher":"Springer","day":"21","year":"2011","corr_author":"1","title":"Quantitative synthesis for concurrent programs","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","conference":{"name":"CAV: Computer Aided Verification","start_date":"2011-07-14","location":"Snowbird, USA","end_date":"2011-07-20"},"citation":{"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>","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>.","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>.","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.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","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>"},"file":[{"content_type":"application/pdf","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","file_size":508946,"access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:46:10Z","file_id":"5174","checksum":"c033689355f45742dc7c99b5af13ce7a","date_created":"2018-12-12T10:15:51Z","relation":"main_file"}],"pubrep_id":"76","file_date_updated":"2020-07-14T12:46:10Z","page":"243 - 259","date_created":"2018-12-11T12:02:55Z","alternative_title":["LNCS"],"type":"conference","author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun"},{"last_name":"Singh","full_name":"Singh, Rohit","first_name":"Rohit"}],"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"}],"intvolume":"      6806","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_published":"2011-04-21T00:00:00Z","oa":1,"language":[{"iso":"eng"}],"article_processing_charge":"No","ec_funded":1,"ddc":["000","004"],"scopus_import":"1","has_accepted_license":"1","status":"public","publist_id":"3247"},{"publist_id":"3226","publication":"IJFCS: International Journal of Foundations of Computer Science","status":"public","ddc":["000"],"scopus_import":"1","has_accepted_license":"1","intvolume":"        22","abstract":[{"lang":"eng","text":"In this survey, we compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages — matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models — describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, and ease of use. Moreover, they provide different support for checking the well-formedness of a model and for analyzing a model."}],"date_published":"2011-06-01T00:00:00Z","department":[{"_id":"ToHe"}],"oa":1,"language":[{"iso":"eng"}],"external_id":{"isi":["000291552600005"]},"article_processing_charge":"No","page":"823 - 841","date_created":"2018-12-11T12:03:00Z","type":"journal_article","issue":"4","author":[{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"file_date_updated":"2020-07-14T12:46:11Z","citation":{"short":"T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.","apa":"Henzinger, T. A., Jobstmann, B., &#38; Wolf, V. (2011). Formalisms for specifying Markovian population models. <i>IJFCS: International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054111008441\">https://doi.org/10.1142/S0129054111008441</a>","ista":"Henzinger TA, Jobstmann B, Wolf V. 2011. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 22(4), 823–841.","mla":"Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.” <i>IJFCS: International Journal of Foundations of Computer Science</i>, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:<a href=\"https://doi.org/10.1142/S0129054111008441\">10.1142/S0129054111008441</a>.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” <i>IJFCS: International Journal of Foundations of Computer Science</i>, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.” <i>IJFCS: International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2011. <a href=\"https://doi.org/10.1142/S0129054111008441\">https://doi.org/10.1142/S0129054111008441</a>.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. <i>IJFCS: International Journal of Foundations of Computer Science</i>. 2011;22(4):823-841. doi:<a href=\"https://doi.org/10.1142/S0129054111008441\">10.1142/S0129054111008441</a>"},"pubrep_id":"628","file":[{"date_created":"2018-12-12T10:08:45Z","relation":"main_file","file_id":"4707","checksum":"df88431872586c773fbcfea37d7b36a2","date_updated":"2020-07-14T12:46:11Z","file_name":"IST-2016-628-v1+1_journals-ijfcs-HenzingerJW11.pdf","content_type":"application/pdf","creator":"system","access_level":"open_access","file_size":222840}],"publication_status":"published","day":"01","year":"2011","title":"Formalisms for specifying Markovian population models","doi":"10.1142/S0129054111008441","_id":"3381","related_material":{"record":[{"relation":"earlier_version","id":"3841","status":"public"}]},"publisher":"World Scientific Publishing","month":"06","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":22,"date_updated":"2025-09-30T08:49:01Z","quality_controlled":"1","fulldoi":"https://doi.org/10.1142/S0129054111008441","isi":1,"oa_version":"Submitted Version"},{"oa_version":"Published Version","date_updated":"2026-07-06T13:25:39Z","das_tickbox":"1","volume":7,"fulldoi":"https://doi.org/10.2168/LMCS-7(4:8)2011","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","corr_author":"1","title":"Timed parity games: Complexity and robustness","day":"14","year":"2011","doi":"10.2168/LMCS-7(4:8)2011","_id":"3315","related_material":{"record":[{"id":"3876","relation":"earlier_version","status":"public"}]},"publisher":"International Federation for Computational Logic","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2011. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>.","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation for Computational Logic, 2011, doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International Federation for Computational Logic, 2011.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4)."},"pubrep_id":"506","file":[{"access_level":"open_access","file_size":588863,"creator":"system","content_type":"application/pdf","file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf","date_updated":"2020-07-14T12:46:07Z","date_created":"2018-12-12T10:16:42Z","relation":"main_file","checksum":"3480e1594bbef25ff7462fa93a8a814e","file_id":"5231"}],"publication_status":"published","project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"}],"type":"journal_article","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Vinayak","full_name":"Prabhu, Vinayak","last_name":"Prabhu"}],"issue":"4","date_created":"2018-12-11T12:02:37Z","file_date_updated":"2020-07-14T12:46:07Z","language":[{"iso":"eng"}],"oa":1,"article_processing_charge":"No","ec_funded":1,"abstract":[{"text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers.","lang":"eng"}],"intvolume":"         7","date_published":"2011-12-14T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication":"Logical Methods in Computer Science","publist_id":"3324","status":"public","ddc":["000","005"],"has_accepted_license":"1","scopus_import":"1"},{"author":[{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"id":"72A86902-E99F-11E9-9F62-915534D1B916","last_name":"Singh","first_name":"Anmol","full_name":"Singh, Anmol"},{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu"},{"last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas"},{"first_name":"Damien","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey"}],"type":"conference","date_created":"2018-12-11T12:02:33Z","page":"1 - 6","file_date_updated":"2020-07-14T12:46:06Z","pubrep_id":"90","file":[{"file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf","content_type":"application/pdf","access_level":"open_access","file_size":232770,"creator":"system","date_updated":"2020-07-14T12:46:06Z","relation":"main_file","date_created":"2018-12-12T10:18:14Z","file_id":"5333","checksum":"21a461ac004bb535c83320fe79b30375"}],"citation":{"apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Static scheduling in clouds. In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i> (pp. 1–6). Portland, OR, United States: Usenix Association.","short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.","ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds.” In <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, 1–6. Usenix Association, 2011.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>. Usenix Association; 2011:1-6.","ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” in <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Portland, OR, United States, 2011, pp. 1–6.","mla":"Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Usenix Association, 2011, pp. 1–6."},"conference":{"location":"Portland, OR, United States","end_date":"2011-06-15","start_date":"2011-06-14","name":"HotCloud: Workshop on Hot Topics in Cloud Computing"},"publication_status":"published","publist_id":"3338","publication":"3rd USENIX Workshop on Hot Topics in Cloud Computing","status":"public","has_accepted_license":"1","ddc":["000","005"],"article_processing_charge":"No","language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"ToHe"}],"date_published":"2011-06-14T00:00:00Z","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler.","lang":"eng"}],"das_tickbox":"1","date_updated":"2026-07-07T06:07:16Z","quality_controlled":"1","oa_version":"Submitted Version","title":"Static scheduling in clouds","corr_author":"1","year":"2011","day":"14","_id":"3302","publisher":"Usenix Association","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06"},{"month":"06","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1109/LICS.2011.33","_id":"3356","related_material":{"record":[{"id":"5385","relation":"earlier_version","status":"public"},{"relation":"later_version","id":"2038","status":"public"}]},"publisher":"IEEE","title":"Temporal specifications with accumulative values","day":"21","year":"2011","oa_version":"Submitted Version","isi":1,"fulldoi":"https://doi.org/10.1109/LICS.2011.33","date_updated":"2026-07-07T14:01:43Z","oa":1,"external_id":{"isi":["000297350400007"]},"language":[{"iso":"eng"}],"article_processing_charge":"No","ec_funded":1,"abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"date_published":"2011-06-21T00:00:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"ddc":["000","004"],"scopus_import":"1","has_accepted_license":"1","status":"public","publist_id":"3259","publication_status":"published","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"citation":{"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>","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>.","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.","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>","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."},"pubrep_id":"83","file":[{"relation":"main_file","date_created":"2018-12-12T10:12:42Z","file_id":"4960","checksum":"792128f5455f0f40f1105f0398e05fa9","date_updated":"2020-07-14T12:46:09Z","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","content_type":"application/pdf","creator":"system","access_level":"open_access","file_size":225426}],"conference":{"end_date":"2011-06-24","location":"Toronto, Canada","start_date":"2011-06-21","name":"LICS: Logic in Computer Science"},"file_date_updated":"2020-07-14T12:46:09Z","type":"conference","author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"date_created":"2018-12-11T12:02:52Z","article_number":"5970226"},{"date_created":"2018-12-12T11:39:02Z","page":"14","author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:41Z","file":[{"file_size":366281,"access_level":"open_access","creator":"system","content_type":"application/pdf","file_name":"IST-2011-0003_IST-2011-0003.pdf","date_updated":"2020-07-14T12:46:41Z","file_id":"5461","checksum":"8491d0d48c4911620ecd5350b413c11e","relation":"main_file","date_created":"2018-12-12T11:53:00Z"}],"pubrep_id":"21","citation":{"apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p."},"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","status":"public","has_accepted_license":"1","ddc":["000","004"],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_published":"2011-04-04T00:00:00Z","abstract":[{"lang":"eng","text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”, allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable."}],"ec_funded":1,"oa":1,"language":[{"iso":"eng"}],"date_updated":"2026-07-07T14:01:43Z","publication_identifier":{"issn":["2664-1690"]},"fulldoi":"https://doi.org/10.15479/AT:IST-2011-0003","oa_version":"Published Version","year":"2011","day":"04","title":"Temporal specifications with accumulative values","_id":"5385","publisher":"IST Austria","related_material":{"record":[{"status":"public","relation":"later_version","id":"3356"},{"status":"public","relation":"later_version","id":"2038"}]},"doi":"10.15479/AT:IST-2011-0003","month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]