[{"page":"149 - 158","status":"public","abstract":[{"text":"Computing an approximation of the reachable states of a hybrid system is a challenge, mainly because overapproximating the solutions of ODEs with a finite number of sets does not scale well. Using template polyhedra can greatly reduce the computational complexity, since it replaces complex operations on sets with a small number of optimization problems. However, the use of templates may make the over-approximation too conservative. Spurious transitions, which are falsely considered reachable, are particularly detrimental to performance and accuracy, and may exacerbate the state explosion problem. In this paper, we examine how spurious transitions can be avoided with minimal computational effort. To this end, detecting spurious transitions is reduced to the well-known problem of showing that two convex sets are disjoint by finding a hyperplane that separates them. We generalize this to owpipes by considering hyperplanes that evolve with time in correspondence to the dynamics of the system. The approach is implemented in the model checker SpaceEx and demonstrated on examples.","lang":"eng"}],"department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"author":[{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marius","last_name":"Greitschus","full_name":"Greitschus, Marius"},{"first_name":"Thomas","last_name":"Strump","full_name":"Strump, Thomas"},{"last_name":"Podelski","full_name":"Podelski, Andreas","first_name":"Andreas"}],"title":"Eliminating spurious transitions in reachability with support functions","publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","publication_identifier":{"isbn":["978-1-4503-3433-4"]},"year":"2015","_id":"1692","conference":{"end_date":"2015-04-16","start_date":"2015-04-14","location":"Seattle, WA, United States","name":"HSCC: Hybrid Systems - Computation and Control"},"scopus_import":1,"ec_funded":1,"day":"14","publication_status":"published","doi":"10.1145/2728606.2728622","date_updated":"2025-04-15T06:26:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:30Z","month":"04","publisher":"ACM","publist_id":"5452","fulldoi":"https://doi.org/10.1145/2728606.2728622","quality_controlled":"1","citation":{"short":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, A. Podelski, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–158.","chicago":"Frehse, Goran, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, and Andreas Podelski. “Eliminating Spurious Transitions in Reachability with Support Functions.” In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, 149–58. ACM, 2015. <a href=\"https://doi.org/10.1145/2728606.2728622\">https://doi.org/10.1145/2728606.2728622</a>.","ieee":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, and A. Podelski, “Eliminating spurious transitions in reachability with support functions,” in <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, Seattle, WA, United States, 2015, pp. 149–158.","apa":"Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., &#38; Podelski, A. (2015). Eliminating spurious transitions in reachability with support functions. In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i> (pp. 149–158). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2728606.2728622\">https://doi.org/10.1145/2728606.2728622</a>","ama":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. Eliminating spurious transitions in reachability with support functions. In: <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>. ACM; 2015:149-158. doi:<a href=\"https://doi.org/10.1145/2728606.2728622\">10.1145/2728606.2728622</a>","mla":"Frehse, Goran, et al. “Eliminating Spurious Transitions in Reachability with Support Functions.” <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, ACM, 2015, pp. 149–58, doi:<a href=\"https://doi.org/10.1145/2728606.2728622\">10.1145/2728606.2728622</a>.","ista":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. 2015. Eliminating spurious transitions in reachability with support functions. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 149–158."},"oa_version":"None","type":"conference","date_published":"2015-04-14T00:00:00Z","language":[{"iso":"eng"}]},{"main_file_link":[{"url":"http://arxiv.org/abs/1209.3234","open_access":"1"}],"quality_controlled":"1","month":"04","external_id":{"arxiv":["1209.3234"],"isi":["000353352800008"]},"volume":241,"language":[{"iso":"eng"}],"oa_version":"Preprint","intvolume":"       241","type":"journal_article","date_published":"2015-04-01T00:00:00Z","corr_author":"1","status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"doi":"10.1016/j.ic.2015.03.001","scopus_import":"1","publist_id":"5443","fulldoi":"https://doi.org/10.1016/j.ic.2015.03.001","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148), ERC Start grant (279499: inVEST).","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publisher":"Elsevier","date_created":"2018-12-11T11:53:32Z","issue":"4","citation":{"chicago":"Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>.","short":"Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.","ieee":"Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” <i>Information and Computation</i>, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.","ista":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015. The complexity of multi-mean-payoff and multi-energy games. Information and Computation. 241(4), 177–196.","apa":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &#38; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">https://doi.org/10.1016/j.ic.2015.03.001</a>","mla":"Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.” <i>Information and Computation</i>, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>.","ama":"Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The complexity of multi-mean-payoff and multi-energy games. <i>Information and Computation</i>. 2015;241(4):177-196. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.001\">10.1016/j.ic.2015.03.001</a>"},"oa":1,"year":"2015","_id":"1698","abstract":[{"lang":"eng","text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Multi-mean-payoff and multi-energy games replace individual weights by tuples, and the limit average (resp., running sum) of each coordinate must be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy games and show inter-reducibility of multi-mean-payoff and multi-energy games for finite-memory strategies. We improve the computational complexity for solving both classes with finite-memory strategies: we prove coNP-completeness improving the previous known EXPSPACE bound. For memoryless strategies, we show that deciding the existence of a winning strategy for the protagonist is NP-complete. We present the first solution of multi-mean-payoff games with infinite-memory strategies: we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf objectives are coNP-complete."}],"page":"177 - 196","title":"The complexity of multi-mean-payoff and multi-energy games","author":[{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Rabinovich","full_name":"Rabinovich, Alexander","first_name":"Alexander"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"publication":"Information and Computation","date_updated":"2025-09-23T13:47:20Z","arxiv":1,"ec_funded":1,"publication_status":"published","day":"01","article_processing_charge":"No"},{"date_updated":"2025-09-23T10:33:12Z","ec_funded":1,"article_processing_charge":"No","day":"01","publication_status":"published","year":"2015","_id":"1846","page":"269 - 297","abstract":[{"text":"Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS.","lang":"eng"}],"author":[{"full_name":"Beneš, Nikola","last_name":"Beneš","first_name":"Nikola"},{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"full_name":"Larsen, Kim","last_name":"Larsen","first_name":"Kim"},{"full_name":"Möller, Mikael","last_name":"Möller","first_name":"Mikael"},{"last_name":"Sickert","full_name":"Sickert, Salomon","first_name":"Salomon"},{"first_name":"Jiří","full_name":"Srba, Jiří","last_name":"Srba"}],"title":"Refinement checking on parametric modal transition systems","publication":"Acta Informatica","article_type":"original","issue":"2-3","file_date_updated":"2020-07-14T12:45:19Z","citation":{"ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","ama":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. 2015;52(2-3):269-297. doi:<a href=\"https://doi.org/10.1007/s00236-015-0215-4\">10.1007/s00236-015-0215-4</a>","mla":"Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:<a href=\"https://doi.org/10.1007/s00236-015-0215-4\">10.1007/s00236-015-0215-4</a>.","apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &#38; Srba, J. (2015). Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>","ieee":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” <i>Acta Informatica</i>, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.","chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>."},"oa":1,"fulldoi":"https://doi.org/10.1007/s00236-015-0215-4","publist_id":"5255","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:20Z","publisher":"Springer","isi":1,"doi":"10.1007/s00236-015-0215-4","scopus_import":"1","corr_author":"1","status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"volume":52,"external_id":{"isi":["000351160200008"]},"oa_version":"Submitted Version","date_published":"2015-04-01T00:00:00Z","type":"journal_article","intvolume":"        52","file":[{"date_updated":"2020-07-14T12:45:19Z","file_name":"2015_ActaInfo_Benes.pdf","content_type":"application/pdf","checksum":"fb4037ddc4fc05f33080dd3547ede350","creator":"dernst","file_size":488482,"relation":"main_file","file_id":"7854","access_level":"open_access","date_created":"2020-05-15T08:57:44Z"}],"ddc":["000"],"quality_controlled":"1","month":"04"},{"doi":"10.1145/2699430","related_material":{"record":[{"id":"3864","relation":"earlier_version","status":"public"}]},"scopus_import":"1","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","volume":62,"external_id":{"arxiv":["1004.0739"],"isi":["000350563000009"]},"language":[{"iso":"eng"}],"intvolume":"        62","date_published":"2015-02-01T00:00:00Z","type":"journal_article","oa_version":"Preprint","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1004.0739","open_access":"1"}],"month":"02","arxiv":1,"date_updated":"2025-09-23T09:33:01Z","publication_status":"published","article_processing_charge":"No","day":"01","ec_funded":1,"_id":"1856","year":"2015","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"last_name":"Singh","full_name":"Singh, Rohit","first_name":"Rohit"}],"publication":"Journal of the ACM","title":"Measuring and synthesizing systems in probabilistic environments","abstract":[{"text":"The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ε-optimal strategy with a bounded counter, for all ε &gt; 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way.","lang":"eng"}],"issue":"1","article_number":"9","oa":1,"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” <i>Journal of the ACM</i>, vol. 62, no. 1. ACM, 2015.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","mla":"Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.” <i>Journal of the ACM</i>, vol. 62, no. 1, 9, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2699430\">10.1145/2699430</a>.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. <i>Journal of the ACM</i>. 2015;62(1). doi:<a href=\"https://doi.org/10.1145/2699430\">10.1145/2699430</a>","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2699430\">https://doi.org/10.1145/2699430</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” <i>Journal of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2699430\">https://doi.org/10.1145/2699430</a>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015)."},"fulldoi":"https://doi.org/10.1145/2699430","publist_id":"5244","isi":1,"publisher":"ACM","date_created":"2018-12-11T11:54:23Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"date_created":"2018-12-11T11:54:25Z","publisher":"ACM","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1145/2688906","publist_id":"5238","acknowledgement":"HYCON2; EC; European Commission\r\n","article_number":"8","citation":{"ieee":"J. Ruess and J. Lygeros, “Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks,” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2. ACM, 2015.","apa":"Ruess, J., &#38; Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM. <a href=\"https://doi.org/10.1145/2688906\">https://doi.org/10.1145/2688906</a>","ama":"Ruess J, Lygeros J. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. <i>ACM Transactions on Modeling and Computer Simulation</i>. 2015;25(2). doi:<a href=\"https://doi.org/10.1145/2688906\">10.1145/2688906</a>","mla":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2, 8, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2688906\">10.1145/2688906</a>.","ista":"Ruess J, Lygeros J. 2015. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 25(2), 8.","chicago":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2688906\">https://doi.org/10.1145/2688906</a>.","short":"J. Ruess, J. Lygeros, ACM Transactions on Modeling and Computer Simulation 25 (2015)."},"issue":"2","author":[{"last_name":"Ruess","full_name":"Ruess, Jakob","orcid":"0000-0003-1615-3282","first_name":"Jakob","id":"4A245D00-F248-11E8-B48F-1D18A9856A87"},{"first_name":"John","last_name":"Lygeros","full_name":"Lygeros, John"}],"publication":"ACM Transactions on Modeling and Computer Simulation","title":"Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks","abstract":[{"lang":"eng","text":"Continuous-time Markov chains are commonly used in practice for modeling biochemical reaction networks in which the inherent randomness of themolecular interactions cannot be ignored. This has motivated recent research effort into methods for parameter inference and experiment design for such models. The major difficulty is that such methods usually require one to iteratively solve the chemical master equation that governs the time evolution of the probability distribution of the system. This, however, is rarely possible, and even approximation techniques remain limited to relatively small and simple systems. An alternative explored in this article is to base methods on only some low-order moments of the entire probability distribution. We summarize the theory behind such moment-based methods for parameter inference and experiment design and provide new case studies where we investigate their performance."}],"_id":"1861","year":"2015","article_processing_charge":"No","day":"01","publication_status":"published","date_updated":"2025-09-23T09:36:19Z","month":"02","quality_controlled":"1","type":"journal_article","date_published":"2015-02-01T00:00:00Z","intvolume":"        25","oa_version":"None","language":[{"iso":"eng"}],"external_id":{"isi":["000354789200002"]},"volume":25,"department":[{"_id":"ToHe"},{"_id":"GaTk"}],"status":"public","scopus_import":"1","doi":"10.1145/2688906"},{"volume":58,"external_id":{"isi":["000349299600024"]},"language":[{"iso":"eng"}],"issue":"2","citation":{"chicago":"Henzinger, Thomas A, and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” <i>Communications of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2701001\">https://doi.org/10.1145/2701001</a>.","short":"T.A. Henzinger, J. Raskin, Communications of the ACM 58 (2015) 86–86.","mla":"Henzinger, Thomas A., and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” <i>Communications of the ACM</i>, vol. 58, no. 2, ACM, 2015, pp. 86–86, doi:<a href=\"https://doi.org/10.1145/2701001\">10.1145/2701001</a>.","apa":"Henzinger, T. A., &#38; Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. <i>Communications of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2701001\">https://doi.org/10.1145/2701001</a>","ama":"Henzinger TA, Raskin J. The equivalence problem for finite automata: Technical perspective. <i>Communications of the ACM</i>. 2015;58(2):86-86. doi:<a href=\"https://doi.org/10.1145/2701001\">10.1145/2701001</a>","ista":"Henzinger TA, Raskin J. 2015. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 58(2), 86–86.","ieee":"T. A. Henzinger and J. Raskin, “The equivalence problem for finite automata: Technical perspective,” <i>Communications of the ACM</i>, vol. 58, no. 2. ACM, pp. 86–86, 2015."},"oa_version":"None","intvolume":"        58","type":"journal_article","date_published":"2015-01-28T00:00:00Z","fulldoi":"https://doi.org/10.1145/2701001","publist_id":"5232","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"ACM","month":"01","isi":1,"date_created":"2018-12-11T11:54:26Z","doi":"10.1145/2701001","date_updated":"2025-09-23T13:49:40Z","scopus_import":"1","publication_status":"published","article_processing_charge":"No","day":"28","year":"2015","_id":"1866","status":"public","page":"86-86","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"title":"The equivalence problem for finite automata: Technical perspective","publication":"Communications of the ACM","department":[{"_id":"ToHe"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","date_created":"2018-12-11T11:54:31Z","fulldoi":"https://doi.org/10.1007/978-3-319-15317-9_19","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) project S11402-N23 (RiSE), and by the Czech Science Foundation, grant No. P202/12/G061.","publist_id":"5216","citation":{"chicago":"Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,” 8997:306–24. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">https://doi.org/10.1007/978-3-319-15317-9_19</a>.","short":"U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.","ieee":"U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.","ista":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. 2015. Compositionality for quantitative specifications. FACS: Formal Aspects of Component Software, LNCS, vol. 8997, 306–324.","ama":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">10.1007/978-3-319-15317-9_19</a>","mla":"Fahrenberg, Uli, et al. <i>Compositionality for Quantitative Specifications</i>. Vol. 8997, Springer, 2015, pp. 306–24, doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">10.1007/978-3-319-15317-9_19</a>.","apa":"Fahrenberg, U., Kretinsky, J., Legay, A., &#38; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">https://doi.org/10.1007/978-3-319-15317-9_19</a>"},"oa":1,"abstract":[{"lang":"eng","text":"We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations."}],"page":"306 - 324","author":[{"full_name":"Fahrenberg, Uli","last_name":"Fahrenberg","first_name":"Uli"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"first_name":"Louis","full_name":"Traonouez, Louis","last_name":"Traonouez"}],"title":"Compositionality for quantitative specifications","conference":{"name":"FACS: Formal Aspects of Component Software","location":"Bertinoro, Italy","start_date":"2014-09-10","end_date":"2014-09-12"},"_id":"1882","year":"2015","alternative_title":["LNCS"],"ec_funded":1,"publication_status":"published","article_processing_charge":"No","day":"30","arxiv":1,"date_updated":"2025-06-11T07:22:00Z","month":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.1256"}],"quality_controlled":"1","oa_version":"Preprint","intvolume":"      8997","type":"conference","date_published":"2015-01-30T00:00:00Z","external_id":{"arxiv":["1408.1256"]},"volume":8997,"language":[{"iso":"eng"}],"status":"public","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"corr_author":"1","scopus_import":"1","doi":"10.1007/978-3-319-15317-9_19"},{"status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"}],"doi":"10.15479/AT:IST-2015-335-v1-1","related_material":{"record":[{"status":"public","relation":"later_version","id":"1659"}]},"ddc":["004","512","513"],"file":[{"content_type":"application/pdf","checksum":"40405907aa012acece1bc26cf0be554d","creator":"system","date_updated":"2020-07-14T12:46:55Z","file_name":"IST-2015-335-v1+1_report.pdf","file_id":"5517","access_level":"open_access","date_created":"2018-12-12T11:53:55Z","file_size":589619,"relation":"main_file"}],"month":"05","language":[{"iso":"eng"}],"pubrep_id":"335","oa_version":"Published Version","date_published":"2015-05-18T00:00:00Z","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"_id":"5439","year":"2015","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata. "}],"page":"20","title":"The target discounted-sum problem","author":[{"last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"date_updated":"2025-04-15T08:11:50Z","publication_status":"published","day":"18","fulldoi":"https://doi.org/10.15479/AT:IST-2015-335-v1-1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IST Austria","date_created":"2018-12-12T11:39:20Z","citation":{"short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>.","ieee":"U. Boker, T. A. Henzinger, and J. Otop, <i>The target discounted-sum problem</i>. IST Austria, 2015.","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","ama":"Boker U, Henzinger TA, Otop J. <i>The Target Discounted-Sum Problem</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>","mla":"Boker, Udi, et al. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>.","apa":"Boker, U., Henzinger, T. A., &#38; Otop, J. (2015). <i>The target discounted-sum problem</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>"},"file_date_updated":"2020-07-14T12:46:55Z","oa":1},{"date_created":"2018-12-12T12:31:29Z","publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"fulldoi":"https://doi.org/10.15479/AT:ISTA:28","publist_id":"5564","oa":1,"file_date_updated":"2020-07-14T12:47:00Z","citation":{"ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","mla":"Fellner, Andreas. <i>Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes</i>. Institute of Science and Technology Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>","short":"A. Fellner, (2015).","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>."},"license":"https://creativecommons.org/publicdomain/zero/1.0/","author":[{"last_name":"Fellner","full_name":"Fellner, Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","contributor":[{"last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication.","lang":"eng"}],"_id":"5549","year":"2015","article_processing_charge":"No","day":"13","ec_funded":1,"date_updated":"2025-09-23T08:23:15Z","month":"08","file":[{"date_updated":"2020-07-14T12:47:00Z","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","content_type":"application/zip","creator":"system","checksum":"b8bcb43c0893023cda66c1b69c16ac62","file_size":49557109,"relation":"main_file","access_level":"open_access","file_id":"5597","date_created":"2018-12-12T13:02:31Z"}],"ddc":["004"],"type":"research_data","date_published":"2015-08-13T00:00:00Z","oa_version":"Published Version","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"status":"public","has_accepted_license":"1","datarep_id":"28","related_material":{"record":[{"id":"1603","relation":"popular_science","status":"public"}]},"doi":"10.15479/AT:ISTA:28"},{"publication_identifier":{"isbn":["978-1-4503-3300-9"]},"year":"2015","_id":"1992","conference":{"location":"Mumbai, India","name":"POPL: Principles of Programming Languages","start_date":"2015-01-15","end_date":"2015-01-17"},"page":"433 - 444","abstract":[{"text":"We present a method and a tool for generating succinct representations of sets of concurrent traces. We focus on trace sets that contain all correct or all incorrect permutations of events from a given trace. We represent trace sets as HB-Formulas that are Boolean combinations of happens-before constraints between events. To generate a representation of incorrect interleavings, our method iteratively explores interleavings that violate the specification and gathers generalizations of the discovered interleavings into an HB-Formula; its complement yields a representation of correct interleavings.\r\n\r\nWe claim that our trace set representations can drive diverse verification, fault localization, repair, and synthesis techniques for concurrent programs. We demonstrate this by using our tool in three case studies involving synchronization synthesis, bug summarization, and abstraction refinement based verification. In each case study, our initial experimental results have been promising.\r\n\r\nIn the first case study, we present an algorithm for inferring missing synchronization from an HB-Formula representing correct interleavings of a given trace. The algorithm applies rules to rewrite specific patterns in the HB-Formula into locks, barriers, and wait-notify constructs. In the second case study, we use an HB-Formula representing incorrect interleavings for bug summarization. While the HB-Formula itself is a concise counterexample summary, we present additional inference rules to help identify specific concurrency bugs such as data races, define-use order violations, and two-stage access bugs. In the final case study, we present a novel predicate learning procedure that uses HB-Formulas representing abstract counterexamples to accelerate counterexample-guided abstraction refinement (CEGAR). In each iteration of the CEGAR loop, the procedure refines the abstraction to eliminate multiple spurious abstract counterexamples drawn from the HB-Formula.","lang":"eng"}],"author":[{"full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Samanta","full_name":"Samanta, Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha"},{"last_name":"Tarrach","full_name":"Tarrach, Thorsten","orcid":"0000-0003-4409-8487","first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87"}],"title":"Succinct representation of concurrent trace sets","date_updated":"2025-03-07T08:44:29Z","article_processing_charge":"No","day":"15","publication_status":"published","fulldoi":"https://doi.org/10.1145/2676726.2677008","publist_id":"5091","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:55:05Z","publisher":"ACM","file_date_updated":"2020-07-14T12:45:22Z","citation":{"ista":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. 2015. Succinct representation of concurrent trace sets. POPL: Principles of Programming Languages, 433–444.","apa":"Gupta, A., Henzinger, T. A., Radhakrishna, A., Samanta, R., &#38; Tarrach, T. (2015). Succinct representation of concurrent trace sets (pp. 433–444). Presented at the POPL: Principles of Programming Languages, Mumbai, India: ACM. <a href=\"https://doi.org/10.1145/2676726.2677008\">https://doi.org/10.1145/2676726.2677008</a>","ama":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. Succinct representation of concurrent trace sets. In: ACM; 2015:433-444. doi:<a href=\"https://doi.org/10.1145/2676726.2677008\">10.1145/2676726.2677008</a>","mla":"Gupta, Ashutosh, et al. <i>Succinct Representation of Concurrent Trace Sets</i>. ACM, 2015, pp. 433–44, doi:<a href=\"https://doi.org/10.1145/2676726.2677008\">10.1145/2676726.2677008</a>.","ieee":"A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,” 433–44. ACM, 2015. <a href=\"https://doi.org/10.1145/2676726.2677008\">https://doi.org/10.1145/2676726.2677008</a>.","short":"A. Gupta, T.A. Henzinger, A. Radhakrishna, R. Samanta, T. Tarrach, in:, ACM, 2015, pp. 433–444."},"oa":1,"status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"}],"doi":"10.1145/2676726.2677008","scopus_import":"1","file":[{"creator":"system","checksum":"f0d4395b600f410a191256ac0b73af32","content_type":"application/pdf","file_name":"IST-2015-317-v1+1_author_version.pdf","date_updated":"2020-07-14T12:45:22Z","date_created":"2018-12-12T10:17:56Z","access_level":"open_access","file_id":"5314","relation":"main_file","file_size":399462}],"ddc":["005"],"quality_controlled":"1","month":"01","language":[{"iso":"eng"}],"pubrep_id":"317","oa_version":"Submitted Version","date_published":"2015-01-15T00:00:00Z","type":"conference"},{"publisher":"Frontiers","date_created":"2022-02-25T11:42:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.3389/fenvs.2015.00042","acknowledgement":"The authors would like to acknowledge contributions from Baptiste Mottet who performed preliminary analysis regarding parameter inference for the considered case study in a student project (Mottet, 2014/2015).\r\nThe research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No. [291734] and from SystemsX under the project SignalX.","article_number":"42","oa":1,"citation":{"ista":"Parise F, Lygeros J, Ruess J. 2015. Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. Frontiers in Environmental Science. 3, 42.","apa":"Parise, F., Lygeros, J., &#38; Ruess, J. (2015). Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. <i>Frontiers in Environmental Science</i>. Frontiers. <a href=\"https://doi.org/10.3389/fenvs.2015.00042\">https://doi.org/10.3389/fenvs.2015.00042</a>","mla":"Parise, Francesca, et al. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.” <i>Frontiers in Environmental Science</i>, vol. 3, 42, Frontiers, 2015, doi:<a href=\"https://doi.org/10.3389/fenvs.2015.00042\">10.3389/fenvs.2015.00042</a>.","ama":"Parise F, Lygeros J, Ruess J. Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. <i>Frontiers in Environmental Science</i>. 2015;3. doi:<a href=\"https://doi.org/10.3389/fenvs.2015.00042\">10.3389/fenvs.2015.00042</a>","ieee":"F. Parise, J. Lygeros, and J. Ruess, “Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study,” <i>Frontiers in Environmental Science</i>, vol. 3. Frontiers, 2015.","chicago":"Parise, Francesca, John Lygeros, and Jakob Ruess. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.” <i>Frontiers in Environmental Science</i>. Frontiers, 2015. <a href=\"https://doi.org/10.3389/fenvs.2015.00042\">https://doi.org/10.3389/fenvs.2015.00042</a>.","short":"F. Parise, J. Lygeros, J. Ruess, Frontiers in Environmental Science 3 (2015)."},"file_date_updated":"2022-02-25T11:55:26Z","article_type":"original","license":"https://creativecommons.org/licenses/by/4.0/","title":"Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study","author":[{"full_name":"Parise, Francesca","last_name":"Parise","first_name":"Francesca"},{"last_name":"Lygeros","full_name":"Lygeros, John","first_name":"John"},{"orcid":"0000-0003-1615-3282","first_name":"Jakob","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","full_name":"Ruess, Jakob","last_name":"Ruess"}],"publication":"Frontiers in Environmental Science","abstract":[{"lang":"eng","text":"Mathematical models are of fundamental importance in the understanding of complex population dynamics. For instance, they can be used to predict the population evolution starting from different initial conditions or to test how a system responds to external perturbations. For this analysis to be meaningful in real applications, however, it is of paramount importance to choose an appropriate model structure and to infer the model parameters from measured data. While many parameter inference methods are available for models based on deterministic ordinary differential equations, the same does not hold for more detailed individual-based models. Here we consider, in particular, stochastic models in which the time evolution of the species abundances is described by a continuous-time Markov chain. These models are governed by a master equation that is typically difficult to solve. Consequently, traditional inference methods that rely on iterative evaluation of parameter likelihoods are computationally intractable. The aim of this paper is to present recent advances in parameter inference for continuous-time Markov chain models, based on a moment closure approximation of the parameter likelihood, and to investigate how these results can help in understanding, and ultimately controlling, complex systems in ecology. Specifically, we illustrate through an agricultural pest case study how parameters of a stochastic individual-based model can be identified from measured data and how the resulting model can be used to solve an optimal control problem in a stochastic setting. In particular, we show how the matter of determining the optimal combination of two different pest control methods can be formulated as a chance constrained optimization problem where the control action is modeled as a state reset, leading to a hybrid system formulation."}],"year":"2015","_id":"10794","publication_identifier":{"issn":["2296-665X"]},"publication_status":"published","day":"10","article_processing_charge":"No","ec_funded":1,"date_updated":"2025-04-15T06:50:01Z","month":"06","quality_controlled":"1","ddc":["000","570"],"file":[{"file_name":"2015_FrontiersEnvironmScience_Parise.pdf","date_updated":"2022-02-25T11:55:26Z","checksum":"26c222487564e1be02a11d688d6f769d","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_size":1371201,"date_created":"2022-02-25T11:55:26Z","success":1,"file_id":"10795","access_level":"open_access"}],"intvolume":"         3","date_published":"2015-06-10T00:00:00Z","type":"journal_article","oa_version":"Published Version","volume":3,"language":[{"iso":"eng"}],"keyword":["General Environmental Science"],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"department":[{"_id":"ToHe"},{"_id":"GaTk"}],"status":"public","has_accepted_license":"1","corr_author":"1","scopus_import":"1","doi":"10.3389/fenvs.2015.00042"},{"doi":"10.1007/978-3-319-21668-3_11","related_material":{"record":[{"status":"public","relation":"later_version","id":"1338"},{"id":"1130","relation":"dissertation_contains","status":"public"}]},"series_title":"Lecture Notes in Computer Science","scopus_import":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"OA_place":"repository","department":[{"_id":"ToHe"}],"status":"public","has_accepted_license":"1","pubrep_id":"336","volume":9207,"external_id":{"isi":["000491470400011"]},"language":[{"iso":"eng"}],"intvolume":"      9207","type":"conference","date_published":"2015-07-01T00:00:00Z","oa_version":"Submitted Version","quality_controlled":"1","OA_type":"green","ddc":["000"],"file":[{"date_created":"2018-12-12T10:08:53Z","file_id":"4715","access_level":"open_access","relation":"main_file","file_size":481922,"checksum":"6ff58ac220e2f20cb001ba35d4924495","creator":"system","content_type":"application/pdf","file_name":"IST-2015-336-v1+1_long_version.pdf","date_updated":"2025-06-26T07:12:35Z"}],"month":"07","date_updated":"2026-04-09T10:54:00Z","publication_status":"published","article_processing_charge":"No","day":"01","ec_funded":1,"conference":{"start_date":"2015-07-18","end_date":"2015-07-24","name":"CAV: Computer Aided Verification","location":"San Francisco, CA, United States"},"_id":"1729","year":"2015","alternative_title":["LNCS"],"author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"first_name":"Edmund","full_name":"Clarke, Edmund","last_name":"Clarke"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"},{"first_name":"Leonid","last_name":"Ryzhyk","full_name":"Ryzhyk, Leonid"},{"last_name":"Samanta","full_name":"Samanta, Roopsha","first_name":"Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","full_name":"Tarrach, Thorsten","last_name":"Tarrach"}],"title":"From non-preemptive to preemptive scheduling using synchronization synthesis","abstract":[{"text":"We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions.","lang":"eng"}],"page":"180 - 197","oa":1,"citation":{"short":"P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197.","chicago":"Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">https://doi.org/10.1007/978-3-319-21668-3_11</a>.","ieee":"P. Cerny <i>et al.</i>, “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.","ista":"Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197.","mla":"Cerny, Pavol, et al. <i>From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis</i>. Vol. 9207, Springer, 2015, pp. 180–97, doi:<a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">10.1007/978-3-319-21668-3_11</a>.","apa":"Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &#38; Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">https://doi.org/10.1007/978-3-319-21668-3_11</a>","ama":"Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling using synchronization synthesis. 2015;9207:180-197. doi:<a href=\"https://doi.org/10.1007/978-3-319-21668-3_11\">10.1007/978-3-319-21668-3_11</a>"},"file_date_updated":"2025-06-26T07:12:35Z","publist_id":"5398","fulldoi":"https://doi.org/10.1007/978-3-319-21668-3_11","publisher":"Springer","isi":1,"date_created":"2018-12-11T11:53:42Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"oa":1,"citation":{"ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” <i>Information and Computation</i>, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. <i>Information and Computation</i>. 2015;245(12):3-16. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>","mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” <i>Information and Computation</i>, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2015). Randomness for free. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>."},"issue":"12","isi":1,"publisher":"Elsevier","date_created":"2018-12-11T11:53:42Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"5395","fulldoi":"https://doi.org/10.1016/j.ic.2015.06.003","publication_status":"published","article_processing_charge":"No","day":"01","ec_funded":1,"date_updated":"2025-09-23T10:32:00Z","arxiv":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"title":"Randomness for free","publication":"Information and Computation","abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. "}],"page":"3 - 16","year":"2015","_id":"1731","intvolume":"       245","date_published":"2015-12-01T00:00:00Z","type":"journal_article","oa_version":"Preprint","external_id":{"isi":["000368899100002"],"arxiv":["1006.0673"]},"volume":245,"language":[{"iso":"eng"}],"month":"12","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.0673"}],"quality_controlled":"1","scopus_import":"1","doi":"10.1016/j.ic.2015.06.003","related_material":{"record":[{"status":"public","id":"3856","relation":"earlier_version"}]},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","corr_author":"1"},{"department":[{"_id":"ToHe"}],"status":"public","scopus_import":"1","doi":"10.1145/2745799","month":"05","quality_controlled":"1","type":"journal_article","date_published":"2015-05-01T00:00:00Z","intvolume":"        25","oa_version":"None","language":[{"iso":"eng"}],"volume":25,"external_id":{"isi":["000354789200001"]},"title":"Guest editors' introduction to special issue on computational methods in systems biology","author":[{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"publication":"ACM Transactions on Modeling and Computer Simulation","_id":"1808","year":"2015","day":"01","article_processing_charge":"No","publication_status":"published","date_updated":"2025-09-23T09:11:51Z","date_created":"2018-12-11T11:54:07Z","publisher":"ACM","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1145/2745799","publist_id":"5302","article_number":"7","citation":{"ista":"Gupta A, Henzinger TA. 2015. Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. 25(2), 7.","apa":"Gupta, A., &#38; Henzinger, T. A. (2015). Guest editors’ introduction to special issue on computational methods in systems biology. <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM. <a href=\"https://doi.org/10.1145/2745799\">https://doi.org/10.1145/2745799</a>","mla":"Gupta, Ashutosh, and Thomas A. Henzinger. “Guest Editors’ Introduction to Special Issue on Computational Methods in Systems Biology.” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2, 7, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2745799\">10.1145/2745799</a>.","ama":"Gupta A, Henzinger TA. Guest editors’ introduction to special issue on computational methods in systems biology. <i>ACM Transactions on Modeling and Computer Simulation</i>. 2015;25(2). doi:<a href=\"https://doi.org/10.1145/2745799\">10.1145/2745799</a>","ieee":"A. Gupta and T. A. Henzinger, “Guest editors’ introduction to special issue on computational methods in systems biology,” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2. ACM, 2015.","chicago":"Gupta, Ashutosh, and Thomas A Henzinger. “Guest Editors’ Introduction to Special Issue on Computational Methods in Systems Biology.” <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2745799\">https://doi.org/10.1145/2745799</a>.","short":"A. Gupta, T.A. Henzinger, ACM Transactions on Modeling and Computer Simulation 25 (2015)."},"issue":"2"},{"oa_version":"Preprint","intvolume":"      9035","date_published":"2015-04-01T00:00:00Z","type":"conference","volume":9035,"external_id":{"arxiv":["1410.7704"]},"language":[{"iso":"eng"}],"month":"04","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1410.7704","open_access":"1"}],"series_title":"Lecture Notes in Computer Science","scopus_import":"1","doi":"10.1007/978-3-662-46681-0_47","related_material":{"record":[{"relation":"later_version","id":"1351","status":"public"}]},"status":"public","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"department":[{"_id":"ToHe"},{"_id":"CaGu"},{"_id":"NiBa"}],"citation":{"chicago":"Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">https://doi.org/10.1007/978-3-662-46681-0_47</a>.","short":"M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035 (2015) 469–483.","mla":"Giacobbe, Mirco, et al. <i>Model Checking Gene Regulatory Networks</i>. Vol. 9035, Springer, 2015, pp. 469–83, doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">10.1007/978-3-662-46681-0_47</a>.","apa":"Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &#38; Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">https://doi.org/10.1007/978-3-662-46681-0_47</a>","ama":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking gene regulatory networks. 2015;9035:469-483. doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_47\">10.1007/978-3-662-46681-0_47</a>","ista":"Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model checking gene regulatory networks. 9035, 469–483.","ieee":"M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","date_created":"2018-12-11T11:54:16Z","acknowledgement":"SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2 148797.\r\n","fulldoi":"https://doi.org/10.1007/978-3-662-46681-0_47","publist_id":"5267","ec_funded":1,"publication_status":"published","article_processing_charge":"No","day":"01","date_updated":"2025-07-10T11:50:42Z","arxiv":1,"abstract":[{"text":"The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs –an important problem of interest in evolutionary biology– more efficiently than the classical simulation method. We specify the property in linear temporal logics. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.","lang":"eng"}],"page":"469 - 483","title":"Model checking gene regulatory networks","author":[{"orcid":"0000-0001-8180-0904","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","last_name":"Giacobbe"},{"last_name":"Guet","full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Paixao, Tiago","last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago","orcid":"0000-0003-2361-3953"},{"last_name":"Petrov","full_name":"Petrov, Tatjana","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905"}],"year":"2015","_id":"1835","conference":{"end_date":"2015-04-18","start_date":"2015-04-11","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"London, United Kingdom"},"alternative_title":["LNCS"]},{"date_updated":"2025-09-23T10:42:04Z","ec_funded":1,"article_processing_charge":"No","day":"01","publication_status":"published","alternative_title":["LNCS"],"year":"2015","_id":"1836","conference":{"start_date":"2015-04-11","end_date":"2015-04-18","name":"ESOP: European Symposium on Programming","location":"London, United Kingdom"},"page":"105 - 131","abstract":[{"text":"In the standard framework for worst-case execution time (WCET) analysis of programs, the main data structure is a single instance of integer linear programming (ILP) that represents the whole program. The instance of this NP-hard problem must be solved to find an estimate forWCET, and it must be refined if the estimate is not tight.We propose a new framework for WCET analysis, based on abstract segment trees (ASTs) as the main data structure. The ASTs have two advantages. First, they allow computing WCET by solving a number of independent small ILP instances. Second, ASTs store more expressive constraints, thus enabling a more efficient and precise refinement procedure. In order to realize our framework algorithmically, we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework to obtain parametric estimates of WCET. We experimentally evaluate our approach on a set of examples from WCET benchmark suites and linear-algebra packages. We show that our analysis, with comparable effort, provides WCET estimates that in many cases significantly improve those computed by existing tools.","lang":"eng"}],"title":"Segment abstraction for worst-case execution time analysis","author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Laura","last_name":"Kovács","full_name":"Kovács, Laura"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"first_name":"Jakob","full_name":"Zwirchmayr, Jakob","last_name":"Zwirchmayr"}],"citation":{"short":"P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032 (2015) 105–131.","chicago":"Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">https://doi.org/10.1007/978-3-662-46669-8_5</a>.","ieee":"P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.","ista":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment abstraction for worst-case execution time analysis. 9032, 105–131.","apa":"Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., &#38; Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">https://doi.org/10.1007/978-3-662-46669-8_5</a>","ama":"Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction for worst-case execution time analysis. 2015;9032:105-131. doi:<a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">10.1007/978-3-662-46669-8_5</a>","mla":"Cerny, Pavol, et al. <i>Segment Abstraction for Worst-Case Execution Time Analysis</i>. Vol. 9032, Springer, 2015, pp. 105–31, doi:<a href=\"https://doi.org/10.1007/978-3-662-46669-8_5\">10.1007/978-3-662-46669-8_5</a>."},"publist_id":"5266","fulldoi":"https://doi.org/10.1007/978-3-662-46669-8_5","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:54:16Z","publisher":"Springer","isi":1,"doi":"10.1007/978-3-662-46669-8_5","scopus_import":"1","series_title":"Lecture Notes in Computer Science","status":"public","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000361751400005"]},"volume":9032,"oa_version":"None","type":"conference","date_published":"2015-04-01T00:00:00Z","intvolume":"      9032","quality_controlled":"1","month":"04"},{"title":"Optimal Kullback-Leibler aggregation via information bottleneck","author":[{"full_name":"Geiger, Bernhard","last_name":"Geiger","first_name":"Bernhard"},{"first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905","last_name":"Petrov","full_name":"Petrov, Tatjana"},{"first_name":"Gernot","full_name":"Kubin, Gernot","last_name":"Kubin"},{"first_name":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"}],"publication":"IEEE Transactions on Automatic Control","page":"1010 - 1022","abstract":[{"lang":"eng","text":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions."}],"_id":"1840","year":"2015","publication_identifier":{"issn":["0018-9286"]},"article_processing_charge":"No","day":"01","publication_status":"published","date_updated":"2025-09-23T09:45:33Z","arxiv":1,"date_created":"2018-12-11T11:54:18Z","isi":1,"publisher":"IEEE","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1109/TAC.2014.2364971","publist_id":"5262","acknowledgement":"This work was supported by the Austrian Research Association under Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2 128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n","oa":1,"citation":{"short":"B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic Control 60 (2015) 1010–1022.","chicago":"Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>.","ieee":"B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.","mla":"Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>.","ama":"Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. 2015;60(4):1010-1022. doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>","apa":"Geiger, B., Petrov, T., Kubin, G., &#38; Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. IEEE. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>","ista":"Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022."},"issue":"4","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"status":"public","scopus_import":"1","doi":"10.1109/TAC.2014.2364971","month":"04","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.6603"}],"type":"journal_article","date_published":"2015-04-01T00:00:00Z","intvolume":"        60","oa_version":"Preprint","language":[{"iso":"eng"}],"volume":60,"external_id":{"arxiv":["1304.6603"],"isi":["000351731600009"]}},{"oa":1,"article_number":"20","file_date_updated":"2020-07-14T12:45:17Z","das_tickbox":"1","citation":{"short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015).","chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2015. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>.","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1. International Federation for Computational Logic, 2015.","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1, 20, International Federation for Computational Logic, 2015, doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. 2015;11(1). doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20."},"article_type":"original","issue":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_created":"2018-12-11T11:54:15Z","isi":1,"publisher":"International Federation for Computational Logic","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"publist_id":"5271","fulldoi":"https://doi.org/10.2168/LMCS-11(1:20)2015","article_processing_charge":"No","day":"01","publication_status":"published","ec_funded":1,"date_updated":"2026-07-06T13:24:05Z","publication":"Logical Methods in Computer Science","author":[{"full_name":"Chakraborty, Soham","last_name":"Chakraborty","first_name":"Soham"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","first_name":"Ali"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"title":"Aspect-oriented linearizability proofs","abstract":[{"text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. ","lang":"eng"}],"year":"2015","_id":"1832","date_published":"2015-04-01T00:00:00Z","type":"journal_article","intvolume":"        11","oa_version":"Published Version","pubrep_id":"390","language":[{"iso":"eng"}],"volume":11,"external_id":{"isi":["000353193000019"]},"month":"04","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:45:17Z","file_name":"IST-2015-390-v1+1_1502.07639.pdf","content_type":"application/pdf","checksum":"7370e164d0a731f442424a92669efc34","creator":"system","file_size":380203,"relation":"main_file","file_id":"4881","access_level":"open_access","date_created":"2018-12-12T10:11:27Z"}],"ddc":["000"],"scopus_import":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2328"}]},"doi":"10.2168/LMCS-11(1:20)2015","department":[{"_id":"ToHe"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"has_accepted_license":"1","status":"public","corr_author":"1"},{"conference":{"name":"ICALP: Automata, Languages and Programming","location":"Kyoto, Japan","start_date":"2015-07-06","end_date":"2015-07-10"},"_id":"1610","year":"2015","alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-3-662-47665-9"]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"title":"Edit distance for pushdown automata","publication":"42nd International Colloquium on Automata, Languages, and Programming","abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k.","lang":"eng"}],"page":"121 - 133","arxiv":1,"date_updated":"2026-07-06T13:27:53Z","publication_status":"published","day":"01","article_processing_charge":"No","ec_funded":1,"publist_id":"5556","fulldoi":"https://doi.org/10.1007/978-3-662-47666-6_10","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects\r\nS11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-\r\nN23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph\r\nGames), and MSR faculty fellows award.","isi":1,"publisher":"Springer Nature","date_created":"2018-12-11T11:53:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"Part II","oa":1,"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in <i>42nd International Colloquium on Automata, Languages, and Programming</i>, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: <i>42nd International Colloquium on Automata, Languages, and Programming</i>. Vol 9135. Springer Nature; 2015:121-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2015). Edit distance for pushdown automata. In <i>42nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>42nd International Colloquium on Automata, Languages, and Programming</i>, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In <i>42nd International Colloquium on Automata, Languages, and Programming</i>, 9135:121–33. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp. 121–133."},"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"OA_place":"repository","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","doi":"10.1007/978-3-662-47666-6_10","related_material":{"record":[{"id":"5438","relation":"earlier_version","status":"public"},{"status":"public","id":"465","relation":"later_version"}]},"scopus_import":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.08259"}],"OA_type":"green","month":"07","pubrep_id":"321","volume":9135,"external_id":{"arxiv":["1504.08259"],"isi":["000364317900010"]},"language":[{"iso":"eng"}],"intvolume":"      9135","date_published":"2015-07-01T00:00:00Z","type":"conference","oa_version":"Preprint"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:18Z","publisher":"IEEE","isi":1,"fulldoi":"https://doi.org/10.1109/LICS.2015.32","acknowledgement":"A Technical Report of this paper is available at DOI: 10.15479/AT:IST-2015-318-v1-1\r\n","publist_id":"5493","citation":{"short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.","chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>.","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>","apa":"Chatterjee, K., Komárková, Z., &#38; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IEEE, 2015, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>.","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015."},"oa":1,"page":"244 - 256","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Zuzana","last_name":"Komárková","full_name":"Komárková, Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","alternative_title":["LICS"],"_id":"1657","year":"2015","conference":{"end_date":"2015-07-10","start_date":"2015-07-06","name":"LICS: Logic in Computer Science","location":"Kyoto, Japan"},"ec_funded":1,"day":"01","article_processing_charge":"No","publication_status":"published","date_updated":"2026-07-06T13:26:26Z","month":"07","OA_type":"green","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2015-318-v1-1","open_access":"1"}],"oa_version":"Preprint","type":"conference","date_published":"2015-07-01T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"isi":["000380427100024"]},"status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"OA_place":"repository","scopus_import":"1","series_title":"LICS","related_material":{"record":[{"relation":"earlier_version","id":"5429","status":"public"},{"status":"public","relation":"earlier_version","id":"5435"},{"status":"public","relation":"later_version","id":"466"}]},"doi":"10.1109/LICS.2015.32"}]