[{"ddc":["000"],"date_published":"2014-01-01T00:00:00Z","has_accepted_license":"1","citation":{"ama":"Gupta A, Kovács L, Kragl B, Voronkov A. Extensional crisis and proving identity. In: Cassez F, Raskin J-F, eds. <i>ATVA 2014</i>. Vol 8837. Springer; 2014:185-200. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">10.1007/978-3-319-11936-6_14</a>","ista":"Gupta A, Kovács L, Kragl B, Voronkov A. 2014. Extensional crisis and proving identity. ATVA 2014. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 185–200.","ieee":"A. Gupta, L. Kovács, B. Kragl, and A. Voronkov, “Extensional crisis and proving identity,” in <i>ATVA 2014</i>, Sydney, Australia, 2014, vol. 8837, pp. 185–200.","chicago":"Gupta, Ashutosh, Laura Kovács, Bernhard Kragl, and Andrei Voronkov. “Extensional Crisis and Proving Identity.” In <i>ATVA 2014</i>, edited by Franck Cassez and Jean-François Raskin, 8837:185–200. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">https://doi.org/10.1007/978-3-319-11936-6_14</a>.","short":"A. Gupta, L. Kovács, B. Kragl, A. Voronkov, in:, F. Cassez, J.-F. Raskin (Eds.), ATVA 2014, Springer, 2014, pp. 185–200.","mla":"Gupta, Ashutosh, et al. “Extensional Crisis and Proving Identity.” <i>ATVA 2014</i>, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 185–200, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">10.1007/978-3-319-11936-6_14</a>.","apa":"Gupta, A., Kovács, L., Kragl, B., &#38; Voronkov, A. (2014). Extensional crisis and proving identity. In F. Cassez &#38; J.-F. Raskin (Eds.), <i>ATVA 2014</i> (Vol. 8837, pp. 185–200). Sydney, Australia: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">https://doi.org/10.1007/978-3-319-11936-6_14</a>"},"date_created":"2018-12-11T11:54:28Z","intvolume":"      8837","editor":[{"full_name":"Cassez, Franck","first_name":"Franck","last_name":"Cassez"},{"full_name":"Raskin, Jean-François","first_name":"Jean-François","last_name":"Raskin"}],"ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"5226","quality_controlled":"1","publication":"ATVA 2014","year":"2014","month":"01","author":[{"full_name":"Gupta, Ashutosh","first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","last_name":"Kragl","full_name":"Kragl, Bernhard","first_name":"Bernhard"},{"last_name":"Voronkov","first_name":"Andrei","full_name":"Voronkov, Andrei"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","pubrep_id":"641","day":"01","oa_version":"Submitted Version","file":[{"file_size":244294,"content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:10:15Z","date_updated":"2020-07-14T12:45:19Z","file_name":"IST-2016-641-v1+1_atva2014.pdf","file_id":"4801","checksum":"af4bd3fc1f4c93075e4dc5cbf625fe7b","creator":"system","relation":"main_file"}],"department":[{"_id":"ToHe"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"oa":1,"date_updated":"2021-01-12T06:53:45Z","volume":8837,"publication_status":"published","file_date_updated":"2020-07-14T12:45:19Z","type":"conference","acknowledgement":"This research was supported in part by the Austrian National Research Network RiSE (S11410-N23).","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-11936-6_14","abstract":[{"text":"Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics. An extensionality axiom asserts that two collections are equal if they consist of the same elements at the same indices. Using extensionality is often required to show that two collections are equal. A typical example is the set theory theorem (∀x)(∀y)x∪y = y ∪x. Interestingly, while humans have no problem with proving such set identities using extensionality, they are very hard for superposition theorem provers because of the calculi they use. In this paper we show how addition of a new inference rule, called extensionality resolution, allows first-order theorem provers to easily solve problems no modern first-order theorem prover can solve. We illustrate this by running the VAMPIRE theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps VAMPIRE to solve problems from the TPTP library of first-order problems that were never solved before by any prover.","lang":"eng"}],"status":"public","title":"Extensional crisis and proving identity","scopus_import":1,"_id":"1872","page":"185 - 200","publisher":"Springer","conference":{"location":"Sydney, Australia","name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2014-11-03","end_date":"2014-11-07"}},{"status":"public","conference":{"start_date":"2014-11-03","end_date":"2014-11-07","name":"ATVA: Automated Technology for Verification and Analysis","location":"Sydney, Australia"},"publisher":"Springer","page":"235 - 241","_id":"2026","title":"Rabinizer 3: Safraless translation of ltl to small deterministic automata","scopus_import":"1","publication_status":"published","volume":8837,"date_updated":"2024-10-21T06:02:50Z","acknowledgement":"Sponsor: P202/12/G061; GACR; Czech Science Foundation\r\n\r\n","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We present a tool for translating LTL formulae into deterministic ω-automata. It is the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants. This leads to smaller automata. There are several outputs of the tool: firstly, deterministic Rabin automata, which are the standard input for probabilistic model checking, e.g. for the probabilistic model-checker PRISM; secondly, deterministic generalized Rabin automata, which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to PRISM and show that this leads to a significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata."}],"doi":"10.1007/978-3-319-11936-6_17","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Zuzana","full_name":"Komárková, Zuzana","last_name":"Komárková"},{"first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"month":"01","day":"01","oa_version":"None","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"ToHe"}],"intvolume":"      8837","date_created":"2018-12-11T11:55:17Z","citation":{"ama":"Komárková Z, Kretinsky J. Rabinizer 3: Safraless translation of ltl to small deterministic automata. In: Cassez F, Raskin J-F, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8837. Springer; 2014:235-241. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">10.1007/978-3-319-11936-6_17</a>","ista":"Komárková Z, Kretinsky J. 2014. Rabinizer 3: Safraless translation of ltl to small deterministic automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 235–241.","ieee":"Z. Komárková and J. Kretinsky, “Rabinizer 3: Safraless translation of ltl to small deterministic automata,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Sydney, Australia, 2014, vol. 8837, pp. 235–241.","chicago":"Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, 8837:235–41. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">https://doi.org/10.1007/978-3-319-11936-6_17</a>.","short":"Z. Komárková, J. Kretinsky, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 235–241.","mla":"Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 235–41, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">10.1007/978-3-319-11936-6_17</a>.","apa":"Komárková, Z., &#38; Kretinsky, J. (2014). Rabinizer 3: Safraless translation of ltl to small deterministic automata. In F. Cassez &#38; J.-F. Raskin (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8837, pp. 235–241). Sydney, Australia: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_17\">https://doi.org/10.1007/978-3-319-11936-6_17</a>"},"date_published":"2014-01-01T00:00:00Z","editor":[{"full_name":"Cassez, Franck","first_name":"Franck","last_name":"Cassez"},{"last_name":"Raskin","first_name":"Jean-François","full_name":"Raskin, Jean-François"}],"quality_controlled":"1","publist_id":"5045","language":[{"iso":"eng"}],"ec_funded":1,"year":"2014","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"full_name":"Kretinsky, Jan","first_name":"Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kwiatkowska","first_name":"Marta","full_name":"Kwiatkowska, Marta"},{"last_name":"Parker","first_name":"David","full_name":"Parker, David"},{"last_name":"Ujma","full_name":"Ujma, Mateusz","first_name":"Mateusz"}],"month":"11","oa":1,"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Light-regulated ligand traps for spatio-temporal inhibition of cell signaling","grant_number":"24696","_id":"26241A12-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","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":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Submitted Version","external_id":{"arxiv":["1402.2967"]},"arxiv":1,"editor":[{"full_name":"Cassez, Franck","first_name":"Franck","last_name":"Cassez"},{"full_name":"Raskin, Jean-François","first_name":"Jean-François","last_name":"Raskin"}],"intvolume":"      8837","date_created":"2018-12-11T11:55:17Z","citation":{"ieee":"T. Brázdil <i>et al.</i>, “Verification of markov decision processes using learning algorithms,” in <i> Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Sydney, Australia, 2014, vol. 8837, pp. 98–114.","ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Verification of markov decision processes using learning algorithms. In: Cassez F, Raskin J-F, eds. <i> Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8837. Springer; 2014:98-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">10.1007/978-3-319-11936-6_8</a>","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &#38; J.-F. Raskin (Eds.), <i> Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8837, pp. 98–114). Sydney, Australia: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">https://doi.org/10.1007/978-3-319-11936-6_8</a>","mla":"Brázdil, Tomáš, et al. “Verification of Markov Decision Processes Using Learning Algorithms.” <i> Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 98–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">10.1007/978-3-319-11936-6_8</a>.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.),  Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 98–114.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In <i> Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">https://doi.org/10.1007/978-3-319-11936-6_8</a>."},"date_published":"2014-11-01T00:00:00Z","year":"2014","publication":" Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","publist_id":"5046","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"status":"public","publisher":"Springer","conference":{"start_date":"2014-11-03","end_date":"2014-11-07","location":"Sydney, Australia","name":"ALENEX: Algorithm Engineering and Experiments"},"page":"98 - 114","_id":"2027","title":"Verification of markov decision processes using learning algorithms","scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.2967"}],"alternative_title":["LNCS"],"acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 246967 (VERIWARE), by the EU FP7 project HIERATIC, by the Czech Science Foundation grant No P202/12/P612, by EPSRC project EP/K038575/1.","type":"conference","publication_status":"published","volume":8837,"date_updated":"2025-06-11T08:02:50Z","abstract":[{"text":"We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties inMDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples.","lang":"eng"}],"doi":"10.1007/978-3-319-11936-6_8"},{"abstract":[{"lang":"eng","text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with &quot;controlled accumulation,&quot; allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable."}],"doi":"10.1145/2629686","publication_status":"published","volume":15,"date_updated":"2025-09-30T09:27:29Z","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","type":"journal_article","file_date_updated":"2020-07-14T12:45:26Z","publisher":"ACM","_id":"2038","title":"Temporal specifications with accumulative values","scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","id":"5385","status":"public"},{"id":"3356","relation":"earlier_version","status":"public"}]},"status":"public","publist_id":"5013","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"year":"2014","publication":"ACM Transactions on Computational Logic (TOCL)","intvolume":"        15","article_type":"original","has_accepted_license":"1","date_created":"2018-12-11T11:55:21Z","citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2014;15(4). doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4. ACM, 2014.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2014). Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 15, no. 4, 27, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>."},"ddc":["000","004"],"date_published":"2014-09-16T00:00:00Z","external_id":{"isi":["000345570700002"]},"oa_version":"Submitted Version","article_number":"27","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file":[{"relation":"main_file","checksum":"354c41d37500b56320afce94cf9a99c2","creator":"system","file_id":"4851","date_created":"2018-12-12T10:10:59Z","file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","date_updated":"2020-07-14T12:45:26Z","content_type":"application/pdf","access_level":"open_access","file_size":346184}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"month":"09","issue":"4","pubrep_id":"192","article_processing_charge":"No","day":"16","isi":1},{"year":"2014","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","publist_id":"4993","language":[{"iso":"eng"}],"ec_funded":1,"external_id":{"arxiv":["1404.5084"]},"arxiv":1,"editor":[{"first_name":"Paolo","full_name":"Baldan, Paolo","last_name":"Baldan"},{"last_name":"Gorla","first_name":"Daniele","full_name":"Gorla, Daniele"}],"intvolume":"      8704","citation":{"apa":"Hermanns, H., Krčál, J., &#38; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>","mla":"Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>.","short":"H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.","chicago":"Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">https://doi.org/10.1007/978-3-662-44584-6_18</a>.","ieee":"H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 249–265.","ista":"Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.","ama":"Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on distributions. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:249-265. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_18\">10.1007/978-3-662-44584-6_18</a>"},"date_created":"2018-12-11T11:55:27Z","date_published":"2014-09-01T00:00:00Z","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"oa":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa_version":"Submitted Version","day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hermanns, Holger","first_name":"Holger","last_name":"Hermanns"},{"first_name":"Jan","full_name":"Krčál, Jan","last_name":"Krčál"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","first_name":"Jan"}],"month":"09","abstract":[{"lang":"eng","text":"In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition refines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems."}],"doi":"10.1007/978-3-662-44584-6_18","acknowledgement":"This work is supported by the EU 7th Framework Programme under grant agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative Research Teams.","alternative_title":["LNCS"],"type":"conference","publication_status":"published","volume":8704,"date_updated":"2025-06-11T07:57:15Z","conference":{"location":"Rome, Italy","name":"CONCUR: Concurrency Theory","end_date":"2014-09-05","start_date":"2014-09-02"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"249 - 265","_id":"2053","title":"Probabilistic bisimulation: Naturally on distributions","scopus_import":"1","main_file_link":[{"url":"http://arxiv.org/abs/1404.5084","open_access":"1"}],"status":"public"},{"year":"2014","publication":"Journal of Mathematical Biology","publist_id":"4990","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000340588700008"],"arxiv":["1303.4532"]},"arxiv":1,"intvolume":"        69","date_created":"2018-12-11T11:55:28Z","citation":{"ieee":"A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications to combinatorial reaction networks,” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3. Springer, pp. 767–797, 2014.","ista":"Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797.","ama":"Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. 2014;69(3):767-797. doi:<a href=\"https://doi.org/10.1007/s00285-013-0738-7\">10.1007/s00285-013-0738-7</a>","apa":"Ganguly, A., Petrov, T., &#38; Koeppl, H. (2014). Markov chain aggregation and its applications to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s00285-013-0738-7\">https://doi.org/10.1007/s00285-013-0738-7</a>","mla":"Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3, Springer, 2014, pp. 767–97, doi:<a href=\"https://doi.org/10.1007/s00285-013-0738-7\">10.1007/s00285-013-0738-7</a>.","short":"A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014) 767–797.","chicago":"Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical Biology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00285-013-0738-7\">https://doi.org/10.1007/s00285-013-0738-7</a>."},"date_published":"2014-11-20T00:00:00Z","oa":1,"department":[{"_id":"CaGu"},{"_id":"ToHe"}],"oa_version":"Submitted Version","issue":"3","day":"20","article_processing_charge":"No","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Ganguly","first_name":"Arnab","full_name":"Ganguly, Arnab"},{"first_name":"Tatjana","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905","last_name":"Petrov"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"}],"month":"11","abstract":[{"text":"We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is devoted to illustrate how the developed theory aids in reducing CTMC models of biochemical systems particularly in connection to protein-protein interactions. We assume that the model is written by a biologist in form of site-graph-rewrite rules. Site-graph-rewrite rules compactly express that, often, only a local context of a protein (instead of a full molecular species) needs to be in a certain configuration in order to trigger a reaction event. This observation leads to suitable aggregate Markov chains with smaller state spaces, thereby providing sufficient reduction in computational complexity. This is further exemplified in two case studies: simple unbounded polymerization and early EGFR/insulin crosstalk.","lang":"eng"}],"doi":"10.1007/s00285-013-0738-7","acknowledgement":"T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems Biology.","type":"journal_article","publication_status":"published","volume":69,"date_updated":"2025-09-29T11:50:22Z","publisher":"Springer","page":"767 - 797","_id":"2056","title":"Markov chain aggregation and its applications to combinatorial reaction networks","scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.4532"}],"status":"public"},{"publication_status":"published","corr_author":"1","volume":8559,"date_updated":"2025-04-15T08:12:07Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems.We focus on qualitative properties forMDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation ofMDPs with respect to qualitative properties, and present discrete graph theoretic algorithms with quadratic complexity to compute the simulation relation.We present an automated technique for assume-guarantee style reasoning for compositional analysis ofMDPs with qualitative properties by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We have implemented our algorithms and show that the compositional analysis leads to significant improvements."}],"doi":"10.1007/978-3-319-08867-9_31","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5412"},{"status":"public","relation":"earlier_version","id":"5413"},{"relation":"earlier_version","id":"5414","status":"public"},{"id":"1155","relation":"dissertation_contains","status":"public"}]},"status":"public","conference":{"start_date":"2014-07-18","end_date":"2014-07-22","name":"CAV: Computer Aided Verification","location":"Vienna, Austria"},"publisher":"Springer","_id":"2063","page":"473 - 490","title":"CEGAR for qualitative analysis of probabilistic systems","scopus_import":"1","intvolume":"      8559","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic Systems</i>. Vol. 8559, Springer, 2014, pp. 473–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,” 8559:473–90. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">https://doi.org/10.1007/978-3-319-08867-9_31</a>.","short":"K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for qualitative analysis of probabilistic systems. In: Vol 8559. Springer; 2014:473-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_31\">10.1007/978-3-319-08867-9_31</a>","ista":"Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490."},"date_created":"2018-12-11T11:55:30Z","date_published":"2014-07-01T00:00:00Z","quality_controlled":"1","publist_id":"4978","language":[{"iso":"eng"}],"ec_funded":1,"year":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin"},{"full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87"}],"month":"07","day":"01","oa_version":"None","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"type":"conference","alternative_title":["LNCS"],"file_date_updated":"2020-07-14T12:45:19Z","publication_status":"published","date_updated":"2021-01-12T06:53:46Z","volume":8723,"abstract":[{"text":"We present a formal framework for repairing infinite-state, imperative, sequential programs, with (possibly recursive) procedures and multiple assertions; the framework can generate repaired programs by modifying the original erroneous program in multiple program locations, and can ensure the readability of the repaired program using user-defined expression templates; the framework also generates a set of inductive assertions that serve as a proof of correctness of the repaired program. As a step toward integrating programmer intent and intuition in automated program repair, we present a cost-aware formulation - given a cost function associated with permissible statement modifications, the goal is to ensure that the total program modification cost does not exceed a given repair budget. As part of our predicate abstractionbased solution framework, we present a sound and complete algorithm for repair of Boolean programs. We have developed a prototype tool based on SMT solving and used it successfully to repair diverse errors in benchmark C programs.","lang":"eng"}],"doi":"10.1007/978-3-319-10936-7_17","status":"public","_id":"1875","page":"268 - 284","conference":{"location":"Munich, Germany","name":"SAS: Static Analysis Symposium","end_date":"2014-09-14","start_date":"2014-09-11"},"publisher":"Springer","scopus_import":1,"title":"Cost-aware automatic program repair","editor":[{"full_name":"Müller-Olm, Markus","first_name":"Markus","last_name":"Müller-Olm"},{"full_name":"Seidl, Helmut","first_name":"Helmut","last_name":"Seidl"}],"intvolume":"      8723","date_published":"2014-09-01T00:00:00Z","ddc":["000","005"],"date_created":"2018-12-11T11:54:29Z","citation":{"ama":"Samanta R, Olivo O, Allen E. Cost-aware automatic program repair. In: Müller-Olm M, Seidl H, eds. Vol 8723. Springer; 2014:268-284. doi:<a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">10.1007/978-3-319-10936-7_17</a>","ista":"Samanta R, Olivo O, Allen E. 2014. Cost-aware automatic program repair. SAS: Static Analysis Symposium, LNCS, vol. 8723, 268–284.","ieee":"R. Samanta, O. Olivo, and E. Allen, “Cost-aware automatic program repair,” presented at the SAS: Static Analysis Symposium, Munich, Germany, 2014, vol. 8723, pp. 268–284.","chicago":"Samanta, Roopsha, Oswaldo Olivo, and Emerson Allen. “Cost-Aware Automatic Program Repair.” edited by Markus Müller-Olm and Helmut Seidl, 8723:268–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">https://doi.org/10.1007/978-3-319-10936-7_17</a>.","short":"R. Samanta, O. Olivo, E. Allen, in:, M. Müller-Olm, H. Seidl (Eds.), Springer, 2014, pp. 268–284.","mla":"Samanta, Roopsha, et al. <i>Cost-Aware Automatic Program Repair</i>. Edited by Markus Müller-Olm and Helmut Seidl, vol. 8723, Springer, 2014, pp. 268–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">10.1007/978-3-319-10936-7_17</a>.","apa":"Samanta, R., Olivo, O., &#38; Allen, E. (2014). Cost-aware automatic program repair. In M. Müller-Olm &#38; H. Seidl (Eds.) (Vol. 8723, pp. 268–284). Presented at the SAS: Static Analysis Symposium, Munich, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10936-7_17\">https://doi.org/10.1007/978-3-319-10936-7_17</a>"},"has_accepted_license":"1","year":"2014","language":[{"iso":"eng"}],"quality_controlled":"1","publist_id":"5221","pubrep_id":"313","day":"01","author":[{"first_name":"Roopsha","full_name":"Samanta, Roopsha","last_name":"Samanta","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Olivo","full_name":"Olivo, Oswaldo","first_name":"Oswaldo"},{"full_name":"Allen, Emerson","first_name":"Emerson","last_name":"Allen"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"09","oa":1,"department":[{"_id":"ToHe"}],"file":[{"relation":"main_file","file_id":"4650","creator":"system","checksum":"78ec4ea1bdecc676cd3e8cad35c6182c","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2014-313-v1+1_SOE.SAS14.pdf","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:07:51Z","file_size":409485}],"oa_version":"Submitted Version"},{"day":"01","article_processing_charge":"No","isi":1,"month":"03","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Willibald","full_name":"Krenn, Willibald","last_name":"Krenn"},{"last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"department":[{"_id":"ToHe"}],"article_number":"6823899","oa":1,"project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"oa_version":"Preprint","arxiv":1,"external_id":{"arxiv":["1904.07083"],"isi":["000355985000040"]},"date_created":"2018-12-11T11:56:06Z","citation":{"chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. “Compositional Specifications for IOCO Testing.” In <i>IEEE 7th International Conference on Software Testing, Verification and Validation</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/ICST.2014.50\">https://doi.org/10.1109/ICST.2014.50</a>.","short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, in:, IEEE 7th International Conference on Software Testing, Verification and Validation, IEEE, 2014.","mla":"Daca, Przemyslaw, et al. “Compositional Specifications for IOCO Testing.” <i>IEEE 7th International Conference on Software Testing, Verification and Validation</i>, 6823899, IEEE, 2014, doi:<a href=\"https://doi.org/10.1109/ICST.2014.50\">10.1109/ICST.2014.50</a>.","apa":"Daca, P., Henzinger, T. A., Krenn, W., &#38; Nickovic, D. (2014). Compositional specifications for IOCO testing. In <i>IEEE 7th International Conference on Software Testing, Verification and Validation</i>. Cleveland, USA: IEEE. <a href=\"https://doi.org/10.1109/ICST.2014.50\">https://doi.org/10.1109/ICST.2014.50</a>","ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional specifications for IOCO testing. In: <i>IEEE 7th International Conference on Software Testing, Verification and Validation</i>. IEEE; 2014. doi:<a href=\"https://doi.org/10.1109/ICST.2014.50\">10.1109/ICST.2014.50</a>","ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing. IEEE 7th International Conference on Software Testing, Verification and Validation. ICST: International Conference on Software Testing, Verification and Validation, 6823899.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, “Compositional specifications for IOCO testing,” in <i>IEEE 7th International Conference on Software Testing, Verification and Validation</i>, Cleveland, USA, 2014."},"date_published":"2014-03-01T00:00:00Z","publication":"IEEE 7th International Conference on Software Testing, Verification and Validation","year":"2014","ec_funded":1,"quality_controlled":"1","publist_id":"4817","language":[{"iso":"eng"}],"status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5411"},{"relation":"dissertation_contains","id":"1155","status":"public"}]},"title":"Compositional specifications for IOCO testing","scopus_import":"1","publisher":"IEEE","conference":{"start_date":"2014-03-31","end_date":"2014-04-04","name":"ICST: International Conference on Software Testing, Verification and Validation","location":"Cleveland, USA"},"_id":"2167","main_file_link":[{"url":"https://arxiv.org/abs/1904.07083","open_access":"1"}],"publication_identifier":{"isbn":["978-1-4799-2255-0"],"issn":["2159-4848"]},"type":"conference","date_updated":"2025-09-29T11:40:48Z","publication_status":"published","doi":"10.1109/ICST.2014.50","abstract":[{"lang":"eng","text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing. In this paper, we study compositional properties of the ioco-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the ioco conformance relation, the resulting methodology can be applied to a broader class of systems."}]},{"year":"2014","publication":"Acta Informatica","quality_controlled":"1","publist_id":"4787","language":[{"iso":"eng"}],"ec_funded":1,"external_id":{"isi":["000335981500004"]},"article_type":"original","intvolume":"        51","citation":{"apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>","mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>.","ieee":"R. Bloem <i>et al.</i>, “Synthesizing robust systems,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.","ama":"Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. <i>Acta Informatica</i>. 2014;51(3-4):193-220. doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>"},"has_accepted_license":"1","date_created":"2018-12-11T11:56:13Z","date_published":"2014-06-01T00:00:00Z","ddc":["621"],"oa":1,"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"file":[{"date_updated":"2020-07-14T12:45:31Z","file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","date_created":"2018-12-12T10:16:44Z","access_level":"open_access","content_type":"application/pdf","file_size":169523,"relation":"main_file","creator":"system","checksum":"d7f560f3d923f0f00aa10a0652f83273","file_id":"5234"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"oa_version":"Submitted Version","issue":"3-4","article_processing_charge":"No","pubrep_id":"71","day":"01","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Greimel","first_name":"Karin","full_name":"Greimel, Karin"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Hofferek, Georg","first_name":"Georg","last_name":"Hofferek"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"first_name":"Bettina","full_name":"Könighofer, Bettina","last_name":"Könighofer"},{"last_name":"Könighofer","full_name":"Könighofer, Robert","first_name":"Robert"}],"month":"06","abstract":[{"text":"Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.","lang":"eng"}],"doi":"10.1007/s00236-013-0191-5","type":"journal_article","file_date_updated":"2020-07-14T12:45:31Z","publication_status":"published","volume":51,"date_updated":"2025-09-29T11:32:51Z","publisher":"Springer","page":"193 - 220","_id":"2187","scopus_import":"1","title":"Synthesizing robust systems","status":"public"},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"oa":1,"oa_version":"Submitted Version","day":"01","article_processing_charge":"No","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Esparza, Javier","first_name":"Javier","last_name":"Esparza"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan"}],"year":"2014","ec_funded":1,"publist_id":"4784","quality_controlled":"1","language":[{"iso":"eng"}],"arxiv":1,"external_id":{"arxiv":["1402.3388"]},"citation":{"short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>.","apa":"Esparza, J., &#38; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>","mla":"Esparza, Javier, and Jan Kretinsky. <i>From LTL to Deterministic Automata: A Safraless Compositional Approach</i>. Vol. 8559, Springer, 2014, pp. 192–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>.","ista":"Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.","ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>","ieee":"J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208."},"date_created":"2018-12-11T11:56:14Z","date_published":"2014-01-01T00:00:00Z","intvolume":"      8559","scopus_import":"1","title":"From LTL to deterministic automata: A safraless compositional approach","conference":{"name":"CAV: Computer Aided Verification"},"publisher":"Springer","_id":"2190","page":"192 - 208","main_file_link":[{"url":"http://arxiv.org/abs/1402.3388","open_access":"1"}],"status":"public","doi":"10.1007/978-3-319-08867-9_13","abstract":[{"text":"We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of φ. The slave automaton for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.","lang":"eng"}],"acknowledgement":"The author is on leave from Faculty of Informatics, Masaryk University, Czech Republic, and partially supported by the Czech Science Foundation, grant No. P202/12/G061.","alternative_title":["LNCS"],"type":"conference","volume":8559,"date_updated":"2025-06-11T08:01:04Z","publication_status":"published","corr_author":"1"},{"title":"Model measuring for hybrid systems","scopus_import":"1","OA_place":"repository","publisher":"Springer","conference":{"location":"Berlin, Germany","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2014-04-15","end_date":"2014-04-17"},"_id":"2217","page":"213 - 222","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2014-171-v1-1","open_access":"1"}],"status":"public","related_material":{"record":[{"status":"public","id":"5416","relation":"earlier_version"}]},"doi":"10.1145/2562059.2562130","abstract":[{"lang":"eng","text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem."}],"acknowledgement":"This  work  was  supported  in  part  by  the  Austrian  Science Fund  NFN  RiSE  (Rigorous  Systems  Engineering)  and  by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/171","type":"conference","date_updated":"2025-06-26T08:32:32Z","publication_status":"published","department":[{"_id":"ToHe"}],"oa":1,"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"oa_version":"Preprint","day":"01","article_processing_charge":"No","month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"publication":"Proceedings of the 17th international conference on Hybrid systems: computation and control","year":"2014","ec_funded":1,"quality_controlled":"1","publist_id":"4751","OA_type":"green","language":[{"iso":"eng"}],"citation":{"apa":"Henzinger, T. A., &#38; Otop, J. (2014). Model measuring for hybrid systems. In <i>Proceedings of the 17th international conference on Hybrid systems: computation and control</i> (pp. 213–222). Berlin, Germany: Springer. <a href=\"https://doi.org/10.1145/2562059.2562130\">https://doi.org/10.1145/2562059.2562130</a>","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” <i>Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control</i>, Springer, 2014, pp. 213–22, doi:<a href=\"https://doi.org/10.1145/2562059.2562130\">10.1145/2562059.2562130</a>.","short":"T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.” In <i>Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control</i>, 213–22. Springer, 2014. <a href=\"https://doi.org/10.1145/2562059.2562130\">https://doi.org/10.1145/2562059.2562130</a>.","ieee":"T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in <i>Proceedings of the 17th international conference on Hybrid systems: computation and control</i>, Berlin, Germany, 2014, pp. 213–222.","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222.","ama":"Henzinger TA, Otop J. Model measuring for hybrid systems. In: <i>Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control</i>. Springer; 2014:213-222. doi:<a href=\"https://doi.org/10.1145/2562059.2562130\">10.1145/2562059.2562130</a>"},"date_created":"2018-12-11T11:56:23Z","date_published":"2014-04-01T00:00:00Z"},{"ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"4749","quality_controlled":"1","year":"2014","ddc":["000"],"date_published":"2014-07-22T00:00:00Z","date_created":"2018-12-11T11:56:23Z","has_accepted_license":"1","citation":{"ieee":"P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.","ista":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584.","ama":"Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Regression-free synthesis for concurrency. In: Vol 8559. Springer; 2014:568-584. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">10.1007/978-3-319-08867-9_38</a>","apa":"Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &#38; Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">https://doi.org/10.1007/978-3-319-08867-9_38</a>","mla":"Cerny, Pavol, et al. <i>Regression-Free Synthesis for Concurrency</i>. Vol. 8559, Springer, 2014, pp. 568–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">10.1007/978-3-319-08867-9_38</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584.","chicago":"Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_38\">https://doi.org/10.1007/978-3-319-08867-9_38</a>."},"intvolume":"      8559","oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"file":[{"relation":"main_file","creator":"system","checksum":"a631d3105509f239724644e77a1212e2","file_id":"4995","date_updated":"2020-07-14T12:45:33Z","file_name":"IST-2014-297-v1+1_cav14-final.pdf","date_created":"2018-12-12T10:13:14Z","access_level":"open_access","content_type":"application/pdf","file_size":416732},{"date_created":"2018-12-12T10:13:15Z","file_name":"IST-2014-297-v2+1_cav14-final2.pdf","date_updated":"2020-07-14T12:45:33Z","content_type":"application/pdf","access_level":"open_access","file_size":616293,"relation":"main_file","checksum":"f8b0f748cc9fa697ca992cc56c87bc4e","creator":"system","file_id":"4996"}],"oa":1,"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"month":"07","author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ryzhyk","first_name":"Leonid","full_name":"Ryzhyk, Leonid"},{"first_name":"Thorsten","full_name":"Tarrach, Thorsten","last_name":"Tarrach","orcid":"0000-0003-4409-8487","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"22","pubrep_id":"297","doi":"10.1007/978-3-319-08867-9_38","abstract":[{"lang":"eng","text":"While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in the repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate solutions, from both positive examples (error-free traces) and counterexamples (error traces). From each counterexample, the algorithm learns a constraint necessary to remove the errors. From each positive examples, it learns a constraint that is necessary in order to prevent the repair from turning the trace into an error trace. We implemented the algorithm and evaluated it on simplified Linux device drivers with known bugs."}],"date_updated":"2025-04-15T08:11:58Z","volume":8559,"publication_status":"published","publication_identifier":{"isbn":["978-331908866-2"]},"file_date_updated":"2020-07-14T12:45:33Z","type":"conference","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_38"}],"scopus_import":"1","title":"Regression-free synthesis for concurrency","_id":"2218","page":"568 - 584","publisher":"Springer","conference":{"name":"CAV: Computer Aided Verification","location":"Vienna, Austria","end_date":"2014-07-22","start_date":"2014-07-18"},"related_material":{"record":[{"status":"public","id":"1130","relation":"dissertation_contains"}]},"status":"public"},{"ddc":["000"],"date_published":"2014-02-13T00:00:00Z","date_created":"2018-12-11T11:56:28Z","citation":{"ama":"Boker U, Henzinger TA. Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>","ista":"Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1).","ieee":"U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation of Computational Logic, 2014.","chicago":"Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>.","short":"U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).","mla":"Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>.","apa":"Boker, U., &#38; Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>"},"has_accepted_license":"1","intvolume":"        10","external_id":{"isi":["000333744700015"]},"ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"4728","quality_controlled":"1","publication":"Logical Methods in Computer Science","year":"2014","month":"02","author":[{"last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"pubrep_id":"389","article_processing_charge":"No","day":"13","issue":"1","oa_version":"Published Version","department":[{"_id":"ToHe"}],"file":[{"relation":"main_file","file_id":"4643","checksum":"9f6ea2e2d8d4a32ff0becc29d835bbf8","creator":"system","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:07:45Z","file_name":"IST-2015-389-v1+1_1401.3957.pdf","date_updated":"2020-07-14T12:45:34Z","file_size":550936}],"oa":1,"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-09-29T11:22:08Z","volume":10,"publication_status":"published","publication_identifier":{"issn":["1860-5974"]},"file_date_updated":"2020-07-14T12:45:34Z","type":"journal_article","doi":"10.2168/LMCS-10(1:10)2014","abstract":[{"lang":"eng","text":" A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λi, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, reflecting the assumption that earlier weights are more important than later weights. Unfortunately, determinization of NDAs, which is often essential in formal verification, is, in general, not possible. We provide positive news, showing that every NDA with an integral discount factor is determinizable. We complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor λ, there is a nondeterminizable λ-NDA. We also prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. For general NDAs, we look into approximate determinization, which is always possible as the influence of a word's suffix decays. We show that the naive approach, of unfolding the automaton computations up to a sufficient level, is doubly exponential in the discount factor. We provide an alternative construction for approximate determinization, which is singly exponential in the discount factor, in the precision, and in the number of states. We also prove matching lower bounds, showing that the exponential dependency on each of these three parameters cannot be avoided. All our results hold equally for automata over finite words and for automata over infinite words. "}],"status":"public","title":"Exact and approximate determinization of discounted-sum automata","scopus_import":"1","_id":"2233","publisher":"International Federation of Computational Logic"},{"date_published":"2014-01-13T00:00:00Z","citation":{"ieee":"U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.","ama":"Boker U, Henzinger TA, Radhakrishna A. Battery transition systems. In: Vol 49. ACM; 2014:595-606. doi:<a href=\"https://doi.org/10.1145/2535838.2535875\">10.1145/2535838.2535875</a>","ista":"Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.","mla":"Boker, Udi, et al. <i>Battery Transition Systems</i>. Vol. 49, no. 1, ACM, 2014, pp. 595–606, doi:<a href=\"https://doi.org/10.1145/2535838.2535875\">10.1145/2535838.2535875</a>.","apa":"Boker, U., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Battery transition systems (Vol. 49, pp. 595–606). Presented at the POPL: Principles of Programming Languages, San Diego, USA: ACM. <a href=\"https://doi.org/10.1145/2535838.2535875\">https://doi.org/10.1145/2535838.2535875</a>","chicago":"Boker, Udi, Thomas A Henzinger, and Arjun Radhakrishna. “Battery Transition Systems,” 49:595–606. ACM, 2014. <a href=\"https://doi.org/10.1145/2535838.2535875\">https://doi.org/10.1145/2535838.2535875</a>.","short":"U. Boker, T.A. Henzinger, A. Radhakrishna, in:, ACM, 2014, pp. 595–606."},"date_created":"2018-12-11T11:56:30Z","intvolume":"        49","ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"4722","quality_controlled":"1","year":"2014","month":"01","author":[{"first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"13","issue":"1","oa_version":"None","department":[{"_id":"ToHe"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"date_updated":"2021-01-12T06:56:13Z","volume":49,"publication_status":"published","publication_identifier":{"isbn":["978-145032544-8"]},"type":"conference","doi":"10.1145/2535838.2535875","abstract":[{"text":"The analysis of the energy consumption of software is an important goal for quantitative formal methods. Current methods, using weighted transition systems or energy games, model the energy source as an ideal resource whose status is characterized by one number, namely the amount of remaining energy. Real batteries, however, exhibit behaviors that can deviate substantially from an ideal energy resource. Based on a discretization of a standard continuous battery model, we introduce battery transition systems. In this model, a battery is viewed as consisting of two parts-the available-charge tank and the bound-charge tank. Any charge or discharge is applied to the available-charge tank. Over time, the energy from each tank diffuses to the other tank. Battery transition systems are infinite state systems that, being not well-structured, fall into no decidable class that is known to us. Nonetheless, we are able to prove that the !-regular modelchecking problem is decidable for battery transition systems. We also present a case study on the verification of control programs for energy-constrained semi-autonomous robots.","lang":"eng"}],"status":"public","scopus_import":1,"title":"Battery transition systems","page":"595 - 606","_id":"2239","conference":{"name":"POPL: Principles of Programming Languages","location":"San Diego, USA","start_date":"2014-01-22","end_date":"2014-01-24"},"publisher":"ACM"},{"status":"public","scopus_import":"1","title":"Generalised interpolation by solving recursion free-horn clauses","conference":{"end_date":"2014-07-17","start_date":"2014-07-17","location":"Vienna, Austria","name":"HCVS: Horn Clauses for Verification and Synthesis"},"publisher":"Open Publishing Association","page":"31 - 38","_id":"1702","main_file_link":[{"url":"http://arxiv.org/abs/1303.7378","open_access":"1"}],"alternative_title":["EPTCS"],"type":"conference","volume":169,"date_updated":"2025-06-11T08:03:28Z","publication_status":"published","corr_author":"1","doi":"10.4204/EPTCS.169.5","abstract":[{"lang":"eng","text":"In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools."}],"article_processing_charge":"No","day":"02","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta"},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"department":[{"_id":"ToHe"}],"oa":1,"oa_version":"Submitted Version","arxiv":1,"external_id":{"arxiv":["1303.7378"]},"citation":{"ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Vienna, Austria, 2014, vol. 169, pp. 31–38.","ista":"Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 169. Open Publishing Association; 2014:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>","mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 169, Open Publishing Association, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 31–38.","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 169:31–38. Open Publishing Association, 2014. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>."},"date_created":"2018-12-11T11:53:33Z","date_published":"2014-12-02T00:00:00Z","intvolume":"       169","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","year":"2014","publist_id":"5435","quality_controlled":"1","language":[{"iso":"eng"}]},{"title":"Interface simulation distances","scopus_import":"1","publisher":"Elsevier","page":"348 - 363","_id":"1733","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2916"}]},"doi":"10.1016/j.tcs.2014.08.019","abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"type":"journal_article","volume":560,"date_updated":"2025-09-29T13:14:25Z","publication_status":"published","corr_author":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa":1,"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","day":"04","article_processing_charge":"No","isi":1,"issue":"3","month":"12","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun"}],"publication":"Theoretical Computer Science","year":"2014","ec_funded":1,"publist_id":"5392","quality_controlled":"1","language":[{"iso":"eng"}],"arxiv":1,"external_id":{"isi":["000347601300009"],"arxiv":["1210.2450"]},"citation":{"ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>."},"date_created":"2018-12-11T11:53:43Z","date_published":"2014-12-04T00:00:00Z","intvolume":"       560"},{"abstract":[{"lang":"eng","text":"Model-based testing is a promising technology for black-box software and hardware testing, in which test cases are generated automatically from high-level specifications. Nowadays, systems typically consist of multiple interacting components and, due to their complexity, testing presents a considerable portion of the effort and cost in the design process. Exploiting the compositional structure of system specifications can considerably reduce the effort in model-based testing. Moreover, inferring properties about the system from testing its individual components allows the designer to reduce the amount of integration testing.\r\nIn this paper, we study compositional properties of the IOCO-testing theory. We propose a new approach to composition and hiding operations, inspired by contract-based design and interface theories. These operations preserve behaviors that are compatible under composition and hiding, and prune away incompatible ones. The resulting specification characterizes the input sequences for which the unit testing of components is sufficient to infer the correctness of component integration without the need for further tests. We provide a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications. While we focus on asynchronous models and the IOCO conformance relation, the resulting methodology can be applied to a broader class of systems."}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2014-148-v2-1","year":"2014","publication_status":"published","citation":{"ama":"Daca P, Henzinger TA, Krenn W, Nickovic D. <i>Compositional Specifications for IOCO Testing</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">10.15479/AT:IST-2014-148-v2-1</a>","ista":"Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p.","ieee":"P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, <i>Compositional specifications for IOCO testing</i>. IST Austria, 2014.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic. <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>.","short":"P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014.","mla":"Daca, Przemyslaw, et al. <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">10.15479/AT:IST-2014-148-v2-1</a>.","apa":"Daca, P., Henzinger, T. A., Krenn, W., &#38; Nickovic, D. (2014). <i>Compositional specifications for IOCO testing</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-148-v2-1\">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>"},"date_created":"2018-12-12T11:39:11Z","has_accepted_license":"1","date_updated":"2025-09-29T11:40:47Z","ddc":["000"],"date_published":"2014-01-28T00:00:00Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report","file_date_updated":"2020-07-14T12:46:46Z","publication_identifier":{"issn":["2664-1690"]},"oa_version":"Published Version","publisher":"IST Austria","oa":1,"_id":"5411","page":"20","file":[{"creator":"system","checksum":"0e03aba625cc334141a3148432aa5760","file_id":"5543","relation":"main_file","file_size":534732,"date_updated":"2020-07-14T12:46:46Z","file_name":"IST-2014-148-v2+1_main_tr.pdf","date_created":"2018-12-12T11:54:21Z","access_level":"open_access","content_type":"application/pdf"}],"department":[{"_id":"ToHe"}],"title":"Compositional specifications for IOCO testing","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Krenn","first_name":"Willibald","full_name":"Krenn, Willibald"},{"last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","first_name":"Dejan"}],"related_material":{"record":[{"status":"public","id":"2167","relation":"later_version"}]},"month":"01","status":"public","day":"28","pubrep_id":"152"},{"oa_version":"Published Version","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"file_id":"5497","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","creator":"system","relation":"main_file","file_size":573457,"content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T11:53:36Z","file_name":"IST-2014-170-v1+1_main.pdf","date_updated":"2020-07-14T12:46:48Z"}],"title":"Nested weighted automata","_id":"5415","oa":1,"page":"27","publisher":"IST Austria","month":"02","related_material":{"record":[{"status":"public","id":"5436","relation":"later_version"},{"status":"public","relation":"later_version","id":"467"},{"id":"1656","relation":"later_version","status":"public"}]},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","pubrep_id":"170","status":"public","doi":"10.15479/AT:IST-2014-170-v1-1","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains.  "}],"year":"2014","date_updated":"2025-09-23T09:39:58Z","date_published":"2014-02-19T00:00:00Z","ddc":["004"],"has_accepted_license":"1","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2014.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2014). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>."},"date_created":"2018-12-12T11:39:12Z","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"file_date_updated":"2020-07-14T12:46:48Z","type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"department":[{"_id":"ToHe"}],"file":[{"content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T11:53:32Z","date_updated":"2020-07-14T12:46:49Z","file_name":"IST-2014-171-v1+1_report.pdf","file_size":712077,"relation":"main_file","file_id":"5492","checksum":"445456d22371e4e49aad2b9a0c13bf80","creator":"system"}],"title":"Model measuring for hybrid systems","publisher":"IST Austria","oa":1,"_id":"5416","page":"22","oa_version":"Published Version","pubrep_id":"171","day":"19","status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"2217"}]},"month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"year":"2014","doi":"10.15479/AT:IST-2014-171-v1-1","abstract":[{"lang":"eng","text":"As hybrid systems involve continuous behaviors, they should be evaluated by quantitative methods, rather than qualitative methods. In this paper we adapt a quantitative framework, called model measuring, to the hybrid systems domain. The model-measuring problem asks, given a model M and a specification, what is the maximal distance such that all models within that distance from M satisfy (or violate) the specification. A distance function on models is given as part of the input of the problem. Distances, especially related to continuous behaviors are more natural in the hybrid case than the discrete case. We are interested in distances represented by monotonic hybrid automata, a hybrid counterpart of (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t. inclusion) in the values of parameters.The contributions of this paper are twofold. First, we give sufficient conditions under which the model-measuring problem can be solved. Second, we discuss the modeling of distances and applications of the model-measuring problem."}],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:49Z","publication_identifier":{"issn":["2664-1690"]},"alternative_title":["IST Austria Technical Report"],"type":"technical_report","has_accepted_license":"1","citation":{"chicago":"Henzinger, Thomas A, and Jan Otop. <i>Model Measuring for Hybrid Systems</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>.","short":"T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.","mla":"Henzinger, Thomas A., and Jan Otop. <i>Model Measuring for Hybrid Systems</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">10.15479/AT:IST-2014-171-v1-1</a>.","apa":"Henzinger, T. A., &#38; Otop, J. (2014). <i>Model measuring for hybrid systems</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>","ama":"Henzinger TA, Otop J. <i>Model Measuring for Hybrid Systems</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-171-v1-1\">10.15479/AT:IST-2014-171-v1-1</a>","ista":"Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.","ieee":"T. A. Henzinger and J. Otop, <i>Model measuring for hybrid systems</i>. IST Austria, 2014."},"date_created":"2018-12-12T11:39:12Z","ddc":["005"],"date_updated":"2025-06-26T08:32:32Z","date_published":"2014-02-19T00:00:00Z","publication_status":"published"}]