[{"file_date_updated":"2020-07-14T12:45:42Z","publist_id":"4384","ec_funded":1,"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","acknowledgement":"ERC Grant QUALITY. ","year":"2013","date_updated":"2020-08-11T10:09:47Z","date_created":"2018-12-11T11:58:08Z","volume":7966,"author":[{"first_name":"Shaull","last_name":"Almagor","full_name":"Almagor, Shaull"},{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"month":"07","quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","location":"Riga, Latvia","start_date":"2013-07-08"},"doi":"10.1007/978-3-642-39212-2_3","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL."}],"issue":"Part 2","ddc":["000"],"status":"public","title":"Formalizing and reasoning about quality","intvolume":" 7966","_id":"2517","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"file_size":363031,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2013_ICALP_Almagor.pdf","checksum":"85afbf6c18a2c7e377c52c9410e2d824","date_updated":"2020-07-14T12:45:42Z","date_created":"2020-05-15T11:16:12Z","relation":"main_file","file_id":"7860"}],"series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"01","has_accepted_license":"1","article_processing_charge":"No","page":"15 - 27","citation":{"ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:10.1007/978-3-642-39212-2_3","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","apa":"Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3","mla":"Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3.","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_3."},"date_published":"2013-07-01T00:00:00Z"},{"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"volume":79,"date_updated":"2021-01-12T07:00:16Z","date_created":"2018-12-11T11:59:57Z","acknowledgement":"This work was partially supported in part by the NSF grants CCR-0132780, CNS-0720884, CCR-0225610, by the Swiss National Science Foundation, ERC Start Grant Graph Games (Project No. 279307), FWF NFN Grant S11407-N23 (RiSE), and a Microsoft faculty fellows","year":"2013","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","publist_id":"3938","ec_funded":1,"file_date_updated":"2020-07-14T12:45:51Z","doi":"10.1016/j.jcss.2012.12.001","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","month":"08","pubrep_id":"388","oa_version":"Published Version","file":[{"file_size":425488,"content_type":"application/pdf","creator":"system","file_name":"IST-2015-388-v1+1_1-s2.0-S0022000012001778-main.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:51Z","date_created":"2018-12-12T10:18:48Z","checksum":"6d3ee12cceb946a0abe69594b6a22409","relation":"main_file","file_id":"5370"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2854","intvolume":" 79","title":"Strategy improvement for concurrent reachability and turn based stochastic safety games","ddc":["000"],"status":"public","issue":"5","abstract":[{"lang":"eng","text":"We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of the fact that in concurrent reachability games, for all ε>0, memoryless ε-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an ε-optimal strategy achieves the objective with probability within ε of the value of the game. In contrast to previous proofs of this fact, our proof is more elementary and more combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives. Finally, we present a strategy-improvement algorithm for turn-based stochastic games (where each player selects moves in turns) with safety objectives. Our algorithms yield sequences of player-1 strategies which ensure probabilities of winning that converge monotonically (from below) to the value of the game. © 2012 Elsevier Inc."}],"type":"journal_article","date_published":"2013-08-01T00:00:00Z","citation":{"short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657.","mla":"Chatterjee, Krishnendu, et al. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” Journal of Computer and System Sciences, vol. 79, no. 5, Elsevier, 2013, pp. 640–57, doi:10.1016/j.jcss.2012.12.001.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” Journal of Computer and System Sciences. Elsevier, 2013. https://doi.org/10.1016/j.jcss.2012.12.001.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 2013;79(5):640-657. doi:10.1016/j.jcss.2012.12.001","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.","apa":"Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2012.12.001","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657."},"publication":"Journal of Computer and System Sciences","page":"640 - 657","article_type":"original","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":1},{"year":"2013","_id":"2885","acknowledgement":"Red Hat Czech Republic, Y Soft","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"full_name":"Kucera, Antonin","first_name":"Antonin","last_name":"Kucera"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Nesetril, Jaroslav","first_name":"Jaroslav","last_name":"Nesetril"},{"first_name":"Tomas","last_name":"Vojnar","full_name":"Vojnar, Tomas"},{"last_name":"Antos","first_name":"David","full_name":"Antos, David"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"intvolume":" 7721","status":"public","title":"Mathematical and Engineering Methods in Computer Science","publication_status":"published","volume":7721,"oa_version":"None","date_updated":"2019-08-02T12:37:55Z","date_created":"2018-12-11T12:00:08Z","type":"conference_editor","alternative_title":["LNCS"],"publist_id":"3874","abstract":[{"lang":"eng","text":"This volume contains the post-proceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computer-aided analysis and verification, applications of game theory in computer science, networks and security, modern trends of graph theory in computer science, electronic systems design and testing, and quantum information processing."}],"citation":{"ama":"Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D, eds. Mathematical and Engineering Methods in Computer Science. Vol 7721. Springer; 2013:1-228. doi:10.1007/978-3-642-36046-6","ieee":"A. Kucera, T. A. Henzinger, J. Nesetril, T. Vojnar, and D. Antos, Eds., Mathematical and Engineering Methods in Computer Science, vol. 7721. Springer, 2013, pp. 1–228.","apa":"Kucera, A., Henzinger, T. A., Nesetril, J., Vojnar, T., & Antos, D. (Eds.). (2013). Mathematical and Engineering Methods in Computer Science (Vol. 7721, pp. 1–228). Presented at the MEMICS: Mathematical and Engineering methods in computer science, Znojmo, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-36046-6","ista":"Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D eds. 2013. Mathematical and Engineering Methods in Computer Science, Springer,p.","short":"A. Kucera, T.A. Henzinger, J. Nesetril, T. Vojnar, D. Antos, eds., Mathematical and Engineering Methods in Computer Science, Springer, 2013.","mla":"Kucera, Antonin, et al., editors. Mathematical and Engineering Methods in Computer Science. Vol. 7721, Springer, 2013, pp. 1–228, doi:10.1007/978-3-642-36046-6.","chicago":"Kucera, Antonin, Thomas A Henzinger, Jaroslav Nesetril, Tomas Vojnar, and David Antos, eds. Mathematical and Engineering Methods in Computer Science. Vol. 7721. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-36046-6."},"page":"1 - 228","quality_controlled":"1","doi":"10.1007/978-3-642-36046-6","date_published":"2013-01-09T00:00:00Z","conference":{"start_date":"2012-10-25","location":"Znojmo, Czech Republic","end_date":"2012-10-28","name":"MEMICS: Mathematical and Engineering methods in computer science"},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","month":"01","day":"09"},{"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"12","month":"06","doi":"10.15479/AT:IST-2013-123-v1-1","date_published":"2013-06-12T00:00:00Z","language":[{"iso":"eng"}],"citation":{"chicago":"Henzinger, Thomas A, and Ali Sezgin. How Free Is Your Linearizable Concurrent Data Structure? IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-123-v1-1.","mla":"Henzinger, Thomas A., and Ali Sezgin. How Free Is Your Linearizable Concurrent Data Structure? IST Austria, 2013, doi:10.15479/AT:IST-2013-123-v1-1.","short":"T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.","ista":"Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.","ieee":"T. A. Henzinger and A. Sezgin, How free is your linearizable concurrent data structure? IST Austria, 2013.","apa":"Henzinger, T. A., & Sezgin, A. (2013). How free is your linearizable concurrent data structure? IST Austria. https://doi.org/10.15479/AT:IST-2013-123-v1-1","ama":"Henzinger TA, Sezgin A. How Free Is Your Linearizable Concurrent Data Structure? IST Austria; 2013. doi:10.15479/AT:IST-2013-123-v1-1"},"oa":1,"page":"16","file_date_updated":"2020-07-14T12:46:45Z","abstract":[{"lang":"eng","text":"Linearizability requires that the outcome of calls by competing threads to a concurrent data structure is the same as some sequential execution where each thread has exclusive access to the data structure. In an ordered data structure, such as a queue or a stack, linearizability is ensured by requiring threads commit in the order dictated by the sequential semantics of the data structure; e.g., in a concurrent queue implementation a dequeue can only remove the oldest element. \r\nIn this paper, we investigate the impact of this strict ordering, by comparing what linearizability allows to what existing implementations do. We first give an operational definition for linearizability which allows us to build the most general linearizable implementation as a transition system for any given sequential specification. We then use this operational definition to categorize linearizable implementations based on whether they are bound or free. In a bound implementation, whenever all threads observe the same logical state, the updates to the logical state and the temporal order of commits coincide. All existing queue implementations we know of are bound. We then proceed to present, to the best of our knowledge, the first ever free queue implementation. Our experiments show that free implementations have the potential for better performance by suffering less from contention."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"pubrep_id":"123","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","last_name":"Sezgin"}],"file":[{"relation":"main_file","file_id":"5480","checksum":"ce580605ae9756a8c99d7b403ebb8eed","date_created":"2018-12-12T11:53:19Z","date_updated":"2020-07-14T12:46:45Z","access_level":"open_access","file_name":"IST-2013-123-v1+1_main-concur2013.pdf","content_type":"application/pdf","file_size":249790,"creator":"system"}],"oa_version":"Published Version","date_updated":"2020-07-14T23:04:47Z","date_created":"2018-12-12T11:39:07Z","_id":"5402","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publisher":"IST Austria","department":[{"_id":"ToHe"}],"publication_status":"published","title":"How free is your linearizable concurrent data structure?","status":"public","ddc":["000","004"]},{"type":"conference","publist_id":"5835","ec_funded":1,"abstract":[{"text":"We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1376","year":"2013","publisher":"IEEE","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Distributed synthesis for LTL fragments","publication_status":"published","status":"public","related_material":{"record":[{"id":"5406","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"oa_version":"None","date_created":"2018-12-11T11:51:40Z","date_updated":"2023-02-23T12:24:53Z","day":"11","month":"12","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In 13th International Conference on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679386.","mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: 13th International Conference on Formal Methods in Computer-Aided Design. IEEE; 2013:18-25. doi:10.1109/FMCAD.2013.6679386"},"publication":"13th International Conference on Formal Methods in Computer-Aided Design","page":"18 - 25","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","date_published":"2013-12-11T00:00:00Z","doi":"10.1109/FMCAD.2013.6679386","conference":{"end_date":"2013-10-23","start_date":"2013-10-20","location":"Portland, OR, United States","name":"FMCAD: Formal Methods in Computer-Aided Design"},"language":[{"iso":"eng"}]},{"page":"11","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed Synthesis for LTL Fragments. IST Austria; 2013. doi:10.15479/AT:IST-2013-130-v1-1","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.","mla":"Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments. IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-130-v1-1."},"oa":1,"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2013-130-v1-1","date_published":"2013-07-08T00:00:00Z","day":"08","month":"07","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","ddc":["005"],"status":"public","title":"Distributed synthesis for LTL Fragments","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5406","year":"2013","date_created":"2018-12-12T11:39:09Z","date_updated":"2023-02-21T17:01:26Z","file":[{"access_level":"open_access","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","content_type":"application/pdf","file_size":467895,"creator":"system","relation":"main_file","file_id":"5540","checksum":"855513ebaf6f72228800c5fdb522f93c","date_created":"2018-12-12T11:54:18Z","date_updated":"2020-07-14T12:46:45Z"}],"oa_version":"Published Version","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"},{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"related_material":{"record":[{"id":"1376","relation":"later_version","status":"public"}]},"pubrep_id":"130","alternative_title":["IST Austria Technical Report"],"type":"technical_report","abstract":[{"lang":"eng","text":"We consider the distributed synthesis problem fortemporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTLand our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3)Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition."}],"file_date_updated":"2020-07-14T12:46:45Z"},{"month":"08","oa":1,"quality_controlled":"1","conference":{"location":"Buenos Aires, Argentina","start_date":"2013-08-27","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory"},"doi":"10.1007/978-3-642-40184-8_20","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:38Z","publist_id":"4599","year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5417"}]},"date_updated":"2023-02-23T12:25:26Z","date_created":"2018-12-11T11:57:00Z","volume":8052,"series_title":"Lecture Notes in Computer Science","day":"01","has_accepted_license":"1","citation":{"apa":"Henzinger, T. A., & Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. https://doi.org/10.1007/978-3-642-40184-8_20","ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.","ama":"Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:10.1007/978-3-642-40184-8_20","chicago":"Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40184-8_20.","short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","mla":"Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. Vol. 8052, Springer, 2013, pp. 273–87, doi:10.1007/978-3-642-40184-8_20."},"page":"273 - 287","date_published":"2013-08-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2327","status":"public","ddc":["005","000"],"title":"From model checking to model measuring","intvolume":" 8052","pubrep_id":"129","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"5301","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:17:45Z","access_level":"open_access","file_name":"IST-2013-129-v1+1_concur.pdf","content_type":"application/pdf","file_size":378587,"creator":"system"}]},{"alternative_title":["IST Austria Technical Report"],"type":"technical_report","abstract":[{"lang":"eng","text":"In order to guarantee that each method of a data structure updates the logical state exactly once, al-most all non-blocking implementations employ Compare-And-Swap (CAS) based synchronization. For FIFO queue implementations this translates into concurrent enqueue or dequeue methods competing among themselves to update the same variable, the tail or the head, respectively, leading to high contention and poor scalability. Recent non-blocking queue implementations try to alleviate high contentionby increasing the number of contention points, all the while using CAS-based synchronization. Furthermore, obtaining a wait-free implementation with competition is achieved by additional synchronization which leads to further degradation of performance.In this paper we formalize the notion of competitiveness of a synchronizing statement which can beused as a measure for the scalability of concurrent implementations. We present a new queue implementation, the Speculative Pairing (SP) queue, which, as we show, decreases competitiveness by using Fetch-And-Increment (FAI) instead of CAS. We prove that the SP queue is linearizable and lock-free.We also show that replacing CAS with FAI leads to wait-freedom for dequeue methods without an adverse effect on performance. In fact, our experiments suggest that the SP queue can perform and scale better than the state-of-the-art queue implementations."}],"file_date_updated":"2020-07-14T12:47:30Z","publisher":"IST Austria","department":[{"_id":"ToHe"}],"title":"Replacing competition with cooperation to achieve scalable lock-free FIFO queues ","publication_status":"published","status":"public","ddc":["000","005"],"year":"2013","_id":"6440","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","file_name":"2013_TechRep_Henzinger.pdf","file_size":549684,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"6441","checksum":"a219ba4eada6cd62befed52262ee15d4","date_created":"2019-05-13T14:11:39Z","date_updated":"2020-07-14T12:47:30Z"}],"oa_version":"Published Version","date_created":"2019-05-13T14:13:27Z","date_updated":"2020-07-14T23:06:19Z","pubrep_id":"124","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Payer, Hannes","first_name":"Hannes","last_name":"Payer"},{"first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"day":"13","month":"06","page":"23","citation":{"ista":"Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.","apa":"Henzinger, T. A., Payer, H., & Sezgin, A. (2013). Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria. https://doi.org/10.15479/AT:IST-2013-124-v1-1","ieee":"T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.","ama":"Henzinger TA, Payer H, Sezgin A. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria; 2013. doi:10.15479/AT:IST-2013-124-v1-1","chicago":"Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-124-v1-1.","mla":"Henzinger, Thomas A., et al. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria, 2013, doi:10.15479/AT:IST-2013-124-v1-1.","short":"T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013."},"oa":1,"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2013-124-v1-1","date_published":"2013-06-13T00:00:00Z"},{"conference":{"name":"CAV 2013","end_date":"2013-07-19","location":"Saint Petersburg, Russia","start_date":"2013-07-13"},"doi":"10.1007/978-3-642-39799-8_11","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642397981","9783642397998"]},"author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","last_name":"Dragoi","full_name":"Dragoi, Cezara"},{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"date_updated":"2023-09-05T14:16:07Z","date_created":"2018-12-18T13:10:21Z","volume":8044,"year":"2013","publication_status":"published","publisher":"Springer Berlin Heidelberg","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:10Z","ec_funded":1,"place":"Berlin, Heidelberg","date_published":"2013-01-01T00:00:00Z","publication":"Computer Aided Verification","citation":{"apa":"Dragoi, C., Gupta, A., & Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In Computer Aided Verification (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-39799-8_11","ieee":"C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in Computer Aided Verification, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.","ista":"Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.","ama":"Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:10.1007/978-3-642-39799-8_11","chicago":"Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” In Computer Aided Verification, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39799-8_11.","short":"C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.","mla":"Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11."},"page":"174-190","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","series_title":"CAV","pubrep_id":"195","file":[{"creator":"dernst","content_type":"application/pdf","file_size":236480,"access_level":"open_access","file_name":"2013_CAV_Dragoi.pdf","checksum":"a901cc6b71db08b61c0d4c0cbacc6287","date_created":"2018-12-18T13:13:33Z","date_updated":"2020-07-14T12:47:10Z","file_id":"5748","relation":"main_file"}],"oa_version":"None","_id":"5747","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["005"],"title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","intvolume":" 8044","type":"book_chapter"},{"article_processing_charge":"No","has_accepted_license":"1","day":"05","date_published":"2013-09-05T00:00:00Z","citation":{"ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013.","apa":"Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:1405","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:10.15479/at:ista:1405","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. https://doi.org/10.15479/at:ista:1405.","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","mla":"Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405."},"page":"134","abstract":[{"text":"Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"file":[{"file_id":"9176","relation":"main_file","date_updated":"2021-02-22T11:28:36Z","date_created":"2021-02-22T11:28:36Z","success":1,"checksum":"ed2d7b52933d134e8dc69d569baa284e","file_name":"2013_Zufferey_thesis_final.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":1514906},{"file_size":1378313,"content_type":"application/pdf","creator":"cchlebak","file_name":"2013_Zufferey_thesis_final_pdfa.pdf","access_level":"closed","date_created":"2021-11-16T14:42:52Z","date_updated":"2021-11-17T13:47:58Z","checksum":"cecc4c4b14225bee973d32e3dba91a55","relation":"main_file","file_id":"10298"}],"oa_version":"Published Version","_id":"1405","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["000"],"title":"Analysis of dynamic message passing programs","publication_identifier":{"issn":["2663-337X"]},"month":"09","doi":"10.15479/at:ista:1405","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"degree_awarded":"PhD","main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"oa":1,"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"publist_id":"5802","ec_funded":1,"file_date_updated":"2021-11-17T13:47:58Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"2847"},{"status":"public","relation":"part_of_dissertation","id":"3251"},{"status":"public","relation":"part_of_dissertation","id":"4361"}]},"author":[{"full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:51:50Z","date_updated":"2023-09-07T11:36:37Z","year":"2013","acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS 2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this part is mostly related to the implementation. The theory required to understand the method and its implementation is quickly recalled to make the thesis self-contained, but should not be considered as a contribution. For the details of the methods, we refer the reader to the orig- inal publication [13] and the corresponding technical report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar, and Thomas Wies. I also would like to thank the people who supported over the past 4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on projects I was interested in. My collaborators, especially Thomas Wies with whom I worked since the beginning. The members of my thesis committee, Viktor Kun- cak and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny, Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created an enjoyable environment. ","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"publication_status":"published"},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Depth-Bounded Systems form an expressive class of well-structured transition systems. They can model a wide range of concurrent infinite-state systems including those with dynamic thread creation, dynamically changing communication topology, and complex shared heap structures. We present the first method to automatically prove fair termination of depth-bounded systems. Our method uses a numerical abstraction of the system, which we obtain by systematically augmenting an over-approximation of the system’s reachable states with a finite set of counters. This numerical abstraction can be analyzed with existing termination provers. What makes our approach unique is the way in which it exploits the well-structuredness of the analyzed system. We have implemented our work in a prototype tool and used it to automatically prove liveness properties of complex concurrent systems, including nonblocking algorithms such as Treiber’s stack and several distributed processes. Many of these examples are beyond the scope of termination analyses that are based on traditional counter abstractions."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2847","title":"Structural Counter Abstraction","status":"public","intvolume":" 7795","oa_version":"Submitted Version","scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"01","citation":{"chicago":"Bansal, Kshitij, Eric Koskinen, Thomas Wies, and Damien Zufferey. “Structural Counter Abstraction.” Edited by Nir Piterman and Scott Smolka. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-36742-7_5.","mla":"Bansal, Kshitij, et al. Structural Counter Abstraction. Edited by Nir Piterman and Scott Smolka, vol. 7795, Springer, 2013, pp. 62–77, doi:10.1007/978-3-642-36742-7_5.","short":"K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77.","ista":"Bansal K, Koskinen E, Wies T, Zufferey D. 2013. Structural Counter Abstraction (eds. N. Piterman & S. Smolka). 7795, 62–77.","apa":"Bansal, K., Koskinen, E., Wies, T., & Zufferey, D. (2013). Structural Counter Abstraction. (N. Piterman & S. Smolka, Eds.). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Rome, Italy: Springer. https://doi.org/10.1007/978-3-642-36742-7_5","ieee":"K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.","ama":"Bansal K, Koskinen E, Wies T, Zufferey D. Structural Counter Abstraction. Piterman N, Smolka S, eds. 2013;7795:62-77. doi:10.1007/978-3-642-36742-7_5"},"page":"62 - 77","date_published":"2013-03-01T00:00:00Z","publist_id":"3947","ec_funded":1,"year":"2013","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"editor":[{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"},{"full_name":"Smolka, Scott","last_name":"Smolka","first_name":"Scott"}],"author":[{"last_name":"Bansal","first_name":"Kshitij","full_name":"Bansal, Kshitij"},{"last_name":"Koskinen","first_name":"Eric","full_name":"Koskinen, Eric"},{"full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1405"}]},"date_created":"2018-12-11T11:59:54Z","date_updated":"2023-09-07T11:36:36Z","volume":7795,"month":"03","oa":1,"main_file_link":[{"open_access":"1","url":"http://arise.or.at/pubpdf/Structural_Counter_Abstraction.pdf"}],"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2013-03-16","location":"Rome, Italy","end_date":"2013-03-24"},"doi":"10.1007/978-3-642-36742-7_5","language":[{"iso":"eng"}]},{"scopus_import":1,"day":"01","has_accepted_license":"1","page":"951 - 967","citation":{"chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,” 8044:951–67. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_68.","mla":"Cerny, Pavol, et al. Efficient Synthesis for Concurrency by Semantics-Preserving Transformations. Vol. 8044, Springer, 2013, pp. 951–67, doi:10.1007/978-3-642-39799-8_68.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_68","ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.","ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Efficient synthesis for concurrency by semantics-preserving transformations. In: Vol 8044. Springer; 2013:951-967. doi:10.1007/978-3-642-39799-8_68"},"date_published":"2013-07-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We develop program synthesis techniques that can help programmers fix concurrency-related bugs. We make two new contributions to synthesis for concurrency, the first improving the efficiency of the synthesized code, and the second improving the efficiency of the synthesis procedure itself. The first contribution is to have the synthesis procedure explore a variety of (sequential) semantics-preserving program transformations. Classically, only one such transformation has been considered, namely, the insertion of synchronization primitives (such as locks). Based on common manual bug-fixing techniques used by Linux device-driver developers, we explore additional, more efficient transformations, such as the reordering of independent instructions. The second contribution is to speed up the counterexample-guided removal of concurrency bugs within the synthesis procedure by considering partial-order traces (instead of linear traces) as counterexamples. A partial-order error trace represents a set of linear (interleaved) traces of a concurrent program all of which lead to the same error. By eliminating a partial-order error trace, we eliminate in a single iteration of the synthesis procedure all linearizations of the partial-order trace. We evaluated our techniques on several simplified examples of real concurrency bugs that occurred in Linux device drivers.","lang":"eng"}],"title":"Efficient synthesis for concurrency by semantics-preserving transformations","ddc":["000","004"],"status":"public","intvolume":" 8044","_id":"2445","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:45:40Z","date_created":"2018-12-12T10:15:37Z","checksum":"70c70ca5487faba82262c63e1b678a27","file_id":"5158","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":365548,"file_name":"IST-2014-199-v1+1_cav2013-final.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"199","month":"07","quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2013-07-19","start_date":"2013-07-13","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-642-39799-8_68","file_date_updated":"2020-07-14T12:45:40Z","publist_id":"4458","ec_funded":1,"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2013","date_updated":"2023-09-07T11:57:01Z","date_created":"2018-12-11T11:57:42Z","volume":8044,"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ryzhyk","first_name":"Leonid","full_name":"Ryzhyk, Leonid"},{"id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","first_name":"Thorsten","last_name":"Tarrach","full_name":"Tarrach, Thorsten"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1130"}]}},{"date_published":"2012-11-01T00:00:00Z","citation":{"apa":"Beyer, D., Henzinger, T. A., Keremoglu, M., & Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. Cary, NC, USA: ACM. https://doi.org/10.1145/2393596.2393664","ieee":"D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model checking: A technique to pass information between verifiers,” in Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, Cary, NC, USA, 2012.","ista":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking: A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. FSE: Foundations of Software Engineering, 57.","ama":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking: A technique to pass information between verifiers. In: Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. ACM; 2012. doi:10.1145/2393596.2393664","chicago":"Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. ACM, 2012. https://doi.org/10.1145/2393596.2393664.","short":"D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, ACM, 2012.","mla":"Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, 57, ACM, 2012, doi:10.1145/2393596.2393664."},"publication":"Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering","day":"01","scopus_import":1,"oa_version":"Preprint","title":"Conditional model checking: A technique to pass information between verifiers","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1384","abstract":[{"lang":"eng","text":"Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition Ψ - usually a state predicate - such that the program satisfies the specification under the condition Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before."}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1145/2393596.2393664","conference":{"name":"FSE: Foundations of Software Engineering","start_date":"2012-11-11","location":"Cary, NC, USA","end_date":"2012-11-16"},"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1109.6926","open_access":"1"}],"month":"11","date_updated":"2021-01-12T06:50:18Z","date_created":"2018-12-11T11:51:42Z","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Keremoglu, Mehmet","first_name":"Mehmet","last_name":"Keremoglu"},{"last_name":"Wendler","first_name":"Philipp","full_name":"Wendler, Philipp"}],"publisher":"ACM","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2012","acknowledgement":"This research was supported by the Canadian NSERC grant RGPIN 341819-07, the ERC Advanced Grant QUAREM, and the Austrian Science Fund NFN RiSE.","publist_id":"5826","ec_funded":1,"article_number":"57"},{"day":"03","scopus_import":1,"date_published":"2012-07-03T00:00:00Z","citation":{"chicago":"Henzinger, Thomas A, and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.” IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE, 2012. https://doi.org/10.1109/TCBB.2012.91.","short":"T.A. Henzinger, M. Mateescu, IEEE ACM Transactions on Computational Biology and Bioinformatics 10 (2012) 310–322.","mla":"Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91.","apa":"Henzinger, T. A., & Mateescu, M. (2012). The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE. https://doi.org/10.1109/TCBB.2012.91","ieee":"T. A. Henzinger and M. Mateescu, “The propagation approach for computing biochemical reaction networks,” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2. IEEE, pp. 310–322, 2012.","ista":"Henzinger TA, Mateescu M. 2012. The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. 10(2), 310–322.","ama":"Henzinger TA, Mateescu M. The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. 2012;10(2):310-322. doi:10.1109/TCBB.2012.91"},"publication":"IEEE ACM Transactions on Computational Biology and Bioinformatics","page":"310 - 322","issue":"2","abstract":[{"text":"We introduce propagation models (PMs), a formalism able to express several kinds of equations that describe the behavior of biochemical reaction networks. Furthermore, we introduce the propagation abstract data type (PADT), which separates concerns regarding different numerical algorithms for the transient analysis of biochemical reaction networks from concerns regarding their implementation, thus allowing for portable and efficient solutions. The state of a propagation abstract data type is given by a vector that assigns mass values to a set of nodes, and its (next) operator propagates mass values through this set of nodes. We propose an approximate implementation of the (next) operator, based on threshold abstraction, which propagates only "significant" mass values and thus achieves a compromise between efficiency and accuracy. Finally, we give three use cases for propagation models: the chemical master equation (CME), the reaction rate equation (RRE), and a hybrid method that combines these two equations. These three applications use propagation models in order to propagate probabilities and/or expected values and variances of the model's variables.","lang":"eng"}],"type":"journal_article","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2302","intvolume":" 10","title":"The propagation approach for computing biochemical reaction networks","status":"public","month":"07","doi":"10.1109/TCBB.2012.91","language":[{"iso":"eng"}],"external_id":{"pmid":["22778152"]},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","publist_id":"4625","ec_funded":1,"author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Mateescu, Maria","first_name":"Maria","last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"}],"volume":10,"date_created":"2018-12-11T11:56:52Z","date_updated":"2021-01-12T06:56:38Z","pmid":1,"year":"2012","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"publisher":"IEEE","publication_status":"published"},{"doi":"10.1016/j.jtbi.2012.02.021","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/","open_access":"1"}],"external_id":{"pmid":["22394652"]},"oa":1,"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","month":"05","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"volume":301,"date_updated":"2021-01-12T07:00:12Z","date_created":"2018-12-11T11:59:55Z","pmid":1,"year":"2012","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","ec_funded":1,"publist_id":"3946","date_published":"2012-05-21T00:00:00Z","citation":{"ama":"Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 2012;301:161-173. doi:10.1016/j.jtbi.2012.02.021","ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.","ieee":"K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier, pp. 161–173, 2012.","apa":"Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.","short":"K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.","chicago":"Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021."},"publication":"Journal of Theoretical Biology","page":"161 - 173","day":"21","scopus_import":1,"oa_version":"Submitted Version","_id":"2848","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 301","status":"public","title":"Evolutionary game dynamics in populations with different learners","abstract":[{"text":"We study evolutionary game theory in a setting where individuals learn from each other. We extend the traditional approach by assuming that a population contains individuals with different learning abilities. In particular, we explore the situation where individuals have different search spaces, when attempting to learn the strategies of others. The search space of an individual specifies the set of strategies learnable by that individual. The search space is genetically given and does not change under social evolutionary dynamics. We introduce a general framework and study a specific example in the context of direct reciprocity. For this example, we obtain the counter intuitive result that cooperation can only evolve for intermediate benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection. Our paper is a step toward making a connection between computational learning theory and evolutionary game dynamics.","lang":"eng"}],"type":"journal_article"},{"pubrep_id":"805","file":[{"file_id":"4826","relation":"main_file","date_created":"2018-12-12T10:10:37Z","date_updated":"2020-07-14T12:45:52Z","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_name":"IST-2017-805-v1+1_34.pdf","access_level":"open_access","creator":"system","file_size":559069,"content_type":"application/pdf"}],"oa_version":"Published Version","_id":"2891","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"title":"Approximate determinization of quantitative automata","status":"public","intvolume":" 18","abstract":[{"lang":"eng","text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1."}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2012-12-01T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","citation":{"chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In Leibniz International Proceedings in Informatics, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” Leibniz International Proceedings in Informatics, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in Leibniz International Proceedings in Informatics, Hyderabad, India, 2012, vol. 18, pp. 362–373.","apa":"Boker, U., & Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In Leibniz International Proceedings in Informatics (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: Leibniz International Proceedings in Informatics. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:10.4230/LIPIcs.FSTTCS.2012.362"},"page":"362 - 373","day":"01","has_accepted_license":"1","scopus_import":1,"author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"date_created":"2018-12-11T12:00:10Z","date_updated":"2021-01-12T07:00:31Z","volume":18,"acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","year":"2012","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:45:52Z","ec_funded":1,"publist_id":"3867","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Hyderabad, India","start_date":"2012-12-15","end_date":"2012-12-17"},"doi":"10.4230/LIPIcs.FSTTCS.2012.362","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"month":"12"},{"author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sivakanth","last_name":"Gopi","full_name":"Gopi, Sivakanth"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"first_name":"Nishant","last_name":"Totla","full_name":"Totla, Nishant"}],"oa_version":"None","date_updated":"2021-01-12T07:00:30Z","date_created":"2018-12-11T12:00:10Z","_id":"2890","year":"2012","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publisher":"ACM","title":"Synthesis from incompatible specifications","publication_status":"published","status":"public","publist_id":"3868","ec_funded":1,"abstract":[{"text":"Systems are often specified using multiple requirements on their behavior. In practice, these requirements can be contradictory. The classical approach to specification, verification, and synthesis demands more detailed specifications that resolve any contradictions in the requirements. These detailed specifications are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative frameworks allow the formalization of the intuitive idea that what is desired is an implementation that comes "closest" to satisfying the mutually incompatible requirements, according to a measure of fit that can be defined by the requirements engineer. One flexible framework for quantifying how "well" an implementation satisfies a specification is offered by simulation distances that are parameterized by an error model. We introduce this framework, study its properties, and provide an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite-state implementation that minimizes the maximal simulation distance to the given requirements. Furthermore, we generalize the framework to handle infinite alphabets (for example, realvalued domains). We also demonstrate how quantitative specifications based on simulation distances might lead to smaller and easier to modify specifications. Finally, we illustrate our approach using case studies on error correcting codes and scheduler synthesis.","lang":"eng"}],"type":"conference","date_published":"2012-10-01T00:00:00Z","doi":"10.1145/2380356.2380371","conference":{"end_date":"2012-10-12","location":"Tampere, Finland","start_date":"2012-10-07","name":"EMSOFT: Embedded Software "},"language":[{"iso":"eng"}],"citation":{"ama":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: Proceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:53-62. doi:10.1145/2380356.2380371","apa":"Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012). Synthesis from incompatible specifications. In Proceedings of the tenth ACM international conference on Embedded software (pp. 53–62). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380371","ieee":"P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in Proceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.","ista":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.","short":"P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62.","mla":"Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62, doi:10.1145/2380356.2380371.","chicago":"Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings of the Tenth ACM International Conference on Embedded Software, 53–62. ACM, 2012. https://doi.org/10.1145/2380356.2380371."},"publication":"Proceedings of the tenth ACM international conference on Embedded software","page":"53 - 62","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","day":"01","month":"10","scopus_import":1},{"ec_funded":1,"publist_id":"3870","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","year":"2012","volume":7590,"date_updated":"2021-01-12T07:00:29Z","date_created":"2018-12-11T12:00:09Z","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"month":"09","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-33666-9_1","conference":{"name":"MODELS: Model-driven Engineering Languages and Systems","start_date":"2012-09-30","location":"Innsbruck, Austria","end_date":"2012-10-05"},"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.","lang":"eng"}],"intvolume":" 7590","title":"Quantitative reactive models","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2888","oa_version":"None","scopus_import":1,"day":"01","page":"1 - 2","citation":{"chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In Conference Proceedings MODELS 2012, 7590:1–2. Springer, 2012. https://doi.org/10.1007/978-3-642-33666-9_1.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” Conference Proceedings MODELS 2012, vol. 7590, Springer, 2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.","short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","ieee":"T. A. Henzinger, “Quantitative reactive models,” in Conference proceedings MODELS 2012, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","apa":"Henzinger, T. A. (2012). Quantitative reactive models. In Conference proceedings MODELS 2012 (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. https://doi.org/10.1007/978-3-642-33666-9_1","ama":"Henzinger TA. Quantitative reactive models. In: Conference Proceedings MODELS 2012. Vol 7590. Springer; 2012:1-2. doi:10.1007/978-3-642-33666-9_1"},"publication":"Conference proceedings MODELS 2012","date_published":"2012-09-01T00:00:00Z"},{"abstract":[{"text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}],"type":"conference","oa_version":"Submitted Version","_id":"2916","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Interface Simulation Distances","intvolume":" 96","day":"07","scopus_import":1,"date_published":"2012-10-07T00:00:00Z","publication":"Electronic Proceedings in Theoretical Computer Science","citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS; 2012:29-42. doi:10.4204/EPTCS.96.3"},"page":"29 - 42","ec_funded":1,"publist_id":"3827","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"1733","relation":"later_version","status":"public"}]},"date_created":"2018-12-11T12:00:19Z","date_updated":"2023-02-23T10:12:05Z","volume":96,"year":"2012","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"EPTCS","month":"10","conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2012-09-08","location":"Napoli, Italy","start_date":"2012-09-06"},"doi":"10.4204/EPTCS.96.3","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"external_id":{"arxiv":["1210.2450"]},"oa":1,"quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]},{"publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","year":"2012","date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak"}],"ec_funded":1,"publist_id":"3799","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7019"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/2380356.2380370","conference":{"end_date":"2012-10-12","start_date":"2012-10-07","location":"Tampere, Finland","name":"EMSOFT: Embedded Software "},"month":"10","status":"public","title":"Finite automata with time delay blocks","_id":"2936","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"conference","abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"page":"43 - 52","citation":{"ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.","apa":"Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: Roceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:43-52. doi:10.1145/2380356.2380370","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52."},"publication":"roceedings of the tenth ACM international conference on Embedded software","date_published":"2012-10-01T00:00:00Z","scopus_import":1,"day":"01"}]