[{"month":"07","day":"08","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_published":"2013-07-08T00:00:00Z","doi":"10.15479/AT:IST-2013-130-v1-1","language":[{"iso":"eng"}],"citation":{"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.","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.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.","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","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"},"oa":1,"page":"11","file_date_updated":"2020-07-14T12:46:45Z","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."}],"type":"technical_report","alternative_title":["IST Austria Technical Report"],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"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","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"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","status":"public","relation":"later_version"}]},"pubrep_id":"130","date_updated":"2023-02-21T17:01:26Z","date_created":"2018-12-12T11:39:09Z","oa_version":"Published Version","file":[{"file_id":"5540","relation":"main_file","checksum":"855513ebaf6f72228800c5fdb522f93c","date_created":"2018-12-12T11:54:18Z","date_updated":"2020-07-14T12:46:45Z","access_level":"open_access","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","creator":"system","content_type":"application/pdf","file_size":467895}],"_id":"5406","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005"],"publication_status":"published","status":"public","title":"Distributed synthesis for LTL Fragments","publisher":"IST Austria","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"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.","lang":"eng"}],"intvolume":" 8052","status":"public","ddc":["005","000"],"title":"From model checking to model measuring","_id":"2327","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","file_name":"IST-2013-129-v1+1_concur.pdf","content_type":"application/pdf","file_size":378587,"creator":"system","relation":"main_file","file_id":"5301","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:17:45Z"}],"oa_version":"Submitted Version","pubrep_id":"129","series_title":"Lecture Notes in Computer Science","has_accepted_license":"1","day":"01","page":"273 - 287","citation":{"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.","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"},"date_published":"2013-08-01T00:00:00Z","publist_id":"4599","file_date_updated":"2020-07-14T12:45:38Z","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2013","volume":8052,"date_created":"2018-12-11T11:57:00Z","date_updated":"2023-02-23T12:25:26Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5417"}]},"author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"}],"month":"08","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-40184-8_20","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","location":"Buenos Aires, Argentina","end_date":"2013-08-30"}},{"_id":"6440","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","publisher":"IST Austria","department":[{"_id":"ToHe"}],"title":"Replacing competition with cooperation to achieve scalable lock-free FIFO queues ","status":"public","publication_status":"published","ddc":["000","005"],"pubrep_id":"124","author":[{"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":"Payer, Hannes","last_name":"Payer","first_name":"Hannes"},{"full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin","first_name":"Ali"}],"oa_version":"Published Version","file":[{"creator":"dernst","file_size":549684,"content_type":"application/pdf","access_level":"open_access","file_name":"2013_TechRep_Henzinger.pdf","checksum":"a219ba4eada6cd62befed52262ee15d4","date_updated":"2020-07-14T12:47:30Z","date_created":"2019-05-13T14:11:39Z","file_id":"6441","relation":"main_file"}],"date_created":"2019-05-13T14:13:27Z","date_updated":"2020-07-14T23:06:19Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:47:30Z","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."}],"citation":{"ista":"Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.","ieee":"T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.","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","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,"page":"23","doi":"10.15479/AT:IST-2013-124-v1-1","date_published":"2013-06-13T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"month":"06","day":"13"},{"year":"2013","department":[{"_id":"ToHe"}],"publisher":"Springer Berlin Heidelberg","publication_status":"published","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara","full_name":"Dragoi, Cezara"},{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"volume":8044,"date_created":"2018-12-18T13:10:21Z","date_updated":"2023-09-05T14:16:07Z","place":"Berlin, Heidelberg","ec_funded":1,"file_date_updated":"2020-07-14T12:47:10Z","oa":1,"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","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","doi":"10.1007/978-3-642-39799-8_11","conference":{"name":"CAV 2013","end_date":"2013-07-19","location":"Saint Petersburg, Russia","start_date":"2013-07-13"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783642397981","9783642397998"],"eissn":["1611-3349"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5747","intvolume":" 8044","ddc":["005"],"status":"public","title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","pubrep_id":"195","file":[{"checksum":"a901cc6b71db08b61c0d4c0cbacc6287","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-18T13:13:33Z","relation":"main_file","file_id":"5748","content_type":"application/pdf","file_size":236480,"creator":"dernst","access_level":"open_access","file_name":"2013_CAV_Dragoi.pdf"}],"oa_version":"None","type":"book_chapter","citation":{"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.","short":"C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.","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.","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","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.","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."},"publication":"Computer Aided Verification","page":"174-190","date_published":"2013-01-01T00:00:00Z","scopus_import":"1","series_title":"CAV","has_accepted_license":"1","article_processing_charge":"No"},{"oa":1,"main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","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"}],"doi":"10.15479/at:ista:1405","degree_awarded":"PhD","supervisor":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"language":[{"iso":"eng"}],"month":"09","publication_identifier":{"issn":["2663-337X"]},"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. ","year":"2013","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"author":[{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien"}],"related_material":{"record":[{"id":"2847","status":"public","relation":"part_of_dissertation"},{"id":"3251","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"4361"}]},"date_updated":"2023-09-07T11:36:37Z","date_created":"2018-12-11T11:51:50Z","file_date_updated":"2021-11-17T13:47:58Z","ec_funded":1,"publist_id":"5802","citation":{"mla":"Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. https://doi.org/10.15479/at:ista:1405.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:10.15479/at:ista:1405","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","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"},"page":"134","date_published":"2013-09-05T00:00:00Z","day":"05","has_accepted_license":"1","article_processing_charge":"No","_id":"1405","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["000"],"title":"Analysis of dynamic message passing programs","file":[{"content_type":"application/pdf","file_size":1514906,"creator":"dernst","file_name":"2013_Zufferey_thesis_final.pdf","access_level":"open_access","date_updated":"2021-02-22T11:28:36Z","date_created":"2021-02-22T11:28:36Z","checksum":"ed2d7b52933d134e8dc69d569baa284e","success":1,"relation":"main_file","file_id":"9176"},{"file_size":1378313,"content_type":"application/pdf","creator":"cchlebak","file_name":"2013_Zufferey_thesis_final_pdfa.pdf","access_level":"closed","date_updated":"2021-11-17T13:47:58Z","date_created":"2021-11-16T14:42:52Z","checksum":"cecc4c4b14225bee973d32e3dba91a55","relation":"main_file","file_id":"10298"}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","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."}]},{"quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arise.or.at/pubpdf/Structural_Counter_Abstraction.pdf"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2013-03-24","location":"Rome, Italy","start_date":"2013-03-16","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"doi":"10.1007/978-3-642-36742-7_5","month":"03","publication_status":"published","editor":[{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"},{"first_name":"Scott","last_name":"Smolka","full_name":"Smolka, Scott"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2013","date_updated":"2023-09-07T11:36:36Z","date_created":"2018-12-11T11:59:54Z","volume":7795,"author":[{"full_name":"Bansal, Kshitij","last_name":"Bansal","first_name":"Kshitij"},{"first_name":"Eric","last_name":"Koskinen","full_name":"Koskinen, Eric"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","first_name":"Damien","last_name":"Zufferey"}],"related_material":{"record":[{"id":"1405","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"publist_id":"3947","page":"62 - 77","citation":{"short":"K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77.","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.","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.","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","ieee":"K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.","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","ista":"Bansal K, Koskinen E, Wies T, Zufferey D. 2013. Structural Counter Abstraction (eds. N. Piterman & S. Smolka). 7795, 62–77."},"date_published":"2013-03-01T00:00:00Z","series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"01","title":"Structural Counter Abstraction","status":"public","intvolume":" 7795","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2847","oa_version":"Submitted Version","alternative_title":["LNCS"],"type":"conference","abstract":[{"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.","lang":"eng"}]},{"date_published":"2013-07-01T00:00:00Z","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.","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.","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","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"},"day":"01","has_accepted_license":"1","scopus_import":1,"file":[{"creator":"system","content_type":"application/pdf","file_size":365548,"file_name":"IST-2014-199-v1+1_cav2013-final.pdf","access_level":"open_access","date_created":"2018-12-12T10:15:37Z","date_updated":"2020-07-14T12:45:40Z","checksum":"70c70ca5487faba82262c63e1b678a27","file_id":"5158","relation":"main_file"}],"oa_version":"Submitted Version","pubrep_id":"199","ddc":["000","004"],"title":"Efficient synthesis for concurrency by semantics-preserving transformations","status":"public","intvolume":" 8044","_id":"2445","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2013-07-19","location":"St. Petersburg, Russia","start_date":"2013-07-13","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-642-39799-8_68","quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"oa":1,"month":"07","date_created":"2018-12-11T11:57:42Z","date_updated":"2023-09-07T11:57:01Z","volume":8044,"author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"},{"full_name":"Ryzhyk, Leonid","first_name":"Leonid","last_name":"Ryzhyk"},{"full_name":"Tarrach, Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","first_name":"Thorsten","last_name":"Tarrach"}],"related_material":{"record":[{"id":"1130","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2013","file_date_updated":"2020-07-14T12:45:40Z","ec_funded":1,"publist_id":"4458"},{"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.","year":"2012","department":[{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Mehmet","last_name":"Keremoglu","full_name":"Keremoglu, Mehmet"},{"last_name":"Wendler","first_name":"Philipp","full_name":"Wendler, Philipp"}],"date_created":"2018-12-11T11:51:42Z","date_updated":"2021-01-12T06:50:18Z","article_number":"57","ec_funded":1,"publist_id":"5826","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1109.6926","open_access":"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"}],"quality_controlled":"1","doi":"10.1145/2393596.2393664","conference":{"location":"Cary, NC, USA","start_date":"2012-11-11","end_date":"2012-11-16","name":"FSE: Foundations of Software Engineering"},"language":[{"iso":"eng"}],"month":"11","_id":"1384","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Conditional model checking: A technique to pass information between verifiers","status":"public","oa_version":"Preprint","type":"conference","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."}],"citation":{"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.","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.","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.","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","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.","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."},"publication":"Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering","date_published":"2012-11-01T00:00:00Z","scopus_import":1,"day":"01"},{"scopus_import":1,"day":"03","page":"310 - 322","publication":"IEEE ACM Transactions on Computational Biology and Bioinformatics","citation":{"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","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.","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.","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.","short":"T.A. Henzinger, M. Mateescu, IEEE ACM Transactions on Computational Biology and Bioinformatics 10 (2012) 310–322.","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."},"date_published":"2012-07-03T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","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."}],"issue":"2","title":"The propagation approach for computing biochemical reaction networks","status":"public","intvolume":" 10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2302","oa_version":"None","month":"07","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"external_id":{"pmid":["22778152"]},"language":[{"iso":"eng"}],"doi":"10.1109/TCBB.2012.91","ec_funded":1,"publist_id":"4625","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"publisher":"IEEE","year":"2012","pmid":1,"date_updated":"2021-01-12T06:56:38Z","date_created":"2018-12-11T11:56:52Z","volume":10,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Mateescu"}]},{"type":"journal_article","abstract":[{"lang":"eng","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."}],"_id":"2848","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 301","status":"public","title":"Evolutionary game dynamics in populations with different learners","oa_version":"Submitted Version","scopus_import":1,"day":"21","citation":{"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.","short":"K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.","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.","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","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.","ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.","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"},"publication":"Journal of Theoretical Biology","page":"161 - 173","date_published":"2012-05-21T00:00:00Z","publist_id":"3946","ec_funded":1,"pmid":1,"year":"2012","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"volume":301,"date_created":"2018-12-11T11:59:55Z","date_updated":"2021-01-12T07:00:12Z","month":"05","external_id":{"pmid":["22394652"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/","open_access":"1"}],"oa":1,"project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","doi":"10.1016/j.jtbi.2012.02.021","language":[{"iso":"eng"}]},{"scopus_import":1,"day":"01","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","citation":{"short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","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.","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.","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","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","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.","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."},"page":"362 - 373","date_published":"2012-12-01T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"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.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2891","ddc":["004"],"title":"Approximate determinization of quantitative automata","status":"public","intvolume":" 18","pubrep_id":"805","file":[{"date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:10:37Z","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_id":"4826","relation":"main_file","creator":"system","file_size":559069,"content_type":"application/pdf","file_name":"IST-2017-805-v1+1_34.pdf","access_level":"open_access"}],"oa_version":"Published Version","month":"12","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,"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"conference":{"location":"Hyderabad, India","start_date":"2012-12-15","end_date":"2012-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"doi":"10.4230/LIPIcs.FSTTCS.2012.362","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","ec_funded":1,"publist_id":"3867","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","year":"2012","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"date_updated":"2021-01-12T07:00:31Z","date_created":"2018-12-11T12:00:10Z","volume":18},{"date_created":"2018-12-11T12:00:10Z","date_updated":"2021-01-12T07:00:30Z","oa_version":"None","author":[{"last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"},{"last_name":"Gopi","first_name":"Sivakanth","full_name":"Gopi, Sivakanth"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"last_name":"Totla","first_name":"Nishant","full_name":"Totla, Nishant"}],"status":"public","publication_status":"published","title":"Synthesis from incompatible specifications","department":[{"_id":"ToHe"}],"publisher":"ACM","_id":"2890","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","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"}],"ec_funded":1,"publist_id":"3868","type":"conference","language":[{"iso":"eng"}],"conference":{"start_date":"2012-10-07","location":"Tampere, Finland","end_date":"2012-10-12","name":"EMSOFT: Embedded Software "},"date_published":"2012-10-01T00:00:00Z","doi":"10.1145/2380356.2380371","quality_controlled":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"page":"53 - 62","publication":"Proceedings of the tenth ACM international conference on Embedded software","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","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.","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.","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","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.","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.","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."},"month":"10","day":"01","scopus_import":1},{"month":"09","language":[{"iso":"eng"}],"conference":{"end_date":"2012-10-05","location":"Innsbruck, Austria","start_date":"2012-09-30","name":"MODELS: Model-driven Engineering Languages and Systems"},"doi":"10.1007/978-3-642-33666-9_1","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publist_id":"3870","ec_funded":1,"date_created":"2018-12-11T12:00:09Z","date_updated":"2021-01-12T07:00:29Z","volume":7590,"author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2012","day":"01","scopus_import":1,"date_published":"2012-09-01T00:00:00Z","page":"1 - 2","publication":"Conference proceedings MODELS 2012","citation":{"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","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","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","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.","short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","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."},"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"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","status":"public","title":"Quantitative reactive models","intvolume":" 7590","_id":"2888","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"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","title":"Interface Simulation Distances","status":"public","intvolume":" 96","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2916","day":"07","scopus_import":1,"date_published":"2012-10-07T00:00:00Z","page":"29 - 42","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"},"publist_id":"3827","ec_funded":1,"date_created":"2018-12-11T12:00:19Z","date_updated":"2023-02-23T10:12:05Z","volume":96,"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin"},{"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"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1733"}]},"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"EPTCS","year":"2012","month":"10","language":[{"iso":"eng"}],"conference":{"end_date":"2012-09-08","location":"Napoli, Italy","start_date":"2012-09-06","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"doi":"10.4204/EPTCS.96.3","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"external_id":{"arxiv":["1210.2450"]},"oa":1},{"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"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":{"location":"Tampere, Finland","start_date":"2012-10-07","end_date":"2012-10-12","name":"EMSOFT: Embedded Software "},"month":"10","publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","year":"2012","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).","date_updated":"2021-01-12T07:39:53Z","date_created":"2018-12-11T12:00:26Z","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"ec_funded":1,"publist_id":"3799","page":"43 - 52","citation":{"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","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.","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.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","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."},"publication":"roceedings of the tenth ACM international conference on Embedded software","date_published":"2012-10-01T00:00:00Z","scopus_import":1,"day":"01","title":"Finite automata with time delay blocks","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2936","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","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."}]},{"ec_funded":1,"publist_id":"3791","volume":7539,"date_updated":"2021-01-12T07:39:56Z","date_created":"2018-12-11T12:00:28Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","year":"2012","month":"09","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-34059-8_20","conference":{"start_date":"2012-03-19","location":"Oxford, UK","end_date":"2012-03-21","name":"Monterey Workshop 2012"},"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","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","abstract":[{"text":"Interface theories provide a formal framework for component-based development of software and hardware which supports the incremental design of systems and the independent implementability of components. These capabilities are ensured through mathematical properties of the parallel composition operator and the refinement relation for components. More recently, a conjunction operation was added to interface theories in order to provide support for handling multiple viewpoints, requirements engineering, and component reuse. Unfortunately, the conjunction operator does not allow independent implementability in general. In this paper, we study conditions that need to be imposed on interface models in order to enforce independent implementability with respect to conjunction. We focus on multiple viewpoint specifications and propose a new compatibility criterion between two interfaces, which we call orthogonality. We show that orthogonal interfaces can be refined separately, while preserving both orthogonality and composability with other interfaces. We illustrate the independent implementability of different viewpoints with a FIFO buffer example.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","intvolume":" 7539","title":"Independent implementability of viewpoints","status":"public","_id":"2942","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"16","scopus_import":1,"date_published":"2012-09-16T00:00:00Z","page":"380 - 395","citation":{"short":"T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” Conference Proceedings Monterey Workshop 2012, vol. 7539, Springer, 2012, pp. 380–95, doi:10.1007/978-3-642-34059-8_20.","chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In Conference Proceedings Monterey Workshop 2012, 7539:380–95. Springer, 2012. https://doi.org/10.1007/978-3-642-34059-8_20.","ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: Conference Proceedings Monterey Workshop 2012. Vol 7539. Springer; 2012:380-395. doi:10.1007/978-3-642-34059-8_20","apa":"Henzinger, T. A., & Nickovic, D. (2012). Independent implementability of viewpoints. In Conference proceedings Monterey Workshop 2012 (Vol. 7539, pp. 380–395). Oxford, UK: Springer. https://doi.org/10.1007/978-3-642-34059-8_20","ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in Conference proceedings Monterey Workshop 2012, Oxford, UK, 2012, vol. 7539, pp. 380–395.","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395."},"publication":" Conference proceedings Monterey Workshop 2012"},{"volume":"7358 ","oa_version":"None","date_updated":"2021-01-12T07:41:18Z","date_created":"2018-12-11T12:01:36Z","author":[{"full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052"},{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"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":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Mateescu"},{"first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"}],"department":[{"_id":"CaGu"},{"_id":"ToHe"}],"publisher":"Springer","title":"Delayed continuous time Markov chains for genetic regulatory circuits","publication_status":"published","status":"public","_id":"3136","year":"2012","acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative Reactive Modeling (QUAREM) and by the Swiss National Science Foundation.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3561","ec_funded":1,"abstract":[{"lang":"eng","text":"Continuous-time Markov chains (CTMC) with their rich theory and efficient simulation algorithms have been successfully used in modeling stochastic processes in diverse areas such as computer science, physics, and biology. However, systems that comprise non-instantaneous events cannot be accurately and efficiently modeled with CTMCs. In this paper we define delayed CTMCs, an extension of CTMCs that allows for the specification of a lower bound on the time interval between an event's initiation and its completion, and we propose an algorithm for the computation of their behavior. Our algorithm effectively decomposes the computation into two stages: a pure CTMC governs event initiations while a deterministic process guarantees lower bounds on event completion times. Furthermore, from the nature of delayed CTMCs, we obtain a parallelized version of our algorithm. We use our formalism to model genetic regulatory circuits (biological systems where delayed events are common) and report on the results of our numerical algorithm as run on a cluster. We compare performance and accuracy of our results with results obtained by using pure CTMCs. © 2012 Springer-Verlag."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-31424-7_24","date_published":"2012-07-01T00:00:00Z","conference":{"end_date":"2012-07-13","start_date":"2012-07-07","location":"Berkeley, CA, USA","name":"CAV: Computer Aided Verification"},"page":"294 - 309","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","citation":{"ama":"Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. Delayed continuous time Markov chains for genetic regulatory circuits. In: Vol 7358. Springer; 2012:294-309. doi:10.1007/978-3-642-31424-7_24","ista":"Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.","apa":"Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., & Sezgin, A. (2012). Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358, pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_24","ieee":"C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.","mla":"Guet, Calin C., et al. Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits. Vol. 7358, Springer, 2012, pp. 294–309, doi:10.1007/978-3-642-31424-7_24.","short":"C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.","chicago":"Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,” 7358:294–309. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_24."},"month":"07","day":"01","scopus_import":1},{"citation":{"ista":"Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.","apa":"Asarin, E., Donzé, A., Maler, O., & Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-642-29860-8_12","ieee":"E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification of temporal properties,” presented at the RV: Runtime Verification, San Francisco, CA, United States, 2012, vol. 7186, pp. 147–160.","ama":"Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:10.1007/978-3-642-29860-8_12","chicago":"Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. https://doi.org/10.1007/978-3-642-29860-8_12.","mla":"Asarin, Eugene, et al. Parametric Identification of Temporal Properties. Vol. 7186, Springer, 2012, pp. 147–60, doi:10.1007/978-3-642-29860-8_12.","short":"E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160."},"page":"147 - 160","date_published":"2012-01-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"01","_id":"3162","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 7186","ddc":["000"],"title":"Parametric identification of temporal properties","status":"public","file":[{"relation":"main_file","file_id":"7862","checksum":"ba4a75287008fc64b8fbf78a7476ec32","date_updated":"2020-07-14T12:46:01Z","date_created":"2020-05-15T12:50:15Z","access_level":"open_access","file_name":"2012_RV_Asarin.pdf","content_type":"application/pdf","file_size":374726,"creator":"dernst"}],"oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Given a dense-time real-valued signal and a parameterized temporal logic formula with both magnitude and timing parameters, we compute the subset of the parameter space that renders the formula satisfied by the trace. We provide two preliminary implementations, one which follows the exact semantics and attempts to compute the validity domain by quantifier elimination in linear arithmetics and one which conducts adaptive search in the parameter space.","lang":"eng"}],"oa":1,"quality_controlled":"1","doi":"10.1007/978-3-642-29860-8_12","conference":{"location":"San Francisco, CA, United States","start_date":"2011-09-27","end_date":"2011-09-30","name":"RV: Runtime Verification"},"language":[{"iso":"eng"}],"month":"01","year":"2012","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","author":[{"full_name":"Asarin, Eugene","first_name":"Eugene","last_name":"Asarin"},{"full_name":"Donzé, Alexandre","first_name":"Alexandre","last_name":"Donzé"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"volume":7186,"date_updated":"2021-01-12T07:41:29Z","date_created":"2018-12-11T12:01:45Z","publist_id":"3525","file_date_updated":"2020-07-14T12:46:01Z"},{"citation":{"ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.","apa":"Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:10.1007/978-3-642-27940-9_1","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_1.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22.","mla":"Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012, pp. 1–22, doi:10.1007/978-3-642-27940-9_1."},"page":"1 - 22","quality_controlled":"1","date_published":"2012-02-26T00:00:00Z","doi":"10.1007/978-3-642-27940-9_1","conference":{"end_date":"2012-01-24","start_date":"2012-01-22","location":"Philadelphia, PA, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"language":[{"iso":"eng"}],"day":"26","month":"02","year":"2012","_id":"3253","acknowledgement":"This work was partly supported by the French National Research Agency (ANR) project Veridyc (ANR-09-SEGI-016).","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 7148","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","status":"public","title":"Abstract domains for automated reasoning about list manipulating programs with infinite data","author":[{"full_name":"Bouajjani, Ahmed","last_name":"Bouajjani","first_name":"Ahmed"},{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara","full_name":"Dragoi, Cezara"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"full_name":"Sighireanu, Mihaela","last_name":"Sighireanu","first_name":"Mihaela"}],"volume":7148,"oa_version":"None","date_updated":"2021-01-12T07:42:09Z","date_created":"2018-12-11T12:02:17Z","type":"conference","alternative_title":["LNCS"],"publist_id":"3404","abstract":[{"lang":"eng","text":"We describe a framework for reasoning about programs with lists carrying integer numerical data. We use abstract domains to describe and manipulate complex constraints on configurations of these programs mixing constraints on the shape of the heap, sizes of the lists, on the multisets of data stored in these lists, and on the data at their different positions. Moreover, we provide powerful techniques for automatic validation of Hoare-triples and invariant checking, as well as for automatic synthesis of invariants and procedure summaries using modular inter-procedural analysis. The approach has been implemented in a tool called Celia and experimented successfully on a large benchmark of programs."}]},{"scopus_import":1,"day":"04","month":"05","page":"137 - 164","quality_controlled":"1","citation":{"ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. Theoretical Computer Science. 2012;431:137-164. doi:10.1016/j.tcs.2011.12.059","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier, pp. 137–164, 2012.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.12.059","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.12.059."},"publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"date_published":"2012-05-04T00:00:00Z","doi":"10.1016/j.tcs.2011.12.059","type":"journal_article","publist_id":"3515","abstract":[{"lang":"eng","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 mathematical 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 combinatorial 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 (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk."}],"department":[{"_id":"ToHe"}],"intvolume":" 431","publisher":"Elsevier","publication_status":"published","status":"public","title":"Lumpability abstractions of rule based systems","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3168","year":"2012","acknowledgement":"We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology).","oa_version":"None","volume":431,"date_updated":"2023-02-23T11:39:40Z","date_created":"2018-12-11T12:01:47Z","pubrep_id":"73","related_material":{"record":[{"id":"3719","status":"public","relation":"earlier_version"}]},"author":[{"last_name":"Feret","first_name":"Jérôme","full_name":"Feret, Jérôme"},{"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":"Koeppl, Heinz","last_name":"Koeppl","first_name":"Heinz"},{"full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana"}]}]