[{"related_material":{"record":[{"status":"public","id":"1376","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["005"],"file":[{"creator":"system","file_id":"5540","relation":"main_file","access_level":"open_access","file_name":"IST-2013-130-v1+1_Distributed_Synthesis.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:45Z","checksum":"855513ebaf6f72228800c5fdb522f93c","file_size":467895,"date_created":"2018-12-12T11:54:18Z"}],"type":"technical_report","date_published":"2013-07-08T00:00:00Z","year":"2013","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>.","ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, <i>Distributed synthesis for LTL Fragments</i>. IST Austria, 2013.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). <i>Distributed synthesis for LTL Fragments</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">https://doi.org/10.15479/AT:IST-2013-130-v1-1</a>","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.","mla":"Chatterjee, Krishnendu, et al. <i>Distributed Synthesis for LTL Fragments</i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-130-v1-1\">10.15479/AT:IST-2013-130-v1-1</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013."},"date_updated":"2023-02-21T17:01:26Z","oa":1,"abstract":[{"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.","lang":"eng"}],"day":"08","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-130-v1-1","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:45Z","page":"11","publisher":"IST Austria","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas"}],"has_accepted_license":"1","_id":"5406","pubrep_id":"130","month":"07","title":"Distributed synthesis for LTL Fragments","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-12T11:39:09Z","publication_status":"published","oa_version":"Published Version"},{"type":"book_chapter","date_published":"2013-01-01T00:00:00Z","publication_identifier":{"isbn":["9783642397981","9783642397998"],"issn":["0302-9743"],"eissn":["1611-3349"]},"oa":1,"place":"Berlin, Heidelberg","file":[{"file_size":236480,"checksum":"a901cc6b71db08b61c0d4c0cbacc6287","date_created":"2018-12-18T13:13:33Z","content_type":"application/pdf","file_name":"2013_CAV_Dragoi.pdf","date_updated":"2020-07-14T12:47:10Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"5748"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","has_accepted_license":"1","publication":"Computer Aided Verification","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","language":[{"iso":"eng"}],"conference":{"start_date":"2013-07-13","name":"CAV 2013","end_date":"2013-07-19","location":"Saint Petersburg, Russia"},"year":"2013","citation":{"apa":"Dragoi, C., Gupta, A., &#38; Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In <i>Computer Aided Verification</i> (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>","ama":"Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: <i>Computer Aided Verification</i>. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>","chicago":"Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” In <i>Computer Aided Verification</i>, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">https://doi.org/10.1007/978-3-642-39799-8_11</a>.","ieee":"C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in <i>Computer Aided Verification</i>, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.","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.” <i>Computer Aided Verification</i>, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_11\">10.1007/978-3-642-39799-8_11</a>.","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."},"date_updated":"2023-09-05T14:16:07Z","doi":"10.1007/978-3-642-39799-8_11","volume":8044,"ddc":["005"],"scopus_import":"1","_id":"5747","author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara","full_name":"Dragoi, Cezara"},{"full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-18T13:10:21Z","article_processing_charge":"No","publication_status":"published","intvolume":"      8044","pubrep_id":"195","title":"Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates","ec_funded":1,"quality_controlled":"1","series_title":"CAV","page":"174-190","file_date_updated":"2020-07-14T12:47:10Z","publisher":"Springer Berlin Heidelberg"},{"page":"23","file_date_updated":"2020-07-14T12:47:30Z","language":[{"iso":"eng"}],"publisher":"IST Austria","has_accepted_license":"1","_id":"6440","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin","first_name":"Ali","full_name":"Sezgin, Ali"}],"date_created":"2019-05-13T14:13:27Z","department":[{"_id":"ToHe"}],"publication_status":"published","oa_version":"Published Version","pubrep_id":"124","month":"06","title":"Replacing competition with cooperation to achieve scalable lock-free FIFO queues ","alternative_title":["IST Austria Technical Report"],"file":[{"file_size":549684,"checksum":"a219ba4eada6cd62befed52262ee15d4","date_created":"2019-05-13T14:11:39Z","file_name":"2013_TechRep_Henzinger.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:30Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"6441"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"status":"public","year":"2013","citation":{"mla":"Henzinger, Thomas A., et al. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>.","short":"T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.","ista":"Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.","ama":"Henzinger TA, Payer H, Sezgin A. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>","apa":"Henzinger, T. A., Payer, H., &#38; Sezgin, A. (2013). <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>","chicago":"Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>.","ieee":"T. A. Henzinger, H. Payer, and A. Sezgin, <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria, 2013."},"date_updated":"2020-07-14T23:06:19Z","type":"technical_report","date_published":"2013-06-13T00:00:00Z","day":"13","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2013-124-v1-1","oa":1,"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."}]},{"doi":"10.1109/FMCAD.2013.6679386","day":"11","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"}],"publist_id":"5835","date_updated":"2023-02-23T12:24:53Z","year":"2013","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 18–25.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, 18–25. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>.","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: <i>13th International Conference on Formal Methods in Computer-Aided Design</i>. IEEE; 2013:18-25. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In <i>13th International Conference on Formal Methods in Computer-Aided Design</i> (pp. 18–25). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>","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.","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.","mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 18–25, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>."},"date_published":"2013-12-11T00:00:00Z","type":"conference","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5406"}]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa_version":"None","date_created":"2018-12-11T11:51:40Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"month":"12","title":"Distributed synthesis for LTL fragments","publication":"13th International Conference on Formal Methods in Computer-Aided Design","_id":"1376","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"publisher":"IEEE","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","location":"Portland, OR, United States","end_date":"2013-10-23"},"page":"18 - 25","ec_funded":1,"quality_controlled":"1","language":[{"iso":"eng"}]},{"acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND  (FP7-2009-IST-4-248613), and  QUAINT  (I774-N23),  ","external_id":{"arxiv":["1308.4767"]},"year":"2013","citation":{"apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &#38; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In <i>2013 Formal Methods in Computer-Aided Design</i> (pp. 77–84). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: <i>2013 Formal Methods in Computer-Aided Design</i>. IEEE; 2013:77-84. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in <i>2013 Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 77–84.","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In <i>2013 Formal Methods in Computer-Aided Design</i>, 77–84. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>.","mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” <i>2013 Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84."},"date_updated":"2021-01-12T06:50:19Z","abstract":[{"text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results.","lang":"eng"}],"day":"11","arxiv":1,"doi":"10.1109/FMCAD.2013.6679394","ec_funded":1,"quality_controlled":"1","page":"77 - 84","publisher":"IEEE","author":[{"first_name":"Georg","last_name":"Hofferek","full_name":"Hofferek, Georg"},{"last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Könighofer, Bettina","last_name":"Könighofer","first_name":"Bettina"},{"full_name":"Jiang, Jie","last_name":"Jiang","first_name":"Jie"},{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"}],"_id":"1385","title":"Synthesizing multiple boolean functions using interpolation on a single proof","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:51:43Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1308.4767","open_access":"1"}],"type":"conference","date_published":"2013-12-11T00:00:00Z","oa":1,"publist_id":"5825","language":[{"iso":"eng"}],"conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","location":"Portland, OR, United States","end_date":"2013-10-23"},"publication":"2013 Formal Methods in Computer-Aided Design","month":"12","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","relation":"main_file","file_id":"7857","creator":"dernst","date_created":"2020-05-15T11:05:50Z","checksum":"98bc02e3793072e279ec8d364b381ff3","file_size":276982,"date_updated":"2020-07-14T12:44:48Z","content_type":"application/pdf","file_name":"2013_ICALP_Boker.pdf"}],"date_published":"2013-07-01T00:00:00Z","type":"conference","oa":1,"publist_id":"5823","language":[{"iso":"eng"}],"conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2013-07-08","end_date":"2013-07-12","location":"Riga, Latvia"},"has_accepted_license":"1","month":"07","oa_version":"Submitted Version","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"ddc":["000"],"acknowledgement":"and ERC Grant QUALITY.","volume":7966,"date_updated":"2020-08-11T10:09:09Z","citation":{"ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>","apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100."},"year":"2013","abstract":[{"lang":"eng","text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata."}],"doi":"10.1007/978-3-642-39212-2_11","day":"01","file_date_updated":"2020-07-14T12:44:48Z","page":"89 - 100","ec_funded":1,"series_title":"Lecture Notes in Computer Science","quality_controlled":"1","publisher":"Springer","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi"},{"full_name":"Kuperberg, Denis","first_name":"Denis","last_name":"Kuperberg"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"},{"last_name":"Skrzypczak","first_name":"Michał","full_name":"Skrzypczak, Michał"}],"issue":"PART 2","_id":"1387","scopus_import":1,"title":"Nondeterminism in the presence of a diverse or unknown future","alternative_title":["LNCS"],"intvolume":"      7966","publication_status":"published","date_created":"2018-12-11T11:51:44Z","article_processing_charge":"No","department":[{"_id":"ToHe"}]},{"date_updated":"2023-09-07T11:36:37Z","year":"2013","citation":{"short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","mla":"Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>.","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","apa":"Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>.","ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013."},"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"}],"degree_awarded":"PhD","doi":"10.15479/at:ista:1405","day":"05","ddc":["000"],"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. ","author":[{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"_id":"1405","title":"Analysis of dynamic message passing programs","alternative_title":["ISTA Thesis"],"publication_status":"published","article_processing_charge":"No","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"date_created":"2018-12-11T11:51:50Z","file_date_updated":"2021-11-17T13:47:58Z","page":"134","ec_funded":1,"publisher":"Institute of Science and Technology Austria","date_published":"2013-09-05T00:00:00Z","type":"dissertation","supervisor":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"publist_id":"5802","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"id":"2847","relation":"part_of_dissertation","status":"public"},{"id":"3251","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"4361","status":"public"}]},"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"file":[{"file_size":1514906,"checksum":"ed2d7b52933d134e8dc69d569baa284e","date_created":"2021-02-22T11:28:36Z","file_name":"2013_Zufferey_thesis_final.pdf","content_type":"application/pdf","date_updated":"2021-02-22T11:28:36Z","success":1,"relation":"main_file","access_level":"open_access","creator":"dernst","file_id":"9176"},{"file_id":"10298","creator":"cchlebak","relation":"main_file","access_level":"closed","date_updated":"2021-11-17T13:47:58Z","content_type":"application/pdf","file_name":"2013_Zufferey_thesis_final_pdfa.pdf","date_created":"2021-11-16T14:42:52Z","file_size":1378313,"checksum":"cecc4c4b14225bee973d32e3dba91a55"}],"has_accepted_license":"1","month":"09","oa_version":"Published Version","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"month":"05","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","publication":"Journal of Theoretical Biology","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/","open_access":"1"}],"oa":1,"publist_id":"3946","type":"journal_article","date_published":"2012-05-21T00:00:00Z","publisher":"Elsevier","ec_funded":1,"quality_controlled":"1","page":"161 - 173","intvolume":"       301","title":"Evolutionary game dynamics in populations with different learners","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T11:59:55Z","publication_status":"published","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"scopus_import":1,"_id":"2848","pmid":1,"volume":301,"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"}],"day":"21","doi":"10.1016/j.jtbi.2012.02.021","external_id":{"pmid":["22394652"]},"citation":{"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.” <i>Journal of Theoretical Biology</i>, vol. 301, Elsevier, 2012, pp. 161–73, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">10.1016/j.jtbi.2012.02.021</a>.","ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.","apa":"Chatterjee, K., Zufferey, D., &#38; Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">https://doi.org/10.1016/j.jtbi.2012.02.021</a>","ama":"Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations with different learners. <i>Journal of Theoretical Biology</i>. 2012;301:161-173. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">10.1016/j.jtbi.2012.02.021</a>","ieee":"K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” <i>Journal of Theoretical Biology</i>, vol. 301. Elsevier, pp. 161–173, 2012.","chicago":"Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” <i>Journal of Theoretical Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">https://doi.org/10.1016/j.jtbi.2012.02.021</a>."},"year":"2012","date_updated":"2021-01-12T07:00:12Z"},{"volume":7590,"day":"01","doi":"10.1007/978-3-642-33666-9_1","abstract":[{"lang":"eng","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."}],"year":"2012","citation":{"ama":"Henzinger TA. Quantitative reactive models. In: <i>Conference Proceedings MODELS 2012</i>. Vol 7590. Springer; 2012:1-2. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>","apa":"Henzinger, T. A. (2012). Quantitative reactive models. In <i>Conference proceedings MODELS 2012</i> (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>","chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In <i>Conference Proceedings MODELS 2012</i>, 7590:1–2. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>.","ieee":"T. A. Henzinger, “Quantitative reactive models,” in <i>Conference proceedings MODELS 2012</i>, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” <i>Conference Proceedings MODELS 2012</i>, vol. 7590, Springer, 2012, pp. 1–2, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>.","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2."},"date_updated":"2021-01-12T07:00:29Z","publisher":"Springer","quality_controlled":"1","ec_funded":1,"page":"1 - 2","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:00:09Z","publication_status":"published","intvolume":"      7590","alternative_title":["LNCS"],"title":"Quantitative reactive models","scopus_import":1,"_id":"2888","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publist_id":"3870","type":"conference","date_published":"2012-09-01T00:00:00Z","conference":{"end_date":"2012-10-05","location":"Innsbruck, Austria","start_date":"2012-09-30","name":"MODELS: Model-driven Engineering Languages and Systems"},"language":[{"iso":"eng"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"None","month":"09","publication":"Conference proceedings MODELS 2012"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","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 &quot;closest&quot; 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 &quot;well&quot; 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"}],"publist_id":"3868","doi":"10.1145/2380356.2380371","day":"01","date_published":"2012-10-01T00:00:00Z","type":"conference","date_updated":"2021-01-12T07:00:30Z","citation":{"mla":"Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 53–62, doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>.","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.","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.","apa":"Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., &#38; Totla, N. (2012). Synthesis from incompatible specifications. In <i>Proceedings of the tenth ACM international conference on Embedded software</i> (pp. 53–62). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>","ama":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:53-62. doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>","chicago":"Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, 53–62. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>.","ieee":"P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in <i>Proceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 53–62."},"year":"2012","conference":{"location":"Tampere, Finland","end_date":"2012-10-12","name":"EMSOFT: Embedded Software ","start_date":"2012-10-07"},"publisher":"ACM","language":[{"iso":"eng"}],"page":"53 - 62","ec_funded":1,"quality_controlled":"1","month":"10","title":"Synthesis from incompatible specifications","publication_status":"published","oa_version":"None","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:00:10Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"last_name":"Gopi","first_name":"Sivakanth","full_name":"Gopi, Sivakanth"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nishant","last_name":"Totla","full_name":"Totla, Nishant"}],"_id":"2890","publication":"Proceedings of the tenth ACM international conference on Embedded software","scopus_import":1},{"intvolume":"        18","pubrep_id":"805","title":"Approximate determinization of quantitative automata","alternative_title":["LIPIcs"],"date_created":"2018-12-11T12:00:10Z","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","scopus_import":1,"_id":"2891","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:45:52Z","ec_funded":1,"quality_controlled":"1","page":"362 - 373","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"}],"day":"01","doi":"10.4230/LIPIcs.FSTTCS.2012.362","citation":{"apa":"Boker, U., &#38; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in <i>Leibniz International Proceedings in Informatics</i>, Hyderabad, India, 2012, vol. 18, pp. 362–373.","chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","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.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>.","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."},"year":"2012","date_updated":"2021-01-12T07:00:31Z","ddc":["004"],"acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","volume":18,"month":"12","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Published Version","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","conference":{"start_date":"2012-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Hyderabad, India","end_date":"2012-12-17"},"language":[{"iso":"eng"}],"publist_id":"3867","oa":1,"type":"conference","date_published":"2012-12-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","file_id":"4826","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"IST-2017-805-v1+1_34.pdf","date_updated":"2020-07-14T12:45:52Z","file_size":559069,"checksum":"88da18d3e2cb2e5011d7d10ce38a3864","date_created":"2018-12-12T10:10:37Z"}]},{"conference":{"end_date":"2012-09-08","location":"Napoli, Italy","start_date":"2012-09-06","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"language":[{"iso":"eng"}],"month":"10","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"Submitted Version","publication":"Electronic Proceedings in Theoretical Computer Science","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","id":"1733","status":"public"}]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.2450"}],"publist_id":"3827","oa":1,"type":"conference","date_published":"2012-10-07T00:00:00Z","publisher":"EPTCS","quality_controlled":"1","ec_funded":1,"page":"29 - 42","intvolume":"        96","title":"Interface Simulation Distances","date_created":"2018-12-11T12:00:19Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"scopus_import":1,"_id":"2916","volume":96,"abstract":[{"lang":"eng","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."}],"day":"07","doi":"10.4204/EPTCS.96.3","arxiv":1,"external_id":{"arxiv":["1210.2450"]},"citation":{"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.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 96, EPTCS, 2012, pp. 29–42, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>.","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: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 96. EPTCS; 2012:29-42. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Interface Simulation Distances. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 96:29–42. EPTCS, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Napoli, Italy, 2012, vol. 96, pp. 29–42."},"year":"2012","date_updated":"2023-02-23T10:12:05Z"},{"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).","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."}],"doi":"10.1145/2380356.2380370","day":"01","date_updated":"2021-01-12T07:39:53Z","year":"2012","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>roceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>roceedings of the tenth ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","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.","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.” <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>."},"publisher":"ACM","page":"43 - 52","ec_funded":1,"quality_controlled":"1","title":"Finite automata with time delay blocks","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:00:26Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak"}],"_id":"2936","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7019"}],"oa":1,"publist_id":"3799","date_published":"2012-10-01T00:00:00Z","type":"conference","conference":{"name":"EMSOFT: Embedded Software ","start_date":"2012-10-07","location":"Tampere, Finland","end_date":"2012-10-12"},"language":[{"iso":"eng"}],"month":"10","oa_version":"Preprint","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"publication":"roceedings of the tenth ACM international conference on Embedded software"},{"publication":" Conference proceedings Monterey Workshop 2012","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"None","month":"09","language":[{"iso":"eng"}],"conference":{"start_date":"2012-03-19","name":"Monterey Workshop 2012","location":"Oxford, UK","end_date":"2012-03-21"},"type":"conference","date_published":"2012-09-16T00:00:00Z","publist_id":"3791","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"_id":"2942","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"}],"date_created":"2018-12-11T12:00:28Z","department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"      7539","alternative_title":["LNCS"],"title":"Independent implementability of viewpoints","quality_controlled":"1","ec_funded":1,"page":"380 - 395","publisher":"Springer","year":"2012","citation":{"ieee":"T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in <i> Conference proceedings Monterey Workshop 2012</i>, Oxford, UK, 2012, vol. 7539, pp. 380–395.","chicago":"Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In <i> Conference Proceedings Monterey Workshop 2012</i>, 7539:380–95. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>.","apa":"Henzinger, T. A., &#38; Nickovic, D. (2012). Independent implementability of viewpoints. In <i> Conference proceedings Monterey Workshop 2012</i> (Vol. 7539, pp. 380–395). Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">https://doi.org/10.1007/978-3-642-34059-8_20</a>","ama":"Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: <i> Conference Proceedings Monterey Workshop 2012</i>. Vol 7539. Springer; 2012:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>","ista":"Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints.  Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.","mla":"Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” <i> Conference Proceedings Monterey Workshop 2012</i>, vol. 7539, Springer, 2012, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-34059-8_20\">10.1007/978-3-642-34059-8_20</a>.","short":"T.A. Henzinger, D. Nickovic, in:,  Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395."},"date_updated":"2021-01-12T07:39:56Z","day":"16","doi":"10.1007/978-3-642-34059-8_20","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"}],"acknowledgement":"ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National Research Network RISE (Rigorous Systems Engineering)","volume":7539},{"publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:00:36Z","title":"Algorithmic analysis of array-accessing programs","intvolume":"        13","_id":"2967","scopus_import":1,"author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Weinstein","first_name":"Scott","full_name":"Weinstein, Scott"}],"issue":"3","publisher":"ACM","quality_controlled":"1","ec_funded":1,"doi":"10.1145/2287718.2287727","day":"01","abstract":[{"text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words.","lang":"eng"}],"date_updated":"2023-02-23T12:09:43Z","year":"2012","citation":{"ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).","mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 3, 27, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>.","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 3. ACM, 2012.","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>.","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2012;13(3). doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>","apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>"},"acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","volume":13,"oa_version":"None","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"08","article_number":"27","publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"publist_id":"3748","date_published":"2012-08-01T00:00:00Z","type":"journal_article","status":"public","related_material":{"record":[{"relation":"earlier_version","id":"4403","status":"public"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"month":"10","oa_version":"Submitted Version","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication":"Formal Methods in System Design","has_accepted_license":"1","language":[{"iso":"eng"}],"oa":1,"publist_id":"3570","date_published":"2012-10-01T00:00:00Z","type":"journal_article","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:00Z","file_name":"IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:11:27Z","checksum":"dd3d590f383bb2ac6cfda1489ac1c42a","file_size":163983,"file_id":"4882","creator":"system","relation":"main_file","access_level":"open_access"}],"title":"A survey of partial-observation stochastic parity games","pubrep_id":"303","intvolume":"        43","publication_status":"published","date_created":"2018-12-11T12:01:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"issue":"2","_id":"3128","scopus_import":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:46:00Z","page":"268 - 284","ec_funded":1,"quality_controlled":"1","abstract":[{"text":"We consider two-player zero-sum stochastic games on graphs with ω-regular winning conditions specified as parity objectives. These games have applications in the design and control of reactive systems. We survey the complexity results for the problem of deciding the winner in such games, and in classes of interest obtained as special cases, based on the information and the power of randomization available to the players, on the class of objectives and on the winning mode. On the basis of information, these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have complete view of the game). The one-sided partial-observation games have two important subclasses: the one-player games, known as partial-observation Markov decision processes (POMDPs), and the blind one-player games, known as probabilistic automata. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Finally, various classes of games are obtained by restricting the parity objective to a reachability, safety, Büchi, or coBüchi condition. We also consider several winning modes, such as sure-winning (i.e., all outcomes of a strategy have to satisfy the winning condition), almost-sure winning (i.e., winning with probability 1), limit-sure winning (i.e., winning with probability arbitrarily close to 1), and value-threshold winning (i.e., winning with probability at least ν, where ν is a given rational). ","lang":"eng"}],"doi":"10.1007/s10703-012-0164-2","day":"01","date_updated":"2021-01-12T07:41:15Z","citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.","mla":"Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.” <i>Formal Methods in System Design</i>, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:<a href=\"https://doi.org/10.1007/s10703-012-0164-2\">10.1007/s10703-012-0164-2</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” <i>Formal Methods in System Design</i>, vol. 43, no. 2. Springer, pp. 268–284, 2012.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.” <i>Formal Methods in System Design</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s10703-012-0164-2\">https://doi.org/10.1007/s10703-012-0164-2</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-012-0164-2\">https://doi.org/10.1007/s10703-012-0164-2</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic parity games. <i>Formal Methods in System Design</i>. 2012;43(2):268-284. doi:<a href=\"https://doi.org/10.1007/s10703-012-0164-2\">10.1007/s10703-012-0164-2</a>"},"year":"2012","ddc":["005"],"acknowledgement":"The research was supported 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).","volume":43},{"author":[{"first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B43276C-F248-11E8-B48F-1D18A9856A87","last_name":"Mateescu","first_name":"Maria","full_name":"Mateescu, Maria"},{"full_name":"Sezgin, Ali","first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"_id":"3136","scopus_import":1,"month":"07","alternative_title":["LNCS"],"title":"Delayed continuous time Markov chains for genetic regulatory circuits","publication_status":"published","oa_version":"None","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:01:36Z","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"language":[{"iso":"eng"}],"page":"294 - 309","quality_controlled":"1","ec_funded":1,"conference":{"location":"Berkeley, CA, USA","end_date":"2012-07-13","name":"CAV: Computer Aided Verification","start_date":"2012-07-07"},"publisher":"Springer","date_published":"2012-07-01T00:00:00Z","type":"conference","date_updated":"2021-01-12T07:41:18Z","year":"2012","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:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">10.1007/978-3-642-31424-7_24</a>","apa":"Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">https://doi.org/10.1007/978-3-642-31424-7_24</a>","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.","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. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">https://doi.org/10.1007/978-3-642-31424-7_24</a>.","mla":"Guet, Calin C., et al. <i>Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits</i>. Vol. 7358, Springer, 2012, pp. 294–309, doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">10.1007/978-3-642-31424-7_24</a>.","short":"C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.","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."},"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."}],"publist_id":"3561","doi":"10.1007/978-3-642-31424-7_24","day":"01","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative Reactive Modeling (QUAREM) and by the Swiss National Science Foundation.","volume":"7358 "},{"conference":{"location":"Stockholm, Sweden","end_date":"2012-06-16","name":"FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems ","start_date":"2012-06-13"},"language":[{"iso":"eng"}],"month":"06","oa_version":"Submitted Version","has_accepted_license":"1","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","file_name":"IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf","date_updated":"2020-07-14T12:46:01Z","file_size":493198,"checksum":"feae2e07f2d9a59843f8ddabf25d179f","date_created":"2018-12-12T10:11:25Z","creator":"system","file_id":"4879","access_level":"open_access","relation":"main_file"}],"oa":1,"publist_id":"3539","date_published":"2012-06-01T00:00:00Z","type":"conference","publisher":"Springer","file_date_updated":"2020-07-14T12:46:01Z","page":"203 - 218","quality_controlled":"1","title":"Synchronous interface theories and time triggered scheduling","alternative_title":["LNCS"],"pubrep_id":"88","intvolume":"      7273","publication_status":"published","date_created":"2018-12-11T12:01:43Z","department":[{"_id":"ToHe"}],"author":[{"full_name":"Delahaye, Benoît","last_name":"Delahaye","first_name":"Benoît"},{"full_name":"Fahrenberg, Uli","first_name":"Uli","last_name":"Fahrenberg"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"_id":"3155","scopus_import":1,"ddc":["004"],"acknowledgement":"Research partially supported by the Danish-Chinese Center for Cyber Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB.","volume":7273,"abstract":[{"text":"We propose synchronous interfaces, a new interface theory for discrete-time systems. We use an application to time-triggered scheduling to drive the design choices for our formalism; in particular, additionally to deriving useful mathematical properties, we focus on providing a syntax which is adapted to natural high-level system modeling. As a result, we develop an interface model that relies on a guarded-command based language and is equipped with shared variables and explicit discrete-time clocks. We define all standard interface operations: compatibility checking, composition, refinement, and shared refinement. Apart from the synchronous interface model, the contribution of this paper is the establishment of a formal relation between interface theories and real-time scheduling, where we demonstrate a fully automatic framework for the incremental computation of time-triggered schedules.","lang":"eng"}],"doi":"10.1007/978-3-642-30793-5_13","day":"01","date_updated":"2021-01-12T07:41:26Z","citation":{"short":"B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218.","mla":"Delahaye, Benoît, et al. <i>Synchronous Interface Theories and Time Triggered Scheduling</i>. Vol. 7273, Springer, 2012, pp. 203–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">10.1007/978-3-642-30793-5_13</a>.","ista":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous interface theories and time triggered scheduling. FORTE: Formal Techniques for Networked and Distributed Systems &#38; FMOODS: Formal Methods for Open Object-Based Distributed Systems , LNCS, vol. 7273, 203–218.","ama":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218. doi:<a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">10.1007/978-3-642-30793-5_13</a>","apa":"Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., &#38; Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems &#38; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">https://doi.org/10.1007/978-3-642-30793-5_13</a>","chicago":"Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">https://doi.org/10.1007/978-3-642-30793-5_13</a>.","ieee":"B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous interface theories and time triggered scheduling,” presented at the FORTE: Formal Techniques for Networked and Distributed Systems &#38; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273, pp. 203–218."},"year":"2012"},{"day":"01","doi":"10.1007/978-3-642-29860-8_12","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"}],"citation":{"ista":"Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.","short":"E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.","mla":"Asarin, Eugene, et al. <i>Parametric Identification of Temporal Properties</i>. Vol. 7186, Springer, 2012, pp. 147–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">10.1007/978-3-642-29860-8_12</a>.","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.","chicago":"Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">https://doi.org/10.1007/978-3-642-29860-8_12</a>.","apa":"Asarin, E., Donzé, A., Maler, O., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">https://doi.org/10.1007/978-3-642-29860-8_12</a>","ama":"Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:<a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">10.1007/978-3-642-29860-8_12</a>"},"year":"2012","date_updated":"2021-01-12T07:41:29Z","volume":7186,"ddc":["000"],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:01:45Z","article_processing_charge":"No","publication_status":"published","intvolume":"      7186","alternative_title":["LNCS"],"title":"Parametric identification of temporal properties","scopus_import":1,"_id":"3162","author":[{"full_name":"Asarin, Eugene","first_name":"Eugene","last_name":"Asarin"},{"full_name":"Donzé, Alexandre","last_name":"Donzé","first_name":"Alexandre"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"publisher":"Springer","quality_controlled":"1","page":"147 - 160","file_date_updated":"2020-07-14T12:46:01Z","oa":1,"publist_id":"3525","type":"conference","date_published":"2012-01-01T00:00:00Z","file":[{"date_updated":"2020-07-14T12:46:01Z","content_type":"application/pdf","file_name":"2012_RV_Asarin.pdf","date_created":"2020-05-15T12:50:15Z","file_size":374726,"checksum":"ba4a75287008fc64b8fbf78a7476ec32","file_id":"7862","creator":"dernst","relation":"main_file","access_level":"open_access"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","month":"01","has_accepted_license":"1","conference":{"start_date":"2011-09-27","name":"RV: Runtime Verification","location":"San Francisco, CA, United States","end_date":"2011-09-30"},"language":[{"iso":"eng"}]},{"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:01:47Z","oa_version":"None","publication_status":"published","intvolume":"       431","month":"05","title":"Lumpability abstractions of rule based systems","pubrep_id":"73","scopus_import":1,"_id":"3168","publication":"Theoretical Computer Science","author":[{"last_name":"Feret","first_name":"Jérôme","full_name":"Feret, Jérôme"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"},{"first_name":"Tatjana","last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Elsevier","quality_controlled":"1","page":"137 - 164","language":[{"iso":"eng"}],"day":"04","doi":"10.1016/j.tcs.2011.12.059","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."}],"year":"2012","citation":{"chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>.","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” <i>Theoretical Computer Science</i>, vol. 431. Elsevier, pp. 137–164, 2012.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2012). Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. 2012;431:137-164. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>, vol. 431, Elsevier, 2012, pp. 137–64, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>."},"date_updated":"2023-02-23T11:39:40Z","type":"journal_article","date_published":"2012-05-04T00:00:00Z","volume":431,"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).","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"3719","relation":"earlier_version","status":"public"}]}}]