[{"language":[{"iso":"eng"}],"conference":{"start_date":"2010-04-25","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning","end_date":"2010-05-01","location":"Dakar, Senegal"},"publication":"Logic for Programming, Artificial Intelligence, and Reasoning","month":"05","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","place":"Berlin, Heidelberg","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"type":"conference","date_published":"2010-05-01T00:00:00Z","oa":1,"publication_identifier":{"isbn":["9783642175107"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642175114"]},"quality_controlled":"1","series_title":"LNCS","page":"103-118","editor":[{"last_name":"Clarke","first_name":"Edmund M","full_name":"Clarke, Edmund M"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"publisher":"Springer Nature","author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"}],"scopus_import":"1","_id":"10908","intvolume":"      6355","title":"ABC: Algebraic Bound Computation for loops","date_created":"2022-03-21T08:14:35Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","volume":6355,"acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","citation":{"mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>."},"year":"2010","date_updated":"2022-06-13T07:44:21Z","abstract":[{"text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts.","lang":"eng"}],"day":"01","doi":"10.1007/978-3-642-17511-4_7"},{"conference":{"start_date":"2010-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India","end_date":"2010-12-18"},"language":[{"iso":"eng"}],"oa_version":"Published Version","month":"01","has_accepted_license":"1","file":[{"checksum":"5845be5aa19791830f7407d8853f2df0","file_size":492344,"date_created":"2018-12-12T10:08:29Z","content_type":"application/pdf","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","date_updated":"2020-07-14T12:46:35Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"4690"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"publist_id":"7331","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"date_published":"2010-01-01T00:00:00Z","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"1 - 12","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:35Z","publication_status":"published","date_created":"2018-12-11T11:46:45Z","department":[{"_id":"ToHe"}],"pubrep_id":"948","title":"Expressiveness of streaming string transducers","alternative_title":["LIPIcs"],"intvolume":"         8","_id":"488","scopus_import":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"}],"volume":8,"ddc":["005"],"doi":"10.4230/LIPIcs.FSTTCS.2010.1","day":"01","abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"date_updated":"2021-01-12T08:01:00Z","citation":{"chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>.","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.","mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>.","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12."},"year":"2010"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","volume":37,"publist_id":"7284","abstract":[{"lang":"eng","text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool."}],"day":"01","doi":"10.1007/s10703-010-0102-0","type":"journal_article","date_published":"2010-12-01T00:00:00Z","year":"2010","citation":{"chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>."},"date_updated":"2021-01-12T08:01:28Z","publisher":"Springer","language":[{"iso":"eng"}],"quality_controlled":"1","page":"171 - 199","intvolume":"        37","title":"Doomed program points","month":"12","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:47:01Z","publication_status":"published","oa_version":"None","issue":"2-3","author":[{"last_name":"Hoenicke","first_name":"Jochen","full_name":"Hoenicke, Jochen"},{"full_name":"Leino, Kari","first_name":"Kari","last_name":"Leino"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"},{"full_name":"Schäf, Martin","first_name":"Martin","last_name":"Schäf"},{"last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"publication":"Formal Methods in System Design","_id":"533"},{"year":"2010","citation":{"ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>","apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2010). <i>Quantitative synthesis for concurrent programs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, <i>Quantitative synthesis for concurrent programs</i>. IST Austria, 2010.","chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>.","short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p."},"date_updated":"2023-02-23T11:24:08Z","type":"technical_report","date_published":"2010-10-07T00:00:00Z","publication_identifier":{"issn":["2664-1690"]},"day":"07","doi":"10.15479/AT:IST-2010-0004","oa":1,"abstract":[{"lang":"eng","text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements."}],"file":[{"creator":"system","file_id":"5515","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2010-0004_IST-2010-0004.pdf","date_updated":"2020-07-14T12:46:42Z","file_size":429101,"checksum":"da38782d2388a6fa32109d10bb9bad67","date_created":"2018-12-12T11:53:53Z"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"3366"}]},"ddc":["000","005"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","_id":"5388","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"date_created":"2018-12-12T11:39:03Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Published Version","publication_status":"published","pubrep_id":"24","alternative_title":["IST Austria Technical Report"],"month":"10","title":"Quantitative synthesis for concurrent programs","page":"17","file_date_updated":"2020-07-14T12:46:42Z","language":[{"iso":"eng"}],"publisher":"IST Austria"},{"publisher":"IST Austria","page":"24","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:42Z","publication_status":"published","oa_version":"Published Version","date_created":"2018-12-12T11:39:03Z","department":[{"_id":"ToHe"}],"alternative_title":["IST Austria Technical Report"],"pubrep_id":"25","title":"Simulation distances","month":"06","_id":"5389","has_accepted_license":"1","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna"}],"file":[{"file_id":"5547","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:42Z","content_type":"application/pdf","file_name":"IST-2010-0003_IST-2010-0003.pdf","date_created":"2018-12-12T11:54:25Z","checksum":"284ded99764e32a583a8ea83fcea254b","file_size":367246}],"related_material":{"record":[{"status":"public","id":"3249","relation":"later_version"},{"status":"public","id":"4393","relation":"later_version"}]},"status":"public","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.15479/AT:IST-2010-0003","publication_identifier":{"issn":["2664-1690"]},"day":"04","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"oa":1,"date_updated":"2023-02-23T12:09:16Z","citation":{"apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). <i>Simulation distances</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. <i>Simulation Distances</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. <i>Simulation Distances</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, <i>Simulation distances</i>. IST Austria, 2010.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.","mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p."},"year":"2010","date_published":"2010-06-04T00:00:00Z","type":"technical_report"},{"month":"04","pubrep_id":"27","alternative_title":["IST Austria Technical Report"],"title":"Model checking of linearizability of concurrent list implementations","publication_status":"published","oa_version":"Published Version","date_created":"2018-12-12T11:39:04Z","department":[{"_id":"ToHe"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"},{"full_name":"Chaudhuri, Swarat","first_name":"Swarat","last_name":"Chaudhuri"},{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"}],"_id":"5391","has_accepted_license":"1","publisher":"IST Austria","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:43Z","page":"27","abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable.","lang":"eng"}],"oa":1,"doi":"10.15479/AT:IST-2010-0001","publication_identifier":{"issn":["2664-1690"]},"day":"19","date_published":"2010-04-19T00:00:00Z","type":"technical_report","date_updated":"2023-02-23T12:09:09Z","year":"2010","citation":{"ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria, 2010.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>.","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"4390","relation":"later_version","status":"public"}]},"ddc":["004"],"status":"public","file":[{"checksum":"986645caad7dd85a6a091488f6c646dc","file_size":372286,"date_created":"2018-12-12T11:53:44Z","content_type":"application/pdf","file_name":"IST-2010-0001_IST-2010-0001.pdf","date_updated":"2020-07-14T12:46:43Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5505"}]},{"file":[{"date_updated":"2020-07-14T12:46:14Z","content_type":"application/pdf","file_name":"Lumpability_abstractions_of_rule-based_systems.pdf","date_created":"2019-01-31T12:09:09Z","file_size":907155,"checksum":"eaaba991a86fff37606b0eb5196878e8","file_id":"5904","creator":"kschuh","relation":"main_file","access_level":"open_access"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"3168","relation":"later_version","status":"public"}]},"date_published":"2010-10-30T00:00:00Z","type":"conference","publist_id":"2511","oa":1,"language":[{"iso":"eng"}],"conference":{"name":"MECBIC: Membrane Computing and Biologically Inspired Process Calculi","start_date":"2010-08-23","location":"Jena, Germany","end_date":"2010-08-23"},"has_accepted_license":"1","oa_version":"Submitted Version","month":"10","acknowledgement":"Jérôme Feret’s contribution was partially supported by the ABSTRACTCELL ANR-Chair of Excellence. Heinz Koeppl acknowledges the support from the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov acknowledges the support from SystemsX.ch, the Swiss Initiative in Systems Biology.","volume":40,"ddc":["570"],"date_updated":"2023-02-23T11:15:19Z","year":"2010","citation":{"apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule-based systems. In: Vol 40. Open Publishing Association; 2010:142-161.","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule-Based Systems,” 40:142–61. Open Publishing Association, 2010.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.","mla":"Feret, Jérôme, et al. <i>Lumpability Abstractions of Rule-Based Systems</i>. Vol. 40, Open Publishing Association, 2010, pp. 142–61.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2010. Lumpability abstractions of rule-based systems. MECBIC: Membrane Computing and Biologically Inspired Process Calculi, EPTCS, vol. 40, 142–161."},"external_id":{"arxiv":["1011.0496"]},"arxiv":1,"day":"30","abstract":[{"text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a math- ematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the com- binatorial complexity by quotienting the reachable set of molecular species, into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper we prove that this quotienting yields a sufficient condition for weak lumpability and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system. We illustrate the framework on a case study of the EGF/insulin receptor crosstalk.","lang":"eng"}],"page":"142-161","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:14Z","publisher":"Open Publishing Association","_id":"3719","scopus_import":1,"author":[{"last_name":"Feret","first_name":"Jérôme","full_name":"Feret, Jérôme"},{"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":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"},{"first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_created":"2018-12-11T12:04:47Z","title":"Lumpability abstractions of rule-based systems","alternative_title":["EPTCS"],"intvolume":"        40"},{"file":[{"date_updated":"2020-07-14T12:46:16Z","content_type":"application/pdf","file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","date_created":"2018-12-12T10:16:29Z","file_size":1919130,"checksum":"220239fae76f7b03c4d7f05d74ef426f","file_id":"5217","creator":"system","relation":"main_file","access_level":"open_access"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"journal_article","date_published":"2010-04-08T00:00:00Z","publist_id":"2374","oa":1,"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"BMC Systems Biology","oa_version":"Published Version","month":"04","acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","volume":4,"ddc":["005"],"year":"2010","citation":{"short":"V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.","mla":"Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>.","ista":"Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19.","ama":"Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. 2010;4(42):1-19. doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>","apa":"Wolf, V., Goel, R., Mateescu, M., &#38; Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>","ieee":"V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” <i>BMC Systems Biology</i>, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.","chicago":"Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>."},"date_updated":"2021-01-12T07:52:32Z","day":"08","doi":"10.1186/1752-0509-4-42","abstract":[{"text":"Background\r\n\r\nThe chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a &quot;window&quot; into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species.\r\nResults\r\n\r\nIn order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy.\r\n\r\n\r\nConclusions\r\n\r\nThe sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori.","lang":"eng"}],"quality_controlled":"1","page":"1 - 19","file_date_updated":"2020-07-14T12:46:16Z","publisher":"BioMed Central","scopus_import":1,"_id":"3834","issue":"42","author":[{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"},{"first_name":"Rushil","last_name":"Goel","full_name":"Goel, Rushil"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:25Z","publication_status":"published","intvolume":"         4","title":"Solving the chemical master equation using sliding windows","pubrep_id":"72"},{"file":[{"date_created":"2018-12-12T10:15:55Z","checksum":"81cb6f0babd97151b171d1ce86582831","file_size":671790,"date_updated":"2020-07-14T12:46:16Z","file_name":"IST-2012-68-v1+1_Hybrid_Numerical_Solution_of_the_Chemical_Master_Equation.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5179","creator":"system"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","type":"conference","date_published":"2010-09-29T00:00:00Z","oa":1,"publist_id":"2356","language":[{"iso":"eng"}],"conference":{"location":"Trento, Italy","end_date":"2010-10-01","start_date":"2010-09-29","name":"CMSB: Computational Methods in Systems Biology"},"has_accepted_license":"1","oa_version":"Submitted Version","month":"09","ddc":["004"],"year":"2010","citation":{"ieee":"T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.","chicago":"Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,” 55–65. Springer, 2010. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>.","ama":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>","apa":"Henzinger, T. A., Mateescu, M., Mikeev, L., &#38; Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>","ista":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65.","mla":"Henzinger, Thomas A., et al. <i>Hybrid Numerical Solution of the Chemical Master Equation</i>. Springer, 2010, pp. 55–65, doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>.","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65."},"date_updated":"2021-01-12T07:52:33Z","day":"29","doi":"10.1145/1839764.1839772","abstract":[{"lang":"eng","text":"We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe net- works of biochemical reactions and play an important role in the stochastic modeling of biological systems. Our approach is based on the construction of a stochastic hybrid model in which certain discrete random variables of the original Markov chain are approximated by continuous deterministic variables. We compute the solution of the stochastic hybrid model using a numerical algorithm that discretizes time and in each step performs a mutual update of the transient prob- ability distribution of the discrete stochastic variables and the values of the continuous deterministic variables. We im- plemented the algorithm and we demonstrate its usefulness and efficiency on several case studies from systems biology."}],"quality_controlled":"1","page":"55 - 65","file_date_updated":"2020-07-14T12:46:16Z","publisher":"Springer","scopus_import":1,"_id":"3838","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Mateescu, Maria","last_name":"Mateescu","first_name":"Maria"},{"last_name":"Mikeev","first_name":"Linar","full_name":"Mikeev, Linar"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:27Z","publication_status":"published","title":"Hybrid numerical solution of the chemical master equation","pubrep_id":"68"},{"file":[{"creator":"system","file_id":"4989","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","date_updated":"2020-07-14T12:46:16Z","checksum":"da69b13a2d9a7a316c909e09c1090cef","file_size":251265,"date_created":"2018-12-12T10:13:09Z"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"publist_id":"2357","date_published":"2010-01-01T00:00:00Z","type":"conference","conference":{"end_date":"2010-01-19","location":"Madrid, Spain","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","start_date":"2010-01-17"},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","month":"01","has_accepted_license":"1","acknowledgement":"The research was supported by the Swiss NSF.","volume":5944,"ddc":["005"],"doi":"10.1007/978-3-642-11319-2_14","day":"01","abstract":[{"lang":"eng","text":"We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types), such as upper-triangular, diagonal, etc. To gen- erate loop properties, we first transform a nested loop iterating over a multi- dimensional array into an equivalent collection of unnested loops. Then, we in- fer quantified loop invariants for each unnested loop using a generalization of a recurrence-based invariant generation technique. These loop invariants give us conditions on matrices from which we can derive matrix types automatically us- ing theorem provers. Invariant generation is implemented in the software package Aligator and types are derived by theorem provers and SMT solvers, including Vampire and Z3. When run on the Java matrix package JAMA, our tool was able to infer automatically all matrix types describing the matrix shapes guaranteed by JAMA’s API."}],"date_updated":"2021-01-12T07:52:33Z","citation":{"ista":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.","mla":"Henzinger, Thomas A., et al. <i>Invariant and Type Inference for Matrices</i>. Vol. 5944, Springer, 2010, pp. 163–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,” 5944:163–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Voronkov, A. (2010). Invariant and type inference for matrices (Vol. 5944, pp. 163–179). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>","ama":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. Invariant and type inference for matrices. In: Vol 5944. Springer; 2010:163-179. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>"},"year":"2010","publisher":"Springer","page":"163 - 179","quality_controlled":"1","file_date_updated":"2020-07-14T12:46:16Z","publication_status":"published","date_created":"2018-12-11T12:05:27Z","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"pubrep_id":"69","title":"Invariant and type inference for matrices","intvolume":"      5944","_id":"3839","scopus_import":1,"author":[{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hottelier, Thibaud","last_name":"Hottelier","first_name":"Thibaud"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"first_name":"Andrei","last_name":"Voronkov","full_name":"Voronkov, Andrei"}]},{"volume":45,"acknowledgement":"This talk surveys joint work with Roderick Bloem, Krishnendu Chatterjee, Laurent Doyen, and Barbara Jobstmann.","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/1706299.1706319","day":"17","abstract":[{"text":"Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. Correspondingly, classical methods for system analysis determine the truth value of a property, preferably giving a proof if the property is true, and a counterexample if the property is false; classical methods for system synthesis construct a system for which a property is true; classical methods for system transformation, composition, and abstraction aim to preserve the truth of properties. The boolean view is prevalent even if the system, the property, or both refer to numerical quantities, such as the times or probabilities of events. For example, a timed automaton either satisfies or violates a formula of a real-time logic; a stochastic process either satisfies or violates a formula of a probabilistic logic. The classical black-and-white view partitions the world into \"correct\" and \"incorrect\" systems, offering few nuances. In reality, of several systems that satisfy a property in the boolean sense, often some are more desirable than others, and of the many systems that violate a property, usually some are less objectionable than others. For instance, among the systems that satisfy the response property that every request be granted, we may prefer systems that grant requests quickly (the quicker, the better), or we may prefer systems that issue few unnecessary grants (the fewer, the better); and among the systems that violate the response property, we may prefer systems that serve many initial requests (the more, the better), or we may prefer systems that serve many requests in the long run (the greater the fraction of served to unserved requests, the better). Formally, while a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a directed metric on systems and properties, where the distance between a system and a property provides a measure of \"fit\" or \"desirability.\" There are many ways how such distances can be defined. In a linear-time framework, one assigns numerical values to individual behaviors before assigning values to systems and properties, which are sets of behaviors. For example, the value of a single behavior may be a discounted value, which is largely determined by a prefix of the behavior, e.g., by the number of requests that are granted before the first request that is not granted; or a limit value, which is independent of any finite prefix. A limit value may be an average, such as the average response time over an infinite sequence of requests and grants, or a supremum, such as the worst-case response time. Similarly, the value of a set of behaviors may be an extremum or an average across the values of all behaviors in the set: in this way one can measure the worst of all possible average-case response times, or the average of all possible worst-case response times, etc. Accordingly, the distance between two sets of behaviors may be defined as the worst or average difference between the values of corresponding behaviors. In summary, we propagate replacing boolean specifications for the correctness of systems with quantitative measures for the desirability of systems. In quantitative analysis, the aim is to compute the distance between a system and a property (or between two systems, or two properties); in quantitative synthesis, the objective is to construct a system that has minimal distance from a given property. Multiple quantitative measures can be prioritized (e.g., combined lexicographically into a single measure) or studied along the Pareto curve. Quantitative transformations, compositions, and abstractions of systems are useful if they allow us to bound the induced change in distance from a property. We present some initial results in some of these directions. We also give some potential applications, which not only generalize tradiditional correctness concerns in the functional, timed, and probabilistic domains, but also capture such system measures as resource use, performance, cost, reliability, and robustness.","lang":"eng"}],"publist_id":"2354","date_updated":"2021-01-12T07:52:34Z","year":"2010","citation":{"ieee":"T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158.","chicago":"Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,” 45:157–58. ACM, 2010. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>.","apa":"Henzinger, T. A. (2010). From boolean to quantitative notions of correctness (Vol. 45, pp. 157–158). Presented at the POPL: Principles of Programming Languages, Madrid, Spain: ACM. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>","ama":"Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>","ista":"Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.","mla":"Henzinger, Thomas A. <i>From Boolean to Quantitative Notions of Correctness</i>. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>.","short":"T.A. Henzinger, in:, ACM, 2010, pp. 157–158."},"date_published":"2010-01-17T00:00:00Z","type":"conference","publisher":"ACM","conference":{"location":"Madrid, Spain","end_date":"2010-01-23","name":"POPL: Principles of Programming Languages","start_date":"2010-01-17"},"page":"157 - 158","quality_controlled":"1","language":[{"iso":"eng"}],"publication_status":"published","oa_version":"None","date_created":"2018-12-11T12:05:27Z","department":[{"_id":"ToHe"}],"month":"01","title":"From boolean to quantitative notions of correctness","intvolume":"        45","_id":"3840","scopus_import":1,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"issue":"1"},{"intvolume":"         4","title":"Fast adaptive uniformization of the chemical master equation","pubrep_id":"66","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:28Z","publication_status":"published","issue":"6","author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mateescu, Maria","first_name":"Maria","last_name":"Mateescu"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"scopus_import":1,"_id":"3842","publisher":"Institution of Engineering and Technology","file_date_updated":"2020-07-14T12:46:16Z","quality_controlled":"1","page":"441 - 452","abstract":[{"text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). The uniformization technique is an efficient method to compute probability distributions of a CTMC if the number of states is manageable. However, the size of a CTMC that represents a biochemical reaction network is usually far beyond what is feasible. In this paper we present an on-the-fly variant of uniformization, where we improve the original algorithm at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks.","lang":"eng"}],"day":"15","doi":"10.1049/iet-syb.2010.0005","year":"2010","citation":{"chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>. Institution of Engineering and Technology, 2010. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” <i>IET Systems Biology</i>, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. Institution of Engineering and Technology. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. 2010;4(6):441-452. doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.","mla":"Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>."},"date_updated":"2023-02-23T11:45:08Z","ddc":["570"],"volume":4,"month":"11","oa_version":"Submitted Version","has_accepted_license":"1","publication":"IET Systems Biology","language":[{"iso":"eng"}],"oa":1,"publist_id":"2349","type":"journal_article","date_published":"2010-11-15T00:00:00Z","related_material":{"record":[{"status":"public","id":"3843","relation":"earlier_version"}]},"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"9a3bde48f43203991a0b3c6a277c2f5b","file_size":222890,"date_created":"2018-12-12T10:17:02Z","file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:16Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5254"}]},{"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","relation":"main_file","file_id":"4790","creator":"system","date_created":"2018-12-12T10:10:05Z","checksum":"913af269da6710f2174f470b48ab7a82","file_size":186143,"date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","content_type":"application/pdf"}],"type":"conference","date_published":"2010-10-01T00:00:00Z","publist_id":"2342","oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Yogyakarta, Indonesia","end_date":"2010-10-15"},"has_accepted_license":"1","month":"10","oa_version":"Submitted Version","ddc":["005"],"volume":6397,"year":"2010","citation":{"short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.","mla":"Henzinger, Thomas A., et al. <i>Aligators for Arrays</i>. Vol. 6397, Springer, 2010, pp. 348–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>.","ista":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.","ama":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,” 6397:348–56. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356."},"date_updated":"2021-01-12T07:52:37Z","abstract":[{"lang":"eng","text":"This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out inductive reasoning over array content. The Aligators’ loop extraction module allows treatment of multi-path loops by exploiting their commutativity and serializability properties. Our experience in applying Aligators on a collection of loops from open source software projects indicates the applicability of recurrence and algebraic solving techniques for reasoning about arrays."}],"day":"01","doi":"10.1007/978-3-642-16242-8_25","file_date_updated":"2020-07-14T12:46:17Z","quality_controlled":"1","page":"348 - 356","publisher":"Springer","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Hottelier","first_name":"Thibaud","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"scopus_import":1,"_id":"3845","intvolume":"      6397","pubrep_id":"64","title":"Aligators for arrays","alternative_title":["LNCS"],"date_created":"2018-12-11T12:05:29Z","department":[{"_id":"ToHe"}],"publication_status":"published"},{"citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.","mla":"Didier, Frédéric, et al. <i>SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks</i>. IEEE, 2010, pp. 193–94, doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: IEEE; 2010:193-194. doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,” 193–94. IEEE, 2010. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>."},"year":"2010","date_updated":"2021-01-12T07:52:37Z","day":"14","doi":"10.1109/QEST.2010.33","abstract":[{"lang":"eng","text":"The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, a tool for stochastic analysis of biochemical reaction networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient solutions of biochemical reaction networks. Biochemical reactions networks represent biological systems studied at a molecular level and these reactions can be modeled as transitions of a Markov chain. SABRE accepts as input the formalism of guarded commands, which it interprets either as continuous-time or as discrete-time Markov chains. Besides operating in a stochastic mode, SABRE may also perform a deterministic analysis by directly computing a mean-field approximation of the system under study. We illustrate the different functionalities of SABRE by means of biological case studies."}],"ddc":["004"],"scopus_import":1,"_id":"3847","author":[{"full_name":"Didier, Frédéric","first_name":"Frédéric","last_name":"Didier"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Mateescu, Maria","last_name":"Mateescu","first_name":"Maria"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_created":"2018-12-11T12:05:29Z","publication_status":"published","pubrep_id":"63","title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks","quality_controlled":"1","page":"193 - 194","file_date_updated":"2020-07-14T12:46:17Z","publisher":"IEEE","type":"conference","date_published":"2010-10-14T00:00:00Z","oa":1,"publist_id":"2339","file":[{"relation":"main_file","access_level":"open_access","creator":"system","file_id":"4726","file_size":433824,"checksum":"38707b149d2174f01be406e794ffa849","date_created":"2018-12-12T10:09:03Z","content_type":"application/pdf","file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","date_updated":"2020-07-14T12:46:17Z"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa_version":"Submitted Version","month":"10","language":[{"iso":"eng"}],"conference":{"location":"Williamsburg, USA","end_date":"2010-09-18","name":"QEST: Quantitative Evaluation of Systems","start_date":"2010-09-15"}},{"language":[{"iso":"eng"}],"conference":{"location":"Paris, France","end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31"},"has_accepted_license":"1","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"}],"oa_version":"Submitted Version","month":"11","file":[{"date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","date_created":"2018-12-12T10:15:41Z","checksum":"4f753ae99d076553fb8733e2c8b390e2","file_size":233260,"file_id":"5163","creator":"system","relation":"main_file","access_level":"open_access"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","type":"conference","date_published":"2010-11-18T00:00:00Z","oa":1,"publist_id":"2328","quality_controlled":"1","ec_funded":1,"page":"269 - 283","file_date_updated":"2020-07-14T12:46:17Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":1,"_id":"3853","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Philippe","last_name":"Rannou","full_name":"Rannou, Philippe"}],"department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:31Z","publication_status":"published","intvolume":"      6269","alternative_title":["LNCS"],"pubrep_id":"62","title":"Mean-payoff automaton expressions","volume":6269,"ddc":["000","005"],"year":"2010","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &#38; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>.","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283."},"date_updated":"2021-01-12T07:52:40Z","day":"18","doi":"10.1007/978-3-642-15375-4_19","abstract":[{"lang":"eng","text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions."}]},{"file":[{"content_type":"application/pdf","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","date_updated":"2020-07-14T12:46:17Z","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","file_size":173948,"date_created":"2018-12-12T10:13:51Z","creator":"system","file_id":"5038","relation":"main_file","access_level":"open_access"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5395"}]},"type":"conference","date_published":"2010-08-01T00:00:00Z","oa":1,"publist_id":"2326","language":[{"iso":"eng"}],"conference":{"location":"Brno, Czech Republic","end_date":"2010-08-27","start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science"},"has_accepted_license":"1","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"}],"oa_version":"Submitted Version","month":"08","volume":6281,"ddc":["004"],"citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. Vol. 6281, Springer, 2010, pp. 258–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269."},"year":"2010","date_updated":"2023-02-23T12:24:22Z","day":"01","doi":"10.1007/978-3-642-15155-2_24","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives."}],"quality_controlled":"1","ec_funded":1,"page":"258 - 269","file_date_updated":"2020-07-14T12:46:17Z","publisher":"Springer","scopus_import":1,"_id":"3855","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:05:32Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","intvolume":"      6281","alternative_title":["LNCS"],"pubrep_id":"61","title":"Qualitative analysis of partially-observable Markov Decision Processes"},{"citation":{"ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.","mla":"Chatterjee, Krishnendu, et al. <i>Randomness for Free</i>. Vol. 6281, Springer, 2010, pp. 246–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>"},"year":"2010","date_updated":"2023-02-23T10:12:00Z","day":"06","doi":"10.1007/978-3-642-15155-2_23","abstract":[{"text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. ","lang":"eng"}],"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","volume":6281,"scopus_import":1,"_id":"3856","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:32Z","publication_status":"published","intvolume":"      6281","pubrep_id":"60","title":"Randomness for free","alternative_title":["LNCS"],"quality_controlled":"1","ec_funded":1,"page":"246 - 257","publisher":"Springer","type":"conference","date_published":"2010-09-06T00:00:00Z","publist_id":"2325","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1006.0673v1","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"1731"}]},"project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"Preprint","month":"09","language":[{"iso":"eng"}],"conference":{"start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","location":"Brno, Czech Republic"}},{"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2010-09-21","location":"Singapore, Singapore","end_date":"2010-09-24"},"language":[{"iso":"eng"}],"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"None","month":"10","status":"public","related_material":{"record":[{"id":"5392","relation":"earlier_version","status":"public"}]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"2324","type":"conference","date_published":"2010-10-12T00:00:00Z","publisher":"Springer","ec_funded":1,"quality_controlled":"1","page":"1 - 16","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:33Z","publication_status":"published","intvolume":"      6252","alternative_title":["LNCS"],"pubrep_id":"28","title":"Probabilistic Automata on infinite words: decidability and undecidability results","scopus_import":1,"_id":"3857","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":6252,"day":"12","doi":"10.1007/978-3-642-15643-4_1","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 an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"citation":{"ista":"Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. Vol. 6252, Springer, 2010, pp. 1–16, doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","ieee":"K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>.","ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>"},"year":"2010","date_updated":"2023-02-23T12:24:14Z"},{"related_material":{"link":[{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","description":"eBook available via IST BookList","relation":"other"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","volume":6246,"abstract":[{"lang":"eng","text":"This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications."}],"publist_id":"2322","doi":"10.1007/978-3-642-15297-9","day":"20","date_published":"2010-09-20T00:00:00Z","type":"conference_editor","date_updated":"2019-11-14T08:42:42Z","year":"2010","citation":{"ama":"Chatterjee K, Henzinger TA, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol 6246. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>","apa":"Chatterjee, K., &#38; Henzinger, T. A. (Eds.). (2010). <i>Formal modeling and analysis of timed systems</i> (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>.","ieee":"K. Chatterjee and T. A. Henzinger, Eds., <i>Formal modeling and analysis of timed systems</i>, vol. 6246. Springer, 2010.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>.","short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.","ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p."},"conference":{"start_date":"2010-09-08","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Klosterneuburg, Austria","end_date":"2010-09-10"},"publisher":"Springer","editor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"language":[{"iso":"eng"}],"quality_controlled":"1","month":"09","alternative_title":["LNCS"],"title":"Formal modeling and analysis of timed systems","intvolume":"      6246","oa_version":"None","publication_status":"published","date_created":"2018-12-11T12:05:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"3859"},{"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"_id":"3860","scopus_import":1,"alternative_title":["LIPIcs"],"pubrep_id":"59","title":"Generalized mean-payoff and energy games","intvolume":"         8","publication_status":"published","date_created":"2018-12-11T12:05:34Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:18Z","page":"505 - 516","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2021-01-12T07:52:44Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Generalized Mean-Payoff and Energy Games</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516."},"year":"2010","abstract":[{"lang":"eng","text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete."}],"doi":"10.4230/LIPIcs.FSTTCS.2010.505","day":"13","ddc":["005"],"volume":8,"has_accepted_license":"1","month":"12","oa_version":"Submitted Version","language":[{"iso":"eng"}],"conference":{"start_date":"2010-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India","end_date":"2010-12-18"},"date_published":"2010-12-13T00:00:00Z","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"publist_id":"2321","oa":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","file_id":"5147","access_level":"open_access","relation":"main_file","file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","file_size":178278,"checksum":"1caabd6319b979927208117a41192637","date_created":"2018-12-12T10:15:27Z"},{"date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2016-59-v2+1_2_1_.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:15:28Z","file_size":477976,"checksum":"3a59759ceeacdb5b578f3803d5e6769b","file_id":"5148","creator":"system","access_level":"open_access","relation":"main_file"}]}]