[{"language":[{"iso":"eng"}],"month":"09","date_updated":"2021-01-12T08:11:19Z","oa":1,"department":[{"_id":"ToHe"}],"_id":"6985","date_published":"2019-09-30T00:00:00Z","publication_identifier":{"isbn":["9781728119854"]},"citation":{"mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954."},"publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","day":"30","type":"conference","publication_status":"published","oa_version":"Preprint","doi":"10.1109/ijcnn.2019.8851954","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.03864"}],"author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Felix","full_name":"Naser, Felix","last_name":"Naser"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"}],"article_number":"8851954","conference":{"location":"Budapest, Hungary","name":"IJCNN: International Joint Conference on Neural Networks","start_date":"2019-07-14","end_date":"2019-07-19"},"title":"Response characterization for auditing cell dynamics in long short-term memory networks","abstract":[{"text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets.","lang":"eng"}],"date_created":"2019-11-04T15:59:58Z","status":"public","scopus_import":1,"publication":"Proceedings of the International Joint Conference on Neural Networks","quality_controlled":"1","arxiv":1,"external_id":{"arxiv":["1809.03864"]}},{"isi":1,"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"month":"05","date_updated":"2025-04-15T06:26:06Z","type":"journal_article","publication_status":"published","article_type":"original","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","year":"2019","article_number":"19","status":"public","publication":"Journal of the ACM","date_created":"2019-11-26T10:22:32Z","citation":{"ista":"Ferrere T, Maler O, Ničković D, Pnueli A. 2019. From real-time logic to timed automata. Journal of the ACM. 66(3), 19.","ama":"Ferrere T, Maler O, Ničković D, Pnueli A. From real-time logic to timed automata. Journal of the ACM. 2019;66(3). doi:10.1145/3286976","apa":"Ferrere, T., Maler, O., Ničković, D., & Pnueli, A. (2019). From real-time logic to timed automata. Journal of the ACM. ACM. https://doi.org/10.1145/3286976","mla":"Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” Journal of the ACM, vol. 66, no. 3, 19, ACM, 2019, doi:10.1145/3286976.","short":"T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).","chicago":"Ferrere, Thomas, Oded Maler, Dejan Ničković, and Amir Pnueli. “From Real-Time Logic to Timed Automata.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3286976.","ieee":"T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to timed automata,” Journal of the ACM, vol. 66, no. 3. ACM, 2019."},"publication_identifier":{"issn":["0004-5411"]},"date_published":"2019-05-01T00:00:00Z","publisher":"ACM","_id":"7109","volume":66,"article_processing_charge":"No","intvolume":" 66","oa_version":"None","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"title":"From real-time logic to timed automata","abstract":[{"text":"We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a “simple” formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended.","lang":"eng"}],"author":[{"orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","full_name":"Ferrere, Thomas"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"first_name":"Dejan","full_name":"Ničković, Dejan","last_name":"Ničković"},{"full_name":"Pnueli, Amir","last_name":"Pnueli","first_name":"Amir"}],"doi":"10.1145/3286976","external_id":{"isi":["000495406300005"]},"quality_controlled":"1","scopus_import":"1","issue":"3"},{"year":"2019","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"17","publication_status":"published","type":"conference","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"isi":1,"month":"09","language":[{"iso":"eng"}],"date_updated":"2026-04-16T10:26:49Z","alternative_title":["LNCS"],"date_created":"2019-12-04T16:07:50Z","publication":"17th International Conference on Computational Methods in Systems Biology","status":"public","intvolume":" 11773","oa_version":"None","page":"155-187","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"grant_number":"24573","name":"Design principles underlying genetic switch architecture","_id":"251EE76E-B435-11E9-9278-68D0E5697425"}],"_id":"7147","publisher":"Springer Nature","publication_identifier":{"eisbn":["9783030313043"],"eissn":["1611-3349"],"isbn":["9783030313036"],"issn":["0302-9743"]},"citation":{"ieee":"C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in 17th International Conference on Computational Methods in Systems Biology, Trieste, Italy, 2019, vol. 11773, pp. 155–187.","chicago":"Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali Sezgin. “Transient Memory in Gene Regulation.” In 17th International Conference on Computational Methods in Systems Biology, 11773:155–87. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-31304-3_9.","short":"C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.","mla":"Guet, Calin C., et al. “Transient Memory in Gene Regulation.” 17th International Conference on Computational Methods in Systems Biology, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.","apa":"Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., & Sezgin, A. (2019). Transient memory in gene regulation. In 17th International Conference on Computational Methods in Systems Biology (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature. https://doi.org/10.1007/978-3-030-31304-3_9","ama":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. Transient memory in gene regulation. In: 17th International Conference on Computational Methods in Systems Biology. Vol 11773. Springer Nature; 2019:155-187. doi:10.1007/978-3-030-31304-3_9","ista":"Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory in gene regulation. 17th International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773, 155–187."},"date_published":"2019-09-17T00:00:00Z","article_processing_charge":"No","volume":11773,"external_id":{"isi":["000557875100009"]},"scopus_import":"1","quality_controlled":"1","conference":{"end_date":"2019-09-20","location":"Trieste, Italy","name":"CMSB: Computational Methods in Systems Biology","start_date":"2019-09-18"},"abstract":[{"text":"The expression of a gene is characterised by its transcription factors and the function processing them. If the transcription factors are not affected by gene products, the regulating function is often represented as a combinational logic circuit, where the outputs (product) are determined by current input values (transcription factors) only, and are hence independent on their relative arrival times. However, the simultaneous arrival of transcription factors (TFs) in genetic circuits is a strong assumption, given that the processes of transcription and translation of a gene into a protein introduce intrinsic time delays and that there is no global synchronisation among the arrival times of different molecular species at molecular targets.\r\n\r\nIn this paper, we construct an experimentally implementable genetic circuit with two inputs and a single output, such that, in presence of small delays in input arrival, the circuit exhibits qualitatively distinct observable phenotypes. In particular, these phenotypes are long lived transients: they all converge to a single value, but so slowly, that they seem stable for an extended time period, longer than typical experiment duration. We used rule-based language to prototype our circuit, and we implemented a search for finding the parameter combinations raising the phenotypes of interest.\r\n\r\nThe behaviour of our prototype circuit has wide implications. First, it suggests that GRNs can exploit event timing to create phenotypes. Second, it opens the possibility that GRNs are using event timing to react to stimuli and memorise events, without explicit feedback in regulation. From the modelling perspective, our prototype circuit demonstrates the critical importance of analysing the transient dynamics at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions.","lang":"eng"}],"title":"Transient memory in gene regulation","doi":"10.1007/978-3-030-31304-3_9","author":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","first_name":"Calin C"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0001-7777-546X","first_name":"Claudia","full_name":"Igler, Claudia","last_name":"Igler","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","orcid":"0000-0002-9041-0905","first_name":"Tatjana"},{"first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali"}]},{"author":[{"first_name":"Dejan","full_name":"Ničković, Dejan","last_name":"Ničković"},{"last_name":"Qin","full_name":"Qin, Xin","first_name":"Xin"},{"first_name":"Thomas","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere"},{"full_name":"Mateis, Cristinel","last_name":"Mateis","first_name":"Cristinel"},{"first_name":"Jyotirmoy","full_name":"Deshmukh, Jyotirmoy","last_name":"Deshmukh"}],"doi":"10.1007/978-3-030-32079-9_17","title":"Shape expressions for specifying and extracting signal features","abstract":[{"lang":"eng","text":"Cyber-physical systems (CPS) and the Internet-of-Things (IoT) result in a tremendous amount of generated, measured and recorded time-series data. Extracting temporal segments that encode patterns with useful information out of these huge amounts of data is an extremely difficult problem. We propose shape expressions as a declarative formalism for specifying, querying and extracting sophisticated temporal patterns from possibly noisy data. Shape expressions are regular expressions with arbitrary (linear, exponential, sinusoidal, etc.) shapes with parameters as atomic predicates and additional constraints on these parameters. We equip shape expressions with a novel noisy semantics that combines regular expression matching semantics with statistical regression. We characterize essential properties of the formalism and propose an efficient approximate shape expression matching procedure. We demonstrate the wide applicability of this technique on two case studies. "}],"conference":{"end_date":"2019-10-11","location":"Porto, Portugal","name":"RV: Runtime Verification","start_date":"2019-10-08"},"scopus_import":"1","quality_controlled":"1","external_id":{"isi":["000570006300017"]},"volume":11757,"article_processing_charge":"No","publisher":"Springer Nature","publication_identifier":{"eisbn":["9783030320799"],"issn":["0302-9743"],"isbn":["9783030320782"]},"date_published":"2019-10-01T00:00:00Z","citation":{"ista":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. 2019. Shape expressions for specifying and extracting signal features. 19th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 11757, 292–309.","ama":"Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. Shape expressions for specifying and extracting signal features. In: 19th International Conference on Runtime Verification. Vol 11757. Springer Nature; 2019:292-309. doi:10.1007/978-3-030-32079-9_17","apa":"Ničković, D., Qin, X., Ferrere, T., Mateis, C., & Deshmukh, J. (2019). Shape expressions for specifying and extracting signal features. In 19th International Conference on Runtime Verification (Vol. 11757, pp. 292–309). Porto, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-32079-9_17","mla":"Ničković, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.” 19th International Conference on Runtime Verification, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:10.1007/978-3-030-32079-9_17.","ieee":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, and J. Deshmukh, “Shape expressions for specifying and extracting signal features,” in 19th International Conference on Runtime Verification, Porto, Portugal, 2019, vol. 11757, pp. 292–309.","short":"D. Ničković, X. Qin, T. Ferrere, C. Mateis, J. Deshmukh, in:, 19th International Conference on Runtime Verification, Springer Nature, 2019, pp. 292–309.","chicago":"Ničković, Dejan, Xin Qin, Thomas Ferrere, Cristinel Mateis, and Jyotirmoy Deshmukh. “Shape Expressions for Specifying and Extracting Signal Features.” In 19th International Conference on Runtime Verification, 11757:292–309. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-32079-9_17."},"_id":"7159","page":"292-309","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"None","intvolume":" 11757","publication":"19th International Conference on Runtime Verification","status":"public","date_created":"2019-12-09T08:47:55Z","alternative_title":["LNCS"],"month":"10","date_updated":"2026-04-16T10:27:14Z","language":[{"iso":"eng"}],"isi":1,"department":[{"_id":"ToHe"}],"publication_status":"published","type":"conference","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"01","year":"2019"},{"alternative_title":["LNCS"],"arxiv":1,"publication":"17th International Conference on Formal Modeling and Analysis of Timed Systems","status":"public","date_created":"2020-01-05T23:00:47Z","isi":1,"department":[{"_id":"ToHe"}],"month":"08","oa":1,"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:26:06Z","publication_status":"published","type":"conference","day":"13","year":"2019","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty","abstract":[{"text":"Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation for nonlinear systems with polynomial dynamics, which leverages a combination of barrier certificates. PBT has advantages over traditional time-step based methods in dealing with those nonlinear dynamical systems in which there is a large difference in speed between trajectories, producing an overapproximation that is time independent. However, the existing approach for PBT is not efficient due to the application of interval methods for enclosure-box computation, and it can only deal with continuous dynamical systems without uncertainty. In this paper, we extend the approach with the ability to handle both continuous and hybrid dynamical systems with uncertainty that can reside in parameters and/or noise. We also improve the efficiency of the method significantly, by avoiding the use of interval-based methods for the enclosure-box computation without loosing soundness. We have developed a C++ prototype implementing the proposed approach and we evaluate it on several benchmarks. The experiments show that our approach is more efficient and precise than other methods in the literature.","lang":"eng"}],"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2019-08-27","location":"Amsterdam, The Netherlands","end_date":"2019-08-29"},"author":[{"last_name":"Kong","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui","orcid":"0000-0002-3066-6941","first_name":"Hui"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"full_name":"Jiang, Yu","last_name":"Jiang","first_name":"Yu"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"https://arxiv.org/abs/1907.11514","open_access":"1"}],"doi":"10.1007/978-3-030-29662-9_8","external_id":{"isi":["000611677700008"],"arxiv":["1907.11514"]},"scopus_import":"1","quality_controlled":"1","publisher":"Springer Nature","publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-0302-9661-2"],"eissn":["1611-3349"]},"date_published":"2019-08-13T00:00:00Z","citation":{"mla":"Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” 17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.","chicago":"Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” In 17th International Conference on Formal Modeling and Analysis of Timed Systems, 11750:123–41. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_8.","short":"H. Kong, E. Bartocci, Y. Jiang, T.A. Henzinger, in:, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 123–141.","ieee":"H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty,” in 17th International Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 123–141.","ama":"Kong H, Bartocci E, Jiang Y, Henzinger TA. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In: 17th International Conference on Formal Modeling and Analysis of Timed Systems. Vol 11750. Springer Nature; 2019:123-141. doi:10.1007/978-3-030-29662-9_8","apa":"Kong, H., Bartocci, E., Jiang, Y., & Henzinger, T. A. (2019). Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature. https://doi.org/10.1007/978-3-030-29662-9_8","ista":"Kong H, Bartocci E, Jiang Y, Henzinger TA. 2019. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11750, 123–141."},"_id":"7231","volume":11750,"article_processing_charge":"No","intvolume":" 11750","oa_version":"Preprint","page":"123-141","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}]},{"_id":"7232","publisher":"Springer Nature","date_published":"2019-08-13T00:00:00Z","publication_identifier":{"isbn":["978-3-0302-9661-2"],"issn":["0302-9743"],"eissn":["1611-3349"]},"citation":{"mla":"Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.” 17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.","chicago":"Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal Logic.” In 17th International Conference on Formal Modeling and Analysis of Timed Systems, 11750:59–75. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_4.","ieee":"T. Ferrere, O. Maler, and D. Nickovic, “Mixed-time signal temporal logic,” in 17th International Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 59–75.","short":"T. Ferrere, O. Maler, D. Nickovic, in:, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 59–75.","ista":"Ferrere T, Maler O, Nickovic D. 2019. Mixed-time signal temporal logic. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Anaysis of Timed Systems, LNCS, vol. 11750, 59–75.","ama":"Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: 17th International Conference on Formal Modeling and Analysis of Timed Systems. Vol 11750. Springer Nature; 2019:59-75. doi:10.1007/978-3-030-29662-9_4","apa":"Ferrere, T., Maler, O., & Nickovic, D. (2019). Mixed-time signal temporal logic. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer Nature. https://doi.org/10.1007/978-3-030-29662-9_4"},"article_processing_charge":"No","volume":11750,"intvolume":" 11750","oa_version":"None","page":"59-75","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"conference":{"location":"Amsterdam, The Netherlands","start_date":"2019-08-27","name":"FORMATS: Formal Modeling and Anaysis of Timed Systems","end_date":"2019-08-29"},"abstract":[{"lang":"eng","text":"We present Mixed-time Signal Temporal Logic (STL−MX), a specification formalism which extends STL by capturing the discrete/ continuous time duality found in many cyber-physical systems (CPS), as well as mixed-signal electronic designs. In STL−MX, properties of components with continuous dynamics are expressed in STL, while specifications of components with discrete dynamics are written in LTL. To combine the two layers, we evaluate formulas on two traces, discrete- and continuous-time, and introduce two interface operators that map signals, properties and their satisfaction signals across the two time domains. We show that STL-mx has the expressive power of STL supplemented with an implicit T-periodic clock signal. We develop and implement an algorithm for monitoring STL-mx formulas and illustrate the approach using a mixed-signal example. "}],"title":"Mixed-time signal temporal logic","doi":"10.1007/978-3-030-29662-9_4","author":[{"full_name":"Ferrere, Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas"},{"first_name":"Oded","full_name":"Maler, Oded","last_name":"Maler"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"}],"external_id":{"isi":["000611677700004"]},"scopus_import":"1","quality_controlled":"1","department":[{"_id":"ToHe"}],"isi":1,"date_updated":"2025-04-15T06:26:06Z","month":"08","language":[{"iso":"eng"}],"day":"13","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2019","publication_status":"published","type":"conference","alternative_title":["LNCS"],"date_created":"2020-01-05T23:00:48Z","publication":"17th International Conference on Formal Modeling and Analysis of Timed Systems","status":"public"},{"alternative_title":["Lecture Notes in Computer Science"],"ddc":["000"],"status":"public","publication":"Computing and Software Science","date_created":"2020-02-05T10:51:44Z","type":"book_chapter","publication_status":"published","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","department":[{"_id":"ToHe"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","language":[{"iso":"eng"}],"oa":1,"date_updated":"2026-06-18T19:21:28Z","month":"10","scopus_import":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement."}],"title":"Continuous-time models for system design and analysis","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Kim G.","full_name":"Larsen, Kim G.","last_name":"Larsen"},{"first_name":"Marius","full_name":"Mikučionis, Marius","last_name":"Mikučionis"}],"main_file_link":[{"url":"https://doi.org/10.1007/978-3-319-91908-9_22","open_access":"1"}],"doi":"10.1007/978-3-319-91908-9_22","intvolume":" 10000","oa_version":"Published Version","project":[{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"page":"452-477","citation":{"chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. https://doi.org/10.1007/978-3-319-91908-9_22.","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in Computing and Software Science, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., & Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen & G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature. https://doi.org/10.1007/978-3-319-91908-9_22","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. Computing and Software Science. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:10.1007/978-3-319-91908-9_22","ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477."},"publication_identifier":{"eisbn":["9783319919089"],"eissn":["0302-9743"],"issn":["1611-3349"],"isbn":["9783319919072"]},"date_published":"2019-10-05T00:00:00Z","publisher":"Springer Nature","editor":[{"first_name":"Bernhard","full_name":"Steffen, Bernhard","last_name":"Steffen"},{"first_name":"Gerhard","full_name":"Woeginger, Gerhard","last_name":"Woeginger"}],"_id":"7453","volume":10000,"series_title":"LNCS","article_processing_charge":"No"},{"date_created":"2019-08-19T07:58:10Z","publication":"Proceedings of the 13th International Conference of Reachability Problems","status":"public","ddc":["000"],"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"06","year":"2019","publication_status":"published","type":"conference","file":[{"relation":"main_file","creator":"gavni","checksum":"45ebbc709af2b247d28c7c293c01504b","file_size":436635,"date_updated":"2020-07-14T12:47:41Z","access_level":"open_access","file_name":"prob.pdf","content_type":"application/pdf","file_id":"6823","date_created":"2019-08-19T07:56:40Z"}],"language":[{"iso":"eng"}],"oa":1,"date_updated":"2026-07-07T13:29:21Z","month":"09","das_tickbox":"1","department":[{"_id":"ToHe"}],"isi":1,"scopus_import":"1","quality_controlled":"1","external_id":{"isi":["001333747500001"]},"doi":"10.1007/978-3-030-30806-3_1","author":[{"full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","first_name":"Guy"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"}],"has_accepted_license":"1","conference":{"end_date":"2019-09-13","location":"Brussels, Belgium","name":"RP: Reachability Problems","start_date":"2019-09-11"},"abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one."}],"title":"Bidding games on Markov decision processes","page":"1-12","project":[{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"intvolume":" 11674","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:47:41Z","article_processing_charge":"No","volume":11674,"_id":"6822","publisher":"Springer","publication_identifier":{"isbn":["978-303030805-6"],"issn":["0302-9743"]},"date_published":"2019-09-06T00:00:00Z","citation":{"mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1"}},{"type":"conference","publication_status":"published","day":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","file":[{"file_id":"11391","content_type":"application/pdf","success":1,"file_name":"2019_EPiCs_Frehse.pdf","date_created":"2022-05-17T06:55:49Z","checksum":"4b92e333db7b4e2349501a804dfede69","creator":"dernst","relation":"main_file","access_level":"open_access","file_size":346415,"date_updated":"2022-05-17T06:55:49Z"}],"acknowledgement":"The authors gratefully acknowledge \fnancial support by the European Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported by the National Natural Science\r\nFoundation of China (No.61572249).","das_tickbox":"1","month":"05","date_updated":"2026-07-08T06:37:19Z","language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"ToHe"}],"status":"public","publication":"6th International Workshop on Applied Verification of Continuous and Hybrid Systems","date_created":"2022-03-18T12:29:23Z","alternative_title":["EPiC Series in Computing"],"ddc":["000"],"page":"1-13","file_date_updated":"2022-05-17T06:55:49Z","intvolume":" 61","oa_version":"Published Version","volume":61,"article_processing_charge":"No","date_published":"2019-05-25T00:00:00Z","citation":{"chicago":"Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” In 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.","short":"G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe, A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G. Frehse, M. Althoff (Eds.), 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.","ieee":"G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol. 61, pp. 1–13.","mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.","ista":"Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series in Computing, vol. 61, 1–13.","apa":"Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella, E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse & M. Althoff (Eds.), 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn","ama":"Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In: Frehse G, Althoff M, eds. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn"},"publication_identifier":{"issn":["2398-7340"]},"publisher":"EasyChair","editor":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"}],"_id":"10877","quality_controlled":"1","scopus_import":"1","author":[{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"first_name":"Dieky","last_name":"Adzkiya","full_name":"Adzkiya, Dieky"},{"first_name":"Anna","full_name":"Becchi, Anna","last_name":"Becchi"},{"first_name":"Lei","last_name":"Bu","full_name":"Bu, Lei"},{"full_name":"Cimatti, Alessandro","last_name":"Cimatti","first_name":"Alessandro"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"first_name":"Alberto","last_name":"Griggio","full_name":"Griggio, Alberto"},{"full_name":"Mover, Sergio","last_name":"Mover","first_name":"Sergio"},{"first_name":"Muhammad Syifa'ul","last_name":"Mufid","full_name":"Mufid, Muhammad Syifa'ul"},{"first_name":"Idriss","last_name":"Riouak","full_name":"Riouak, Idriss"},{"last_name":"Tonetta","full_name":"Tonetta, Stefano","first_name":"Stefano"},{"full_name":"Zaffanella, Enea","last_name":"Zaffanella","first_name":"Enea"}],"has_accepted_license":"1","doi":"10.29007/rjwn","abstract":[{"text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with piecewise constant dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been applied to solve five different benchmark problems in the category for piecewise constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL. Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with piecewise constant dynamics up to this date.","lang":"eng"}],"title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","conference":{"end_date":"2019-04-15","location":"Montreal, Canada","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"}},{"type":"conference","publication_status":"published","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","isi":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","month":"07","date_updated":"2025-04-14T13:51:04Z","oa":1,"language":[{"iso":"eng"}],"arxiv":1,"status":"public","date_created":"2018-12-11T11:44:13Z","intvolume":" 2018","oa_version":"Preprint","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"page":"4692 - 4699","citation":{"mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699."},"date_published":"2018-07-01T00:00:00Z","publisher":"IJCAI","_id":"24","volume":2018,"article_processing_charge":"No","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"publist_id":"8031","quality_controlled":"1","scopus_import":"1","ec_funded":1,"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"conference":{"end_date":"2018-07-19","location":"Stockholm, Sweden","name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13"},"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Adrian","last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian"},{"first_name":"Petr","full_name":"Novotny, Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Owen","last_name":"Rouillé","full_name":"Rouillé, Owen"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"doi":"10.24963/ijcai.2018/652"},{"external_id":{"isi":["000546326300021"]},"publist_id":"7584","scopus_import":"1","quality_controlled":"1","title":"Strategy representation by decision trees in reactive synthesis","abstract":[{"text":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with ω -regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy representation in graph games has been binary decision diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain the inherent flavor of the decisions of strategies, and are notoriously hard to minimize to obtain succinct representation. In this work we propose decision trees for strategy representation in graph games. Decision trees retain the flavor of decisions of strategies and allow entropy-based minimization to obtain succinct trees. However, decision trees work in settings (e.g., probabilistic models) where errors are allowed, and overfitting of data is typically avoided. In contrast, for strategies in graph games no error is allowed, and the decision tree must represent the entire strategy. We develop new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees. We have implemented our techniques to extend the existing decision tree solvers. We present experimental results for problems in reactive synthesis to show that decision trees provide a much more efficient data-structure for strategy representation as compared to BDDs.","lang":"eng"}],"ec_funded":1,"conference":{"end_date":"2018-04-20","location":"Thessaloniki, Greece","start_date":"2018-04-14","name":"TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems"},"author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan"},{"first_name":"Viktor","orcid":"0000-0001-9036-063X","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor"}],"has_accepted_license":"1","doi":"10.1007/978-3-319-89960-2_21","intvolume":" 10805","oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:57Z","page":"385 - 407","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer","citation":{"mla":"Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.","ieee":"T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.","short":"T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.","ama":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21","apa":"Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21","ista":"Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407."},"date_published":"2018-04-12T00:00:00Z","_id":"297","volume":10805,"article_processing_charge":"No","ddc":["000"],"alternative_title":["LNCS"],"status":"public","date_created":"2018-12-11T11:45:41Z","file":[{"file_name":"2018_LNCS_Brazdil.pdf","file_id":"5723","content_type":"application/pdf","date_created":"2018-12-17T16:29:08Z","relation":"main_file","creator":"dernst","checksum":"b13874ffb114932ad9cc2586b7469db4","date_updated":"2020-07-14T12:45:57Z","file_size":1829940,"access_level":"open_access"}],"publication_status":"published","type":"conference","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"12","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2025-03-31T16:01:11Z","month":"04","oa":1,"language":[{"iso":"eng"}]},{"_id":"299","citation":{"ama":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In: Beyer D, Huisman M, eds. Vol 10806. Springer; 2018:303-319. doi:10.1007/978-3-319-89963-3_18","apa":"Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., & Ulus, D. (2018). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In D. Beyer & M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89963-3_18","ista":"Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2018. AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10806, 303–319.","mla":"Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman, vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.","chicago":"Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.” edited by Dirk Beyer and Marieke Huisman, 10806:303–19. Springer, 2018. https://doi.org/10.1007/978-3-319-89963-3_18.","ieee":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10806, pp. 303–319.","short":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, in:, D. Beyer, M. Huisman (Eds.), Springer, 2018, pp. 303–319."},"date_published":"2018-04-14T00:00:00Z","editor":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"first_name":"Marieke","full_name":"Huisman, Marieke","last_name":"Huisman"}],"publisher":"Springer","article_processing_charge":"No","volume":10806,"file_date_updated":"2020-07-14T12:45:58Z","oa_version":"Published Version","intvolume":" 10806","page":"303 - 319","conference":{"end_date":"2018-04-20","start_date":"2018-04-14","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Thessaloniki, Greece"},"title":"AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic","abstract":[{"text":"We introduce in this paper AMT 2.0 , a tool for qualitative and quantitative analysis of hybrid continuous and Boolean signals that combine numerical values and discrete events. The evaluation of the signals is based on rich temporal specifications expressed in extended Signal Temporal Logic (xSTL), which integrates Timed Regular Expressions (TRE) within Signal Temporal Logic (STL). The tool features qualitative monitoring (property satisfaction checking), trace diagnostics for explaining and justifying property violations and specification-driven measurement of quantitative features of the signal.","lang":"eng"}],"doi":"10.1007/978-3-319-89963-3_18","author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"},{"last_name":"Lebeltel","full_name":"Lebeltel, Olivier","first_name":"Olivier"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","orcid":"0000-0001-5199-3143","first_name":"Thomas"},{"first_name":"Dogan","full_name":"Ulus, Dogan","last_name":"Ulus"}],"has_accepted_license":"1","publist_id":"7582","external_id":{"isi":["00445822600018"]},"scopus_import":"1","quality_controlled":"1","corr_author":"1","department":[{"_id":"ToHe"}],"isi":1,"language":[{"iso":"eng"}],"date_updated":"2024-10-09T20:58:19Z","oa":1,"month":"04","file":[{"content_type":"application/pdf","file_id":"5928","file_name":"2018_LNCS_Nickovic.pdf","date_created":"2019-02-06T07:33:05Z","checksum":"e11db3b9c8e27a1c7d1c738cc5e4d25a","relation":"main_file","creator":"dernst","access_level":"open_access","file_size":3267209,"date_updated":"2020-07-14T12:45:58Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","day":"14","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","publication_status":"published","alternative_title":["LNCS"],"related_material":{"record":[{"relation":"later_version","id":"10861","status":"public"}]},"ddc":["000"],"date_created":"2018-12-11T11:45:41Z","status":"public"},{"pubrep_id":"1039","project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","intvolume":" 118","file_date_updated":"2020-07-14T12:44:44Z","article_processing_charge":"No","volume":118,"_id":"133","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"issn":["1868-8969"]},"citation":{"mla":"Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21."},"date_published":"2018-08-13T00:00:00Z","quality_controlled":"1","scopus_import":"1","publist_id":"7790","extern":"1","doi":"10.4230/LIPIcs.CONCUR.2018.21","author":[{"orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","full_name":"Kragl, Bernhard"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"has_accepted_license":"1","conference":{"end_date":"2018-09-07","name":"CONCUR: International Conference on Concurrency Theory","start_date":"2018-09-04","location":"Beijing, China"},"abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs.","lang":"eng"}],"title":"Synchronizing the asynchronous","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2018","day":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"conference","file":[{"content_type":"application/pdf","file_id":"5368","file_name":"IST-2018-853-v2+2_concur2018.pdf","date_created":"2018-12-12T10:18:46Z","checksum":"c90895f4c5fafc18ddc54d1c8848077e","creator":"system","relation":"main_file","file_size":745438,"date_updated":"2020-07-14T12:44:44Z","access_level":"open_access"}],"OA_place":"publisher","month":"08","date_updated":"2026-04-08T07:23:52Z","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:44:48Z","OA_type":"gold","status":"public","ddc":["000"],"alternative_title":["LIPIcs"],"related_material":{"record":[{"relation":"earlier_version","id":"6426","status":"public"},{"relation":"dissertation_contains","status":"public","id":"8332"}]},"article_number":"21"},{"quality_controlled":"1","scopus_import":"1","external_id":{"isi":["000491481600025"]},"publist_id":"7783","author":[{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"has_accepted_license":"1","doi":"10.1007/978-3-319-96145-3_25","abstract":[{"text":"Reachability analysis is difficult for hybrid automata with affine differential equations, because the reach set needs to be approximated. Promising abstraction techniques usually employ interval methods or template polyhedra. Interval methods account for dense time and guarantee soundness, and there are interval-based tools that overapproximate affine flowpipes. But interval methods impose bounded and rigid shapes, which make refinement expensive and fixpoint detection difficult. Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded, but sound template refinement for unbounded reachability analysis has been implemented only for systems with piecewise constant dynamics. We capitalize on the advantages of both techniques, combining interval arithmetic and template polyhedra, using the former to abstract time and the latter to abstract space. During a CEGAR loop, whenever a spurious error trajectory is found, we compute additional space constraints and split time intervals, and use these space-time interpolants to eliminate the counterexample. Space-time interpolation offers a lazy, flexible framework for increasing precision while guaranteeing soundness, both for error avoidance and fixpoint detection. To the best of out knowledge, this is the first abstraction refinement scheme for the reachability analysis over unbounded and dense time of affine hybrid systems, which is both sound and automatic. We demonstrate the effectiveness of our algorithm with several benchmark examples, which cannot be handled by other tools.","lang":"eng"}],"title":"Space-time interpolants","conference":{"end_date":"2018-07-17","location":"Oxford, United Kingdom","start_date":"2018-07-14","name":"CAV: Computer Aided Verification"},"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"pubrep_id":"1010","page":"468 - 486","file_date_updated":"2020-07-14T12:44:50Z","intvolume":" 10981","oa_version":"Published Version","volume":10981,"article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"]},"date_published":"2018-07-18T00:00:00Z","citation":{"apa":"Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:10.1007/978-3-319-96145-3_25","ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.","ieee":"G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.","chicago":"Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,” 10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.","mla":"Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer, 2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25."},"publisher":"Springer","_id":"140","status":"public","date_created":"2018-12-11T11:44:50Z","related_material":{"record":[{"id":"6894","status":"public","relation":"dissertation_contains"}]},"ddc":["005"],"alternative_title":["LNCS"],"type":"conference","publication_status":"published","year":"2018","day":"18","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"date_created":"2018-12-12T10:17:53Z","file_id":"5310","content_type":"application/pdf","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf","access_level":"open_access","file_size":563710,"date_updated":"2020-07-14T12:44:50Z","checksum":"6dca832f575d6b3f0ea9dff56f579142","creator":"system","relation":"main_file"}],"month":"07","language":[{"iso":"eng"}],"oa":1,"date_updated":"2026-04-16T09:55:04Z","isi":1,"department":[{"_id":"ToHe"}]},{"_id":"142","date_published":"2018-07-18T00:00:00Z","citation":{"ama":"Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467. doi:10.1007/978-3-319-96145-3_24","apa":"Kong, H., Bartocci, E., & Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_24","ista":"Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification, LNCS, vol. 10981, 449–467.","mla":"Kong, Hui, et al. Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.","ieee":"H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.","chicago":"Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_24.","short":"H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467."},"publisher":"Springer","article_processing_charge":"No","volume":10981,"file_date_updated":"2020-07-14T12:44:53Z","oa_version":"Published Version","intvolume":" 10981","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}],"page":"449 - 467","conference":{"start_date":"2018-07-14","name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom","end_date":"2018-07-17"},"title":"Reachable set over-approximation for nonlinear systems using piecewise barrier tubes","abstract":[{"lang":"eng","text":"We address the problem of analyzing the reachable set of a polynomial nonlinear continuous system by over-approximating the flowpipe of its dynamics. The common approach to tackle this problem is to perform a numerical integration over a given time horizon based on Taylor expansion and interval arithmetic. However, this method results to be very conservative when there is a large difference in speed between trajectories as time progresses. In this paper, we propose to use combinations of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse box which is big enough to contain the segment is constructed using sampled simulation and then in the box we compute by linear programming a set of barrier functions (called barrier tube or BT for short) which work together to form a tube surrounding the flowpipe. The benefit of using PBT is that (1) BT is independent of time and hence can avoid being stretched and deformed by time; and (2) a small number of BTs can form a tight over-approximation for the flowpipe, which means that the computation required to decide whether the BTs intersect the unsafe set can be reduced significantly. We implemented a prototype called PBTS in C++. Experiments on some benchmark systems show that our approach is effective."}],"doi":"10.1007/978-3-319-96145-3_24","has_accepted_license":"1","author":[{"id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong","full_name":"Kong, Hui","first_name":"Hui","orcid":"0000-0002-3066-6941"},{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"publist_id":"7781","external_id":{"isi":["000491481600024"]},"scopus_import":"1","quality_controlled":"1","department":[{"_id":"ToHe"}],"isi":1,"language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-04-15T06:25:58Z","month":"07","acknowledgement":"Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32","file":[{"date_created":"2018-12-17T15:57:06Z","file_name":"2018_LNCS_Kong.pdf","content_type":"application/pdf","file_id":"5718","access_level":"open_access","file_size":5591566,"date_updated":"2020-07-14T12:44:53Z","creator":"dernst","relation":"main_file","checksum":"fd95e8026deacef3dc752a733bb9355f"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"18","year":"2018","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","publication_status":"published","ddc":["000"],"alternative_title":["LNCS"],"date_created":"2018-12-11T11:44:51Z","status":"public"},{"oa_version":"None","type":"conference","page":"394 - 403","publication_status":"published","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"09","date_published":"2018-07-09T00:00:00Z","citation":{"mla":"Ferrere, Thomas, et al. A Theory of Register Monitors. Vol. Part F138033, IEEE, 2018, pp. 394–403, doi:10.1145/3209108.3209194.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register Monitors,” Part F138033:394–403. IEEE, 2018. https://doi.org/10.1145/3209108.3209194.","ieee":"T. Ferrere, T. A. Henzinger, and E. Saraç, “A theory of register monitors,” presented at the LICS: Logic in Computer Science, Oxford, UK, 2018, vol. Part F138033, pp. 394–403.","short":"T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.","ama":"Ferrere T, Henzinger TA, Saraç E. A theory of register monitors. In: Vol Part F138033. IEEE; 2018:394-403. doi:10.1145/3209108.3209194","apa":"Ferrere, T., Henzinger, T. A., & Saraç, E. (2018). A theory of register monitors (Vol. Part F138033, pp. 394–403). Presented at the LICS: Logic in Computer Science, Oxford, UK: IEEE. https://doi.org/10.1145/3209108.3209194","ista":"Ferrere T, Henzinger TA, Saraç E. 2018. A theory of register monitors. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. Part F138033, 394–403."},"publisher":"IEEE","isi":1,"_id":"144","department":[{"_id":"ToHe"}],"volume":"Part F138033","date_updated":"2023-09-08T11:49:13Z","month":"07","language":[{"iso":"eng"}],"article_processing_charge":"No","alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"external_id":{"isi":["000545262800041"]},"publist_id":"7779","status":"public","quality_controlled":"1","scopus_import":"1","date_created":"2018-12-11T11:44:52Z","title":"A theory of register monitors","abstract":[{"lang":"eng","text":"The task of a monitor is to watch, at run-time, the execution of a reactive system, and signal the occurrence of a safety violation in the observed sequence of events. While finite-state monitors have been studied extensively, in practice, monitoring software also makes use of unbounded memory. We define a model of automata equipped with integer-valued registers which can execute only a bounded number of instructions between consecutive events, and thus can form the theoretical basis for the study of infinite-state monitors. We classify these register monitors according to the number k of available registers, and the type of register instructions. In stark contrast to the theory of computability for register machines, we prove that for every k 1, monitors with k + 1 counters (with instruction set 〈+1, =〉) are strictly more expressive than monitors with k counters. We also show that adder monitors (with instruction set 〈1, +, =〉) are strictly more expressive than counter monitors, but are complete for monitoring all computable safety -languages for k = 6. Real-time monitors are further required to signal the occurrence of a safety violation as soon as it occurs. The expressiveness hierarchy for counter monitors carries over to real-time monitors. We then show that 2 adders cannot simulate 3 counters in real-time. Finally, we show that real-time adder monitors with inequalities are as expressive as real-time Turing machines."}],"conference":{"name":"LICS: Logic in Computer Science","start_date":"2018-07-09","location":"Oxford, UK","end_date":"2018-07-12"},"author":[{"first_name":"Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Saraç","full_name":"Saraç, Ege","first_name":"Ege"}],"doi":"10.1145/3209108.3209194"},{"alternative_title":["LNCS"],"ddc":["000"],"date_created":"2018-12-11T11:44:55Z","status":"public","department":[{"_id":"ToHe"}],"isi":1,"oa":1,"month":"07","language":[{"iso":"eng"}],"date_updated":"2025-07-10T11:51:10Z","file":[{"relation":"main_file","creator":"dernst","checksum":"a045c213c42c445f1889326f8db82a0a","date_updated":"2020-10-09T06:22:41Z","access_level":"open_access","file_size":485576,"file_name":"2018_LNCS_Ferrere.pdf","success":1,"content_type":"application/pdf","file_id":"8637","date_created":"2020-10-09T06:22:41Z"}],"day":"12","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication_status":"published","conference":{"end_date":"2018-07-17","location":"Oxford, UK","name":"FM: Formal Methods","start_date":"2018-07-15"},"abstract":[{"text":"Imprecision in timing can sometimes be beneficial: Metric interval temporal logic (MITL), disabling the expression of punctuality constraints, was shown to translate to timed automata, yielding an elementary decision procedure. We show how this principle extends to other forms of dense-time specification using regular expressions. By providing a clean, automaton-based formal framework for non-punctual languages, we are able to recover and extend several results in timed systems. Metric interval regular expressions (MIRE) are introduced, providing regular expressions with non-singular duration constraints. We obtain that MIRE are expressively complete relative to a class of one-clock timed automata, which can be determinized using additional clocks. Metric interval dynamic logic (MIDL) is then defined using MIRE as temporal modalities. We show that MIDL generalizes known extensions of MITL, while translating to timed automata at comparable cost.","lang":"eng"}],"title":"The compound interest in relaxing punctuality","doi":"10.1007/978-3-319-95582-7_9","author":[{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","full_name":"Ferrere, Thomas","first_name":"Thomas","orcid":"0000-0001-5199-3143"}],"has_accepted_license":"1","publist_id":"7765","external_id":{"isi":["000489765800009"]},"scopus_import":"1","quality_controlled":"1","_id":"156","date_published":"2018-07-12T00:00:00Z","citation":{"ieee":"T. Ferrere, “The compound interest in relaxing punctuality,” presented at the FM: Formal Methods, Oxford, UK, 2018, vol. 10951, pp. 147–164.","short":"T. Ferrere, in:, Springer, 2018, pp. 147–164.","chicago":"Ferrere, Thomas. “The Compound Interest in Relaxing Punctuality,” 10951:147–64. Springer, 2018. https://doi.org/10.1007/978-3-319-95582-7_9.","mla":"Ferrere, Thomas. The Compound Interest in Relaxing Punctuality. Vol. 10951, Springer, 2018, pp. 147–64, doi:10.1007/978-3-319-95582-7_9.","ista":"Ferrere T. 2018. The compound interest in relaxing punctuality. FM: Formal Methods, LNCS, vol. 10951, 147–164.","apa":"Ferrere, T. (2018). The compound interest in relaxing punctuality (Vol. 10951, pp. 147–164). Presented at the FM: Formal Methods, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-95582-7_9","ama":"Ferrere T. The compound interest in relaxing punctuality. In: Vol 10951. Springer; 2018:147-164. doi:10.1007/978-3-319-95582-7_9"},"publisher":"Springer","article_processing_charge":"No","volume":10951,"file_date_updated":"2020-10-09T06:22:41Z","oa_version":"Submitted Version","intvolume":" 10951","project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"page":"147 - 164"},{"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"page":"79 - 102","file_date_updated":"2020-07-14T12:45:04Z","oa_version":"Published Version","intvolume":" 10981","volume":10981,"article_processing_charge":"No","date_published":"2018-07-18T00:00:00Z","citation":{"ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","apa":"Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-96145-3_5","ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:10.1007/978-3-319-96145-3_5","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_5.","ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.","short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","mla":"Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol. 10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5."},"publisher":"Springer","_id":"160","quality_controlled":"1","scopus_import":"1","external_id":{"isi":["000491481600005"]},"publist_id":"7761","has_accepted_license":"1","author":[{"first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","full_name":"Kragl, Bernhard"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"doi":"10.1007/978-3-319-96145-3_5","title":"Layered Concurrent Programs","abstract":[{"text":"We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs.","lang":"eng"}],"conference":{"end_date":"2018-07-17","location":"Oxford, UK","start_date":"2018-07-14","name":"CAV: Computer Aided Verification"},"type":"conference","publication_status":"published","year":"2018","day":"18","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"creator":"dernst","relation":"main_file","checksum":"c64fff560fe5a7532ec10626ad1c215e","file_size":1603844,"access_level":"open_access","date_updated":"2020-07-14T12:45:04Z","file_name":"2018_LNCS_Kragl.pdf","content_type":"application/pdf","file_id":"5705","date_created":"2018-12-17T12:52:12Z"}],"language":[{"iso":"eng"}],"month":"07","date_updated":"2026-04-08T07:23:52Z","oa":1,"isi":1,"department":[{"_id":"ToHe"}],"status":"public","date_created":"2018-12-11T11:44:57Z","alternative_title":["LNCS"],"ddc":["000"],"related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]}},{"publication":"Foundations and Trends in Electronic Design Automation","status":"public","date_created":"2018-12-16T22:59:19Z","publication_status":"published","article_type":"original","type":"journal_article","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","department":[{"_id":"ToHe"}],"month":"05","date_updated":"2023-10-17T11:53:09Z","oa":1,"language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":"1","issue":"2-3","abstract":[{"text":"Recently, contract-based design has been proposed as an “orthogonal” approach that complements system design methodologies proposed so far to cope with the complexity of system design. Contract-based design provides a rigorous scaffolding for verification, analysis, abstraction/refinement, and even synthesis. A number of results have been obtained in this domain but a unified treatment of the topic that can help put contract-based design in perspective was missing. This monograph intends to provide such a treatment where contracts are precisely defined and characterized so that they can be used in design methodologies with no ambiguity. In particular, this monograph identifies the essence of complex system design using contracts through a mathematical “meta-theory”, where all the properties of the methodology are derived from a very abstract and generic notion of contract. We show that the meta-theory provides deep and illuminating links with existing contract and interface theories, as well as guidelines for designing new theories. Our study encompasses contracts for both software and systems, with emphasis on the latter. We illustrate the use of contracts with two examples: requirement engineering for a parking garage management, and the development of contracts for timing and scheduling in the context of the Autosar methodology in use in the automotive sector.","lang":"eng"}],"title":"Contracts for system design","author":[{"first_name":"Albert","full_name":"Benveniste, Albert","last_name":"Benveniste"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"full_name":"Caillaud, Benoît","last_name":"Caillaud","first_name":"Benoît"},{"first_name":"Roberto","full_name":"Passerone, Roberto","last_name":"Passerone"},{"first_name":"Jean Baptiste","last_name":"Raclet","full_name":"Raclet, Jean Baptiste"},{"full_name":"Reinkemeier, Philipp","last_name":"Reinkemeier","first_name":"Philipp"},{"first_name":"Alberto","last_name":"Sangiovanni-Vincentelli","full_name":"Sangiovanni-Vincentelli, Alberto"},{"full_name":"Damm, Werner","last_name":"Damm","first_name":"Werner"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Larsen, Kim G.","last_name":"Larsen","first_name":"Kim G."}],"main_file_link":[{"url":"https://hal.inria.fr/hal-00757488/","open_access":"1"}],"doi":"10.1561/1000000053","oa_version":"Submitted Version","intvolume":" 12","page":"124-400","publisher":"Now Publishers","date_published":"2018-05-01T00:00:00Z","citation":{"ista":"Benveniste A, Nickovic D, Caillaud B, Passerone R, Raclet JB, Reinkemeier P, Sangiovanni-Vincentelli A, Damm W, Henzinger TA, Larsen KG. 2018. Contracts for system design. Foundations and Trends in Electronic Design Automation. 12(2–3), 124–400.","apa":"Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers. https://doi.org/10.1561/1000000053","ama":"Benveniste A, Nickovic D, Caillaud B, et al. Contracts for system design. Foundations and Trends in Electronic Design Automation. 2018;12(2-3):124-400. doi:10.1561/1000000053","chicago":"Benveniste, Albert, Dejan Nickovic, Benoît Caillaud, Roberto Passerone, Jean Baptiste Raclet, Philipp Reinkemeier, Alberto Sangiovanni-Vincentelli, Werner Damm, Thomas A Henzinger, and Kim G. Larsen. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation. Now Publishers, 2018. https://doi.org/10.1561/1000000053.","short":"A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.","ieee":"A. Benveniste et al., “Contracts for system design,” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.","mla":"Benveniste, Albert, et al. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:10.1561/1000000053."},"publication_identifier":{"issn":["1551-3939"]},"_id":"5677","volume":12,"article_processing_charge":"No"},{"oa_version":"Preprint","intvolume":" 11316","project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"page":"21-36","date_published":"2018-11-21T00:00:00Z","citation":{"mla":"Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.","ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2","apa":"Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2"},"publication_identifier":{"isbn":["9783030046118"],"issn":["0302-9743"]},"publisher":"Springer","_id":"5788","volume":11316,"article_processing_charge":"No","external_id":{"arxiv":["1804.04372"],"isi":["000865933000002"]},"quality_controlled":"1","scopus_import":"1","title":"Infinite-duration poorman-bidding games","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games.","lang":"eng"}],"conference":{"end_date":"2018-12-17","start_date":"2018-12-15","name":"14th International Conference on Web and Internet Economics, WINE","location":"Oxford, UK"},"author":[{"full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389"}],"doi":"10.1007/978-3-030-04612-5_2","main_file_link":[{"url":"https://arxiv.org/abs/1804.04372","open_access":"1"}],"type":"conference","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"21","year":"2018","isi":1,"department":[{"_id":"ToHe"}],"date_updated":"2026-04-16T09:54:39Z","month":"11","language":[{"iso":"eng"}],"oa":1,"alternative_title":["LNCS"],"arxiv":1,"status":"public","date_created":"2018-12-30T22:59:14Z"}]