[{"day":"29","year":"2010","volume":6200,"alternative_title":["LNCS"],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna"}],"quality_controlled":"1","series_title":"Essays in Memory of Amir Pnueli","publisher":"Springer","publication_status":"published","type":"book_chapter","date_updated":"2024-10-09T20:53:58Z","title":"Quantitative Simulation Games","department":[{"_id":"ToHe"}],"publist_id":"1064","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","editor":[{"last_name":"Manna","full_name":"Manna, Zohar","first_name":"Zohar"},{"last_name":"Peled","first_name":"Doron","full_name":"Peled, Doron"}],"date_published":"2010-07-29T00:00:00Z","ec_funded":1,"scopus_import":1,"abstract":[{"lang":"eng","text":"While a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a distance function on systems and properties, where the distance between a system and a property provides a measure of “fit” or “desirability.” In this article, we explore several ways how the simulation preorder can be generalized to a distance function. This is done by equipping the classical simulation game between a system and a property with quantitative objectives. In particular, for systems that satisfy a property, a quantitative simulation game can measure the “robustness” of the satisfaction, that is, how much the system can deviate from its nominal behavior while still satisfying the property. For systems that violate a property, a quantitative simulation game can measure the “seriousness” of the violation, that is, how much the property has to be modified so that it is satisfied by the system. These distances can be computed in polynomial time, since the computation reduces to the value problem in limit average games with constant weights. Finally, we demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes. "}],"date_created":"2018-12-11T12:08:37Z","month":"07","publication":"Time For Verification: Essays in Memory of Amir Pnueli","doi":"10.1007/978-3-642-13754-9_3","oa_version":"None","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60.","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. <i>Time For Verification: Essays in Memory of Amir Pnueli</i>. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>"},"_id":"4392","corr_author":"1","intvolume":"      6200","language":[{"iso":"eng"}],"page":"42 - 60"},{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5389"},{"status":"public","relation":"later_version","id":"3249"}]},"date_published":"2010-11-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publist_id":"1065","pubrep_id":"42","page":"235 - 268","language":[{"iso":"eng"}],"_id":"4393","corr_author":"1","intvolume":"      6269","oa_version":"Submitted Version","doi":"10.1007/978-3-642-15375-4_18","citation":{"mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268."},"date_created":"2018-12-11T12:08:37Z","month":"11","oa":1,"scopus_import":1,"abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"ec_funded":1,"conference":{"end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France"},"project":[{"grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373"}],"file_date_updated":"2020-07-14T12:46:28Z","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","alternative_title":["LNCS"],"year":"2010","volume":6269,"day":"01","title":"Simulation distances","department":[{"_id":"ToHe"}],"date_updated":"2025-09-30T07:46:05Z","has_accepted_license":"1","publication_status":"published","type":"conference","file":[{"creator":"system","content_type":"application/pdf","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","relation":"main_file","date_created":"2018-12-12T10:15:12Z","file_id":"5130","file_size":198913,"checksum":"ea567903676ba8afe0507ee11313dce5","access_level":"open_access","date_updated":"2020-07-14T12:46:28Z"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["005"],"author":[{"first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna"}],"quality_controlled":"1"},{"oa":1,"date_created":"2018-12-11T12:08:38Z","month":"04","scopus_import":1,"abstract":[{"text":"Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool.","lang":"eng"}],"language":[{"iso":"eng"}],"page":"263 - 277","citation":{"ama":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. Shape refinement through explicit heap analysis. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:263-277. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>","apa":"Beyer, D., Henzinger, T. A., Théoduloz, G., &#38; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>","ieee":"D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.","chicago":"Beyer, Dirk, Thomas A Henzinger, Grégory Théoduloz, and Damien Zufferey. “Shape Refinement through Explicit Heap Analysis.” edited by David Rosenblum and Gabriele Taenzer, 6013:263–77. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">https://doi.org/10.1007/978-3-642-12029-9_19</a>.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.","ista":"Beyer D, Henzinger TA, Théoduloz G, Zufferey D. 2010. Shape refinement through explicit heap analysis. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 263–277.","mla":"Beyer, Dirk, et al. <i>Shape Refinement through Explicit Heap Analysis</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_19\">10.1007/978-3-642-12029-9_19</a>."},"doi":"10.1007/978-3-642-12029-9_19","oa_version":"Submitted Version","intvolume":"      6013","_id":"4396","publist_id":"1061","pubrep_id":"41","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2010-04-21T00:00:00Z","editor":[{"full_name":"Rosenblum, David","first_name":"David","last_name":"Rosenblum"},{"first_name":"Gabriele","full_name":"Taenzer, Gabriele","last_name":"Taenzer"}],"publisher":"Springer","ddc":["004"],"quality_controlled":"1","author":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Théoduloz, Grégory","first_name":"Grégory","last_name":"Théoduloz"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","last_name":"Zufferey","full_name":"Zufferey, Damien","first_name":"Damien"}],"has_accepted_license":"1","date_updated":"2021-01-12T07:56:40Z","title":"Shape refinement through explicit heap analysis","department":[{"_id":"ToHe"}],"file":[{"date_updated":"2020-07-14T12:46:29Z","access_level":"open_access","checksum":"7d26e59a9681487d7283eba337292b2c","file_size":312147,"date_created":"2018-12-12T10:18:13Z","file_id":"5332","relation":"main_file","creator":"system","content_type":"application/pdf","file_name":"IST-2012-41-v1+1_Shape_refinement_through_explicit_heap_analysis.pdf"}],"type":"conference","publication_status":"published","alternative_title":["LNCS"],"day":"21","volume":6013,"year":"2010","project":[{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"conference":{"start_date":"2010-03-20","name":"FASE: Fundamental Approaches To Software Engineering","end_date":"2010-03-28","location":"Paphos, Cyprus"},"file_date_updated":"2020-07-14T12:46:29Z"},{"publication_status":"published","type":"conference","file":[{"file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4677","date_created":"2018-12-12T10:08:17Z","file_size":240766,"checksum":"3e610de84937d821316362658239134a","access_level":"open_access","date_updated":"2020-07-14T12:46:27Z"}],"department":[{"_id":"ToHe"}],"title":"Forward analysis of depth-bounded processes","date_updated":"2026-04-09T14:35:23Z","has_accepted_license":"1","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas"},{"first_name":"Damien","full_name":"Zufferey, Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"quality_controlled":"1","publisher":"Springer","ddc":["004"],"file_date_updated":"2020-07-14T12:46:27Z","conference":{"end_date":"2010-03-28","name":"FoSSaCS: Foundations of Software Science and Computation Structures","start_date":"2010-03-20","location":"Paphos, Cyprus"},"year":"2010","volume":6014,"day":"01","alternative_title":["LNCS"],"_id":"4361","corr_author":"1","intvolume":"      6014","doi":"10.1007/978-3-642-12032-9_8","oa_version":"Submitted Version","citation":{"ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>.","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","apa":"Wies, T., Zufferey, D., &#38; Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>","mla":"Wies, Thomas, et al. <i>Forward Analysis of Depth-Bounded Processes</i>. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>.","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108.","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108."},"page":"94 - 108","language":[{"iso":"eng"}],"abstract":[{"text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems.","lang":"eng"}],"scopus_import":1,"month":"03","date_created":"2018-12-11T12:08:27Z","oa":1,"editor":[{"full_name":"Ong, Luke","first_name":"Luke","last_name":"Ong"}],"date_published":"2010-03-01T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1405"}]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","pubrep_id":"50","publist_id":"1099"},{"date_published":"2009-10-09T00:00:00Z","related_material":{"record":[{"id":"4388","status":"public","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"issn":["2664-1690"]},"pubrep_id":"29","page":"12","language":[{"iso":"eng"}],"corr_author":"1","_id":"5393","doi":"10.15479/AT:IST-2009-0003","oa_version":"Published Version","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">10.15479/AT:IST-2009-0003</a>","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2009). <i>Gist: A solver for probabilistic games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. <i>Gist: A Solver for Probabilistic Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0003\">https://doi.org/10.15479/AT:IST-2009-0003</a>.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, <i>Gist: A solver for probabilistic games</i>. IST Austria, 2009."},"month":"10","date_created":"2018-12-12T11:39:05Z","oa":1,"abstract":[{"lang":"eng","text":"Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides efficient implementations of several reduction based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications."}],"file_date_updated":"2020-07-14T12:46:43Z","alternative_title":["IST Austria Technical Report"],"year":"2009","day":"09","title":"Gist: A solver for probabilistic games","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2025-04-14T13:37:27Z","has_accepted_license":"1","publication_status":"published","type":"technical_report","file":[{"content_type":"application/pdf","creator":"system","file_name":"IST-2009-0003_IST-2009-0003.pdf","relation":"main_file","date_created":"2018-12-12T11:52:58Z","file_id":"5459","file_size":386866,"checksum":"49551ac552915b17593a14c993845274","access_level":"open_access","date_updated":"2020-07-14T12:46:43Z"}],"publisher":"IST Austria","ddc":["000","005"],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}]},{"date_updated":"2024-10-09T21:08:23Z","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Improved lower bounds for request-response and finitary Streett games","page":"11","doi":"10.15479/AT:IST-2009-0002","oa_version":"Published Version","citation":{"ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.","mla":"Chatterjee, Krishnendu, et al. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.","ama":"Chatterjee K, Henzinger TA, Horn F. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">10.15479/AT:IST-2009-0002</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. <i>Improved Lower Bounds for Request-Response and Finitary Streett Games</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0002\">https://doi.org/10.15479/AT:IST-2009-0002</a>","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, <i>Improved lower bounds for request-response and finitary Streett games</i>. IST Austria, 2009."},"file":[{"file_size":238091,"file_id":"5511","date_created":"2018-12-12T11:53:50Z","relation":"main_file","file_name":"IST-2009-0002_IST-2009-0002.pdf","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:43Z","access_level":"open_access","checksum":"1c50a9723fbae1b2c46d18138968efb3"}],"publication_status":"published","_id":"5394","corr_author":"1","type":"technical_report","oa":1,"publisher":"IST Austria","ddc":["004"],"month":"09","date_created":"2018-12-12T11:39:05Z","abstract":[{"lang":"eng","text":"We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players."}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Florian","full_name":"Horn, Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:46:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2009-09-09T00:00:00Z","alternative_title":["IST Austria Technical Report"],"day":"09","pubrep_id":"30","year":"2009","publication_identifier":{"issn":["2664-1690"]}},{"oa":1,"month":"09","date_created":"2018-12-12T11:39:05Z","abstract":[{"text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observa- tions. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDPs with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDPs with parity objectives and its subclasses.","lang":"eng"}],"language":[{"iso":"eng"}],"page":"20","citation":{"ama":"Chatterjee K, Doyen L, Henzinger TA. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">10.15479/AT:IST-2009-0001</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, <i>Qualitative analysis of partially-observable Markov decision processes</i>. IST Austria, 2009.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">https://doi.org/10.15479/AT:IST-2009-0001</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). <i>Qualitative analysis of partially-observable Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">https://doi.org/10.15479/AT:IST-2009-0001</a>","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0001\">10.15479/AT:IST-2009-0001</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009."},"doi":"10.15479/AT:IST-2009-0001","oa_version":"Published Version","_id":"5395","corr_author":"1","pubrep_id":"31","publication_identifier":{"issn":["2664-1690"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"3855"}]},"date_published":"2009-09-09T00:00:00Z","publisher":"IST Austria","ddc":["005"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"has_accepted_license":"1","date_updated":"2025-04-14T13:37:25Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Qualitative analysis of partially-observable Markov decision processes","file":[{"creator":"system","content_type":"application/pdf","file_name":"IST-2009-0001_IST-2009-0001.pdf","relation":"main_file","date_created":"2018-12-12T11:53:25Z","file_id":"5486","file_size":342088,"checksum":"04d9cc065cc19598a4e8631c47f1a562","access_level":"open_access","date_updated":"2020-07-14T12:46:43Z"}],"type":"technical_report","publication_status":"published","alternative_title":["IST Austria Technical Report"],"day":"09","year":"2009","file_date_updated":"2020-07-14T12:46:43Z"},{"day":"01","year":"2009","acknowledgement":"This work is supported by the Center for Hybrid and Embedded Software Systems (CHESS) at UC Berkeley, which receives support from the National Science Foundation (NSF awards #0720882 (CSR-EHS: PRET) and #0720841 (CSR-CPS)), the U.S. Army Research Office (ARO #W911NF-07-2-0019), the U.S. Air Force Office of Scientific Research (MURI #FA9550-06-0312), the Air Force Research Lab (AFRL), the State of California Micro Program, and the following companies: Agilent, Bosch, Lockheed-Martin, National Instruments, Thales and Toyota. This work is also supported by the COMBEST and ArtistDesign projects of the European Union, and the Swiss National Science Foundation. ","file_date_updated":"2020-07-14T12:46:16Z","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"conference":{"location":"Grenoble, France","name":"EMSOFT: Embedded Software ","start_date":"2009-10-12","end_date":"2009-10-16"},"author":[{"last_name":"Tripakis","full_name":"Tripakis, Stavros","first_name":"Stavros"},{"last_name":"Lickly","first_name":"Ben","full_name":"Lickly, Ben"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Lee, Edward","first_name":"Edward","last_name":"Lee"}],"quality_controlled":"1","publisher":"ACM","ddc":["004"],"file":[{"date_created":"2018-12-12T10:13:57Z","file_id":"5045","file_size":310902,"creator":"system","content_type":"application/pdf","file_name":"IST-2012-70-v1+1_On_Relational_Interfaces.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:16Z","checksum":"3a70e21527dfaad2f198549ae5710786","access_level":"open_access"}],"publication_status":"published","type":"conference","date_updated":"2024-10-21T06:03:06Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"title":"On relational interfaces","pubrep_id":"70","publist_id":"2360","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2009-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"In this paper we extend the work of Alfaro, Henzinger et al. on interface theories for component-based design. Existing interface theories often fail to capture functional relations between the inputs and outputs of an interface. For example, a simple synchronous interface that takes as input a number n ≥ 0 and returns, at the same time, as output n + 1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports synchronous interfaces, both stateless and stateful. It includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions."}],"ec_funded":1,"scopus_import":"1","oa":1,"publication":"EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software","month":"01","date_created":"2018-12-11T12:05:26Z","doi":"10.1145/1629335.1629346","oa_version":"Submitted Version","citation":{"short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.","mla":"Tripakis, Stavros, et al. “On Relational Interfaces.” <i>EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software</i>, ACM, 2009, pp. 67–76, doi:<a href=\"https://doi.org/10.1145/1629335.1629346\">10.1145/1629335.1629346</a>.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2009. On relational interfaces. EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software. EMSOFT: Embedded Software , 67–76.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2009). On relational interfaces. In <i>EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software</i> (pp. 67–76). Grenoble, France: ACM. <a href=\"https://doi.org/10.1145/1629335.1629346\">https://doi.org/10.1145/1629335.1629346</a>","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On Relational Interfaces.” In <i>EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software</i>, 67–76. ACM, 2009. <a href=\"https://doi.org/10.1145/1629335.1629346\">https://doi.org/10.1145/1629335.1629346</a>.","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,” in <i>EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software</i>, Grenoble, France, 2009, pp. 67–76.","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. On relational interfaces. In: <i>EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software</i>. ACM; 2009:67-76. doi:<a href=\"https://doi.org/10.1145/1629335.1629346\">10.1145/1629335.1629346</a>"},"_id":"3837","language":[{"iso":"eng"}],"page":"67 - 76"},{"author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"quality_controlled":"1","ddc":["005"],"publisher":"Springer","file":[{"access_level":"open_access","checksum":"df88431872586c773fbcfea37d7b36a2","date_updated":"2020-07-14T12:46:16Z","relation":"main_file","creator":"system","content_type":"application/pdf","file_name":"IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf","file_size":222840,"date_created":"2018-12-12T10:08:41Z","file_id":"4702"}],"publication_status":"published","type":"conference","date_updated":"2025-09-30T08:49:00Z","has_accepted_license":"1","title":"Formalisms for specifying Markovian population models","department":[{"_id":"ToHe"}],"day":"07","year":"2009","volume":5797,"acknowledgement":"This research was supported in part by the Excellence Cluster on Multimodal Computing and Interaction and the Swiss National Science Foundation.","alternative_title":["LNCS"],"file_date_updated":"2020-07-14T12:46:16Z","conference":{"location":"Palaiseau, France","name":"RP: Reachability Problems","start_date":"2009-09-23","end_date":"2009-09-25"},"abstract":[{"lang":"eng","text":"We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model. "}],"scopus_import":1,"oa":1,"month":"09","date_created":"2018-12-11T12:05:28Z","doi":"10.1007/978-3-642-04420-5_2","oa_version":"Submitted Version","citation":{"short":"T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.","mla":"Henzinger, Thomas A., et al. <i>Formalisms for Specifying Markovian Population Models</i>. Vol. 5797, Springer, 2009, pp. 3–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">10.1007/978-3-642-04420-5_2</a>.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,” 5797:3–23. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">https://doi.org/10.1007/978-3-642-04420-5_2</a>.","apa":"Henzinger, T. A., Jobstmann, B., &#38; Wolf, V. (2009). Formalisms for specifying Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability Problems, Palaiseau, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">https://doi.org/10.1007/978-3-642-04420-5_2</a>","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. In: Vol 5797. Springer; 2009:3-23. doi:<a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">10.1007/978-3-642-04420-5_2</a>"},"_id":"3841","intvolume":"      5797","language":[{"iso":"eng"}],"page":"3 - 23","pubrep_id":"67","publist_id":"2352","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"id":"3381","relation":"later_version","status":"public"}]},"date_published":"2009-09-07T00:00:00Z"},{"related_material":{"record":[{"id":"3842","status":"public","relation":"later_version"}]},"date_published":"2009-10-30T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","publist_id":"2348","page":"118 - 127","language":[{"iso":"eng"}],"_id":"3843","intvolume":"         4","doi":"10.1109/HiBi.2009.23","oa_version":"Submitted Version","citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Fast adaptive uniformization of the chemical master equation. HIBI: High-Performance Computational Systems Biology vol. 4, 118–127.","mla":"Didier, Frédéric, et al. <i>Fast Adaptive Uniformization of the Chemical Master Equation</i>. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:<a href=\"https://doi.org/10.1109/HiBi.2009.23\">10.1109/HiBi.2009.23</a>.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. In: Vol 4. IEEE; 2009:118-127. doi:<a href=\"https://doi.org/10.1109/HiBi.2009.23\">10.1109/HiBi.2009.23</a>","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation,” 4:118–27. IEEE, 2009. <a href=\"https://doi.org/10.1109/HiBi.2009.23\">https://doi.org/10.1109/HiBi.2009.23</a>.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Fast adaptive uniformization of the chemical master equation (Vol. 4, pp. 118–127). Presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy: IEEE. <a href=\"https://doi.org/10.1109/HiBi.2009.23\">https://doi.org/10.1109/HiBi.2009.23</a>","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127."},"month":"10","date_created":"2018-12-11T12:05:28Z","oa":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous- time Markov chain (CTMC).\r\nStandard Uniformization (SU) is an efficient method for the transient analysis of CTMCs. For systems with very different time scales, such as biochemical reaction networks, SU is computationally expensive. In these cases, a variant of SU, called adaptive uniformization (AU), is known to reduce the large number of iterations needed by SU. The additional difficulty of AU is that it requires the solution of a birth process.\r\nIn this paper we present an on-the-fly variant of AU, where we improve the original algorithm for AU at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks."}],"conference":{"start_date":"2009-10-14","name":"HIBI: High-Performance Computational Systems Biology","end_date":"2009-10-16","location":"Trento, Italy"},"external_id":{"isi":["000275038300017"]},"file_date_updated":"2020-07-14T12:46:17Z","isi":1,"acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","year":"2009","volume":4,"day":"30","article_processing_charge":"No","title":"Fast adaptive uniformization of the chemical master equation","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_updated":"2025-09-30T09:54:51Z","has_accepted_license":"1","issue":"6","publication_status":"published","type":"conference","file":[{"file_name":"2009_HIBI_Didier.pdf","content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7874","date_created":"2020-05-19T16:33:55Z","file_size":222890,"checksum":"9a3bde48f43203991a0b3c6a277c2f5b","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z"}],"ddc":["000"],"publisher":"IEEE","author":[{"full_name":"Didier, Frédéric","first_name":"Frédéric","last_name":"Didier"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","full_name":"Mateescu, Maria"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"quality_controlled":"1"},{"year":"2009","day":"01","isi":1,"acknowledgement":"Supported by the EU ArtistDesign Network of Excellence on Embedded Systems Design, the EU project COMBEST, the Austrian Science Funds P18913-N15 and V00125, and Fundacao para a Ciencia e Tecnologia funds SFRH/BD/29461/2006 and PTDC/EIA/71462/2006","file_date_updated":"2020-07-14T12:46:17Z","conference":{"location":"Washington, DC, United States","end_date":"2009-12-04","name":"RTSS: Real-Time Systems Symposium","start_date":"2009-12-01"},"external_id":{"isi":["000277465500016"]},"project":[{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"},{"call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Kirsch, Christoph","first_name":"Christoph","last_name":"Kirsch"},{"last_name":"Marques","full_name":"Marques, Eduardo","first_name":"Eduardo"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"quality_controlled":"1","ddc":["000"],"publisher":"IEEE","publication_status":"published","type":"conference","file":[{"file_id":"4655","date_created":"2018-12-12T10:07:56Z","file_size":526458,"file_name":"IST-2012-65-v1+1_Distributed_modular_Htl.pdf","content_type":"application/pdf","creator":"system","relation":"main_file","date_updated":"2020-07-14T12:46:17Z","checksum":"b2b15a5ef71eb50d62eaa5aea7efd8c4","access_level":"open_access"}],"article_processing_charge":"No","title":"Distributed, modular HTL","department":[{"_id":"ToHe"}],"date_updated":"2025-09-30T09:54:22Z","has_accepted_license":"1","pubrep_id":"65","publist_id":"2346","date_published":"2009-01-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","abstract":[{"text":"The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety (schedulability of host computation). We present a modular abstract syntax and semantics for HTL, modular checks of well-formedness, race freedom, and transmission safety, and modular code distribution. Our contributions here complement previous results on HTL time safety and modular code generation. Modularity in HTL can be utilized in easy program composition as well as fast program analysis and code generation, but also in so-called runtime patching, where program components may be modified at runtime.","lang":"eng"}],"scopus_import":"1","ec_funded":1,"date_created":"2018-12-11T12:05:28Z","month":"01","oa":1,"_id":"3844","doi":"10.1109/RTSS.2009.9","oa_version":"Submitted Version","citation":{"mla":"Henzinger, Thomas A., et al. <i>Distributed, Modular HTL</i>. IEEE, 2009, pp. 171–80, doi:<a href=\"https://doi.org/10.1109/RTSS.2009.9\">10.1109/RTSS.2009.9</a>.","ista":"Henzinger TA, Kirsch C, Marques E, Sokolova A. 2009. Distributed, modular HTL. RTSS: Real-Time Systems Symposium, 171–180.","short":"T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova. “Distributed, Modular HTL,” 171–80. IEEE, 2009. <a href=\"https://doi.org/10.1109/RTSS.2009.9\">https://doi.org/10.1109/RTSS.2009.9</a>.","apa":"Henzinger, T. A., Kirsch, C., Marques, E., &#38; Sokolova, A. (2009). Distributed, modular HTL (pp. 171–180). Presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States: IEEE. <a href=\"https://doi.org/10.1109/RTSS.2009.9\">https://doi.org/10.1109/RTSS.2009.9</a>","ieee":"T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States, 2009, pp. 171–180.","ama":"Henzinger TA, Kirsch C, Marques E, Sokolova A. Distributed, modular HTL. In: IEEE; 2009:171-180. doi:<a href=\"https://doi.org/10.1109/RTSS.2009.9\">10.1109/RTSS.2009.9</a>"},"page":"171 - 180","language":[{"iso":"eng"}]}]