[{"_id":"7232","doi":"10.1007/978-3-030-29662-9_4","article_processing_charge":"No","conference":{"location":"Amsterdam, The Netherlands","name":"FORMATS: Formal Modeling and Anaysis of Timed Systems","end_date":"2019-08-29","start_date":"2019-08-27"},"scopus_import":"1","date_updated":"2025-04-15T06:26:06Z","page":"59-75","status":"public","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"volume":11750,"external_id":{"isi":["000611677700004"]},"fulldoi":"https://doi.org/10.1007/978-3-030-29662-9_4","oa_version":"None","language":[{"iso":"eng"}],"isi":1,"date_created":"2020-01-05T23:00:48Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-0302-9661-2"],"issn":["0302-9743"]},"quality_controlled":"1","publication_status":"published","publisher":"Springer Nature","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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. "}],"citation":{"apa":"Ferrere, T., Maler, O., &#38; Nickovic, D. (2019). Mixed-time signal temporal logic. In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">https://doi.org/10.1007/978-3-030-29662-9_4</a>","chicago":"Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal Logic.” In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, 11750:59–75. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">https://doi.org/10.1007/978-3-030-29662-9_4</a>.","mla":"Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.” <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">10.1007/978-3-030-29662-9_4</a>.","ieee":"T. Ferrere, O. Maler, and D. Nickovic, “Mixed-time signal temporal logic,” in <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 59–75.","ama":"Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 11750. Springer Nature; 2019:59-75. doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">10.1007/978-3-030-29662-9_4</a>","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."},"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","last_name":"Maler","full_name":"Maler, Oded"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"}],"month":"08","title":"Mixed-time signal temporal logic","date_published":"2019-08-13T00:00:00Z","year":"2019","type":"conference","intvolume":"     11750","publication":"17th International Conference on Formal Modeling and Analysis of Timed Systems","day":"13"},{"type":"book_chapter","intvolume":"     10000","ddc":["000"],"publication":"Computing and Software Science","day":"05","month":"10","title":"Continuous-time models for system design and analysis","date_published":"2019-10-05T00:00:00Z","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.","year":"2019","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"citation":{"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.","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. <i>Computing and Software Science</i>. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>","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.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &#38; Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &#38; G. Woeginger (Eds.), <i>Computing and Software Science</i> (Vol. 10000, pp. 452–477). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in <i>Computing and Software Science</i>, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>.","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>."},"author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."},{"first_name":"Marius","full_name":"Mikučionis, Marius","last_name":"Mikučionis"}],"project":[{"grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"publication_identifier":{"eissn":["0302-9743"],"isbn":["9783319919072"],"issn":["1611-3349"],"eisbn":["9783319919089"]},"oa":1,"quality_controlled":"1","publication_status":"published","oa_version":"Published Version","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1007/978-3-319-91908-9_22","open_access":"1"}],"date_created":"2020-02-05T10:51:44Z","alternative_title":["Lecture Notes in Computer Science"],"volume":10000,"fulldoi":"https://doi.org/10.1007/978-3-319-91908-9_22","status":"public","editor":[{"last_name":"Steffen","full_name":"Steffen, Bernhard","first_name":"Bernhard"},{"first_name":"Gerhard","last_name":"Woeginger","full_name":"Woeginger, Gerhard"}],"department":[{"_id":"ToHe"}],"doi":"10.1007/978-3-319-91908-9_22","_id":"7453","series_title":"LNCS","article_processing_charge":"No","date_updated":"2026-06-18T19:21:28Z","scopus_import":"1","page":"452-477"},{"status":"public","department":[{"_id":"ToHe"}],"conference":{"start_date":"2019-09-11","end_date":"2019-09-13","name":"RP: Reachability Problems","location":"Brussels, Belgium"},"article_processing_charge":"No","_id":"6822","doi":"10.1007/978-3-030-30806-3_1","page":"1-12","scopus_import":"1","date_updated":"2026-07-07T13:29:21Z","language":[{"iso":"eng"}],"oa_version":"Submitted Version","date_created":"2019-08-19T07:58:10Z","isi":1,"has_accepted_license":"1","das_tickbox":"1","fulldoi":"https://doi.org/10.1007/978-3-030-30806-3_1","external_id":{"isi":["001333747500001"]},"volume":11674,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","author":[{"last_name":"Avni","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"}],"citation":{"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.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: <i>Proceedings of the 13th International Conference of Reachability Problems</i>. Vol 11674. Springer; 2019:1-12. doi:<a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">10.1007/978-3-030-30806-3_1</a>","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.","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., &#38; Novotny, P. (2019). Bidding games on Markov decision processes. In <i>Proceedings of the 13th International Conference of Reachability Problems</i> (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">https://doi.org/10.1007/978-3-030-30806-3_1</a>","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” <i>Proceedings of the 13th International Conference of Reachability Problems</i>, vol. 11674, Springer, 2019, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">10.1007/978-3-030-30806-3_1</a>.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in <i>Proceedings of the 13th International Conference of Reachability Problems</i>, 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 <i>Proceedings of the 13th International Conference of Reachability Problems</i>, 11674:1–12. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30806-3_1\">https://doi.org/10.1007/978-3-030-30806-3_1</a>."},"file_date_updated":"2020-07-14T12:47:41Z","abstract":[{"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.","lang":"eng"}],"oa":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["978-303030805-6"]},"project":[{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"publication_status":"published","quality_controlled":"1","intvolume":"     11674","type":"conference","day":"06","publication":"Proceedings of the 13th International Conference of Reachability Problems","ddc":["000"],"date_published":"2019-09-06T00:00:00Z","file":[{"content_type":"application/pdf","file_size":436635,"date_updated":"2020-07-14T12:47:41Z","file_id":"6823","checksum":"45ebbc709af2b247d28c7c293c01504b","file_name":"prob.pdf","relation":"main_file","creator":"gavni","access_level":"open_access","date_created":"2019-08-19T07:56:40Z"}],"title":"Bidding games on Markov decision processes","month":"09","year":"2019"},{"type":"conference","intvolume":"        61","ddc":["000"],"publication":"6th International Workshop on Applied Verification of Continuous and Hybrid Systems","day":"25","month":"05","title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","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).","date_published":"2019-05-25T00:00:00Z","file":[{"success":1,"relation":"main_file","creator":"dernst","access_level":"open_access","date_created":"2022-05-17T06:55:49Z","content_type":"application/pdf","file_size":346415,"date_updated":"2022-05-17T06:55:49Z","file_id":"11391","checksum":"4b92e333db7b4e2349501a804dfede69","file_name":"2019_EPiCs_Frehse.pdf"}],"year":"2019","publisher":"EasyChair","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"citation":{"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.","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. <i>6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>. Vol 61. EasyChair; 2019:1-13. doi:<a href=\"https://doi.org/10.29007/rjwn\">10.29007/rjwn</a>","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.","mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” <i>6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:<a href=\"https://doi.org/10.29007/rjwn\">10.29007/rjwn</a>.","ieee":"G. Frehse <i>et al.</i>, “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in <i>6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>, Montreal, Canada, 2019, vol. 61, pp. 1–13.","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 <i>6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i>, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. <a href=\"https://doi.org/10.29007/rjwn\">https://doi.org/10.29007/rjwn</a>.","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 &#38; M. Althoff (Eds.), <i>6th International Workshop on Applied Verification of Continuous and Hybrid Systems</i> (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. <a href=\"https://doi.org/10.29007/rjwn\">https://doi.org/10.29007/rjwn</a>"},"file_date_updated":"2022-05-17T06:55:49Z","author":[{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"full_name":"Adzkiya, Dieky","last_name":"Adzkiya","first_name":"Dieky"},{"first_name":"Anna","full_name":"Becchi, Anna","last_name":"Becchi"},{"first_name":"Lei","full_name":"Bu, Lei","last_name":"Bu"},{"full_name":"Cimatti, Alessandro","last_name":"Cimatti","first_name":"Alessandro"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","first_name":"Mirco","last_name":"Giacobbe","full_name":"Giacobbe, Mirco"},{"full_name":"Griggio, Alberto","last_name":"Griggio","first_name":"Alberto"},{"last_name":"Mover","full_name":"Mover, Sergio","first_name":"Sergio"},{"first_name":"Muhammad Syifa'ul","last_name":"Mufid","full_name":"Mufid, Muhammad Syifa'ul"},{"full_name":"Riouak, Idriss","last_name":"Riouak","first_name":"Idriss"},{"first_name":"Stefano","full_name":"Tonetta, Stefano","last_name":"Tonetta"},{"full_name":"Zaffanella, Enea","last_name":"Zaffanella","first_name":"Enea"}],"publication_identifier":{"issn":["2398-7340"]},"oa":1,"quality_controlled":"1","publication_status":"published","oa_version":"Published Version","language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2022-03-18T12:29:23Z","das_tickbox":"1","alternative_title":["EPiC Series in Computing"],"volume":61,"fulldoi":"https://doi.org/10.29007/rjwn","status":"public","editor":[{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"}],"department":[{"_id":"ToHe"}],"_id":"10877","doi":"10.29007/rjwn","conference":{"end_date":"2019-04-15","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","location":"Montreal, Canada"},"article_processing_charge":"No","scopus_import":"1","date_updated":"2026-07-08T06:37:19Z","page":"1-13"},{"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","month":"07","date_published":"2018-07-01T00:00:00Z","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","year":"2018","intvolume":"      2018","type":"conference","day":"01","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"oa":1,"arxiv":1,"quality_controlled":"1","publication_status":"published","publisher":"IJCAI","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"8031","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"}],"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Elgyütt, Adrian","last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rouillé","full_name":"Rouillé, Owen","first_name":"Owen"}],"citation":{"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.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 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:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>","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.","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. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives</i>. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., &#38; 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. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>"},"volume":2018,"fulldoi":"https://doi.org/10.24963/ijcai.2018/652","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"isi":1,"date_created":"2018-12-11T11:44:13Z","doi":"10.24963/ijcai.2018/652","_id":"24","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","location":"Stockholm, Sweden","end_date":"2018-07-19","start_date":"2018-07-13"},"ec_funded":1,"article_processing_charge":"No","date_updated":"2025-04-14T13:51:04Z","scopus_import":"1","page":"4692 - 4699","status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"external_id":{"isi":["000546326300021"]},"fulldoi":"https://doi.org/10.1007/978-3-319-89960-2_21","alternative_title":["LNCS"],"volume":10805,"date_created":"2018-12-11T11:45:41Z","has_accepted_license":"1","isi":1,"oa_version":"Published Version","language":[{"iso":"eng"}],"page":"385 - 407","date_updated":"2025-03-31T16:01:11Z","scopus_import":"1","conference":{"name":"TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems","location":"Thessaloniki, Greece","end_date":"2018-04-20","start_date":"2018-04-14"},"ec_funded":1,"article_processing_charge":"No","_id":"297","doi":"10.1007/978-3-319-89960-2_21","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"tmp":{"image":"/images/cc_by.png","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"},"status":"public","year":"2018","file":[{"access_level":"open_access","creator":"dernst","date_created":"2018-12-17T16:29:08Z","relation":"main_file","file_id":"5723","checksum":"b13874ffb114932ad9cc2586b7469db4","file_name":"2018_LNCS_Brazdil.pdf","date_updated":"2020-07-14T12:45:57Z","content_type":"application/pdf","file_size":1829940}],"date_published":"2018-04-12T00:00:00Z","title":"Strategy representation by decision trees in reactive synthesis","month":"04","day":"12","ddc":["000"],"type":"conference","intvolume":"     10805","publication_status":"published","quality_controlled":"1","oa":1,"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:45:57Z","citation":{"apa":"Brázdil, T., Chatterjee, K., Kretinsky, J., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">https://doi.org/10.1007/978-3-319-89960-2_21</a>","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">https://doi.org/10.1007/978-3-319-89960-2_21</a>.","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.","mla":"Brázdil, Tomáš, et al. <i>Strategy Representation by Decision Trees in Reactive Synthesis</i>. Vol. 10805, Springer, 2018, pp. 385–407, doi:<a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">10.1007/978-3-319-89960-2_21</a>.","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:<a href=\"https://doi.org/10.1007/978-3-319-89960-2_21\">10.1007/978-3-319-89960-2_21</a>","short":"T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407.","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."},"author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"full_name":"Toman, Viktor","last_name":"Toman","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor"}],"publist_id":"7584","abstract":[{"lang":"eng","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."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer"},{"fulldoi":"https://doi.org/10.1007/978-3-319-89963-3_18","external_id":{"isi":["00445822600018"]},"volume":10806,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:45:41Z","isi":1,"has_accepted_license":"1","conference":{"location":"Thessaloniki, Greece","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2018-04-14","end_date":"2018-04-20"},"article_processing_charge":"No","_id":"299","doi":"10.1007/978-3-319-89963-3_18","page":"303 - 319","date_updated":"2024-10-09T20:58:19Z","scopus_import":"1","tmp":{"image":"/images/cc_by.png","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"},"editor":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"first_name":"Marieke","full_name":"Huisman, Marieke","last_name":"Huisman"}],"status":"public","department":[{"_id":"ToHe"}],"file":[{"creator":"dernst","access_level":"open_access","date_created":"2019-02-06T07:33:05Z","relation":"main_file","date_updated":"2020-07-14T12:45:58Z","file_id":"5928","file_name":"2018_LNCS_Nickovic.pdf","checksum":"e11db3b9c8e27a1c7d1c738cc5e4d25a","content_type":"application/pdf","file_size":3267209}],"date_published":"2018-04-14T00:00:00Z","title":"AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic","month":"04","year":"2018","intvolume":"     10806","type":"conference","day":"14","ddc":["000"],"oa":1,"publication_status":"published","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","author":[{"full_name":"Nickovic, Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"},{"first_name":"Olivier","last_name":"Lebeltel","full_name":"Lebeltel, Olivier"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"full_name":"Ulus, Dogan","last_name":"Ulus","first_name":"Dogan"}],"related_material":{"record":[{"id":"10861","status":"public","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:45:58Z","citation":{"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.","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:<a href=\"https://doi.org/10.1007/978-3-319-89963-3_18\">10.1007/978-3-319-89963-3_18</a>","short":"D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, in:, D. Beyer, M. Huisman (Eds.), Springer, 2018, pp. 303–319.","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. <a href=\"https://doi.org/10.1007/978-3-319-89963-3_18\">https://doi.org/10.1007/978-3-319-89963-3_18</a>.","mla":"Nickovic, Dejan, et al. <i>AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic</i>. Edited by Dirk Beyer and Marieke Huisman, vol. 10806, Springer, 2018, pp. 303–19, doi:<a href=\"https://doi.org/10.1007/978-3-319-89963-3_18\">10.1007/978-3-319-89963-3_18</a>.","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.","apa":"Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &#38; Ulus, D. (2018). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In D. Beyer &#38; 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. <a href=\"https://doi.org/10.1007/978-3-319-89963-3_18\">https://doi.org/10.1007/978-3-319-89963-3_18</a>"},"corr_author":"1","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"}],"publist_id":"7582"},{"fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21","volume":118,"alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:44:48Z","has_accepted_license":"1","article_processing_charge":"No","conference":{"start_date":"2018-09-04","end_date":"2018-09-07","name":"CONCUR: International Conference on Concurrency Theory","location":"Beijing, China"},"doi":"10.4230/LIPIcs.CONCUR.2018.21","_id":"133","scopus_import":"1","date_updated":"2026-04-08T07:23:52Z","extern":"1","tmp":{"image":"/images/cc_by.png","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"},"status":"public","OA_place":"publisher","department":[{"_id":"ToHe"}],"article_number":"21","pubrep_id":"1039","file":[{"relation":"main_file","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:18:46Z","content_type":"application/pdf","file_size":745438,"file_id":"5368","file_name":"IST-2018-853-v2+2_concur2018.pdf","checksum":"c90895f4c5fafc18ddc54d1c8848077e","date_updated":"2020-07-14T12:44:44Z"}],"date_published":"2018-08-13T00:00:00Z","title":"Synchronizing the asynchronous","month":"08","year":"2018","intvolume":"       118","type":"conference","day":"13","OA_type":"gold","ddc":["000"],"oa":1,"publication_identifier":{"issn":["1868-8969"]},"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"publication_status":"published","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"related_material":{"record":[{"relation":"earlier_version","id":"6426","status":"public"},{"status":"public","id":"8332","relation":"dissertation_contains"}]},"file_date_updated":"2020-07-14T12:44:44Z","citation":{"mla":"Kragl, Bernhard, et al. <i>Synchronizing the Asynchronous</i>. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">10.4230/LIPIcs.CONCUR.2018.21</a>.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.21</a>.","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.","apa":"Kragl, B., Qadeer, S., &#38; 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. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.21</a>","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 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:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">10.4230/LIPIcs.CONCUR.2018.21</a>"},"publist_id":"7790","abstract":[{"lang":"eng","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."}]},{"publication_status":"published","quality_controlled":"1","oa":1,"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0302-9743"]},"author":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"related_material":{"record":[{"status":"public","id":"6894","relation":"dissertation_contains"}]},"citation":{"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. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>.","mla":"Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer, 2018, pp. 468–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>.","apa":"Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>","ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>","short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486."},"file_date_updated":"2020-07-14T12:44:50Z","publist_id":"7783","abstract":[{"lang":"eng","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."}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Springer","year":"2018","date_published":"2018-07-18T00:00:00Z","file":[{"relation":"main_file","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:17:53Z","content_type":"application/pdf","file_size":563710,"date_updated":"2020-07-14T12:44:50Z","file_id":"5310","checksum":"6dca832f575d6b3f0ea9dff56f579142","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf"}],"title":"Space-time interpolants","month":"07","day":"18","ddc":["005"],"intvolume":"     10981","type":"conference","page":"468 - 486","date_updated":"2026-04-16T09:55:04Z","scopus_import":"1","article_processing_charge":"No","conference":{"end_date":"2018-07-17","start_date":"2018-07-14","name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom"},"_id":"140","doi":"10.1007/978-3-319-96145-3_25","department":[{"_id":"ToHe"}],"pubrep_id":"1010","tmp":{"image":"/images/cc_by.png","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"},"status":"public","fulldoi":"https://doi.org/10.1007/978-3-319-96145-3_25","external_id":{"isi":["000491481600025"]},"volume":10981,"alternative_title":["LNCS"],"date_created":"2018-12-11T11:44:50Z","isi":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"oa_version":"Published Version"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","author":[{"first_name":"Hui","orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui","last_name":"Kong"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"citation":{"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. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>.","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.","mla":"Kong, Hui, et al. <i>Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes</i>. Vol. 10981, Springer, 2018, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>.","apa":"Kong, H., Bartocci, E., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>","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.","short":"H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.","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:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>"},"file_date_updated":"2020-07-14T12:44:53Z","abstract":[{"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.","lang":"eng"}],"publist_id":"7781","oa":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"publication_status":"published","quality_controlled":"1","intvolume":"     10981","type":"conference","day":"18","ddc":["000"],"date_published":"2018-07-18T00:00:00Z","file":[{"content_type":"application/pdf","file_size":5591566,"date_updated":"2020-07-14T12:44:53Z","file_id":"5718","checksum":"fd95e8026deacef3dc752a733bb9355f","file_name":"2018_LNCS_Kong.pdf","relation":"main_file","access_level":"open_access","creator":"dernst","date_created":"2018-12-17T15:57:06Z"}],"acknowledgement":"Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32","month":"07","title":"Reachable set over-approximation for nonlinear systems using piecewise barrier tubes","year":"2018","tmp":{"image":"/images/cc_by.png","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"},"status":"public","department":[{"_id":"ToHe"}],"conference":{"name":"CAV: Computer Aided Verification","location":"Oxford, United Kingdom","start_date":"2018-07-14","end_date":"2018-07-17"},"article_processing_charge":"No","_id":"142","doi":"10.1007/978-3-319-96145-3_24","page":"449 - 467","scopus_import":"1","date_updated":"2025-04-15T06:25:58Z","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:44:51Z","isi":1,"has_accepted_license":"1","fulldoi":"https://doi.org/10.1007/978-3-319-96145-3_24","external_id":{"isi":["000491481600024"]},"volume":10981,"alternative_title":["LNCS"]},{"quality_controlled":"1","publication_status":"published","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."}],"publist_id":"7779","citation":{"ama":"Ferrere T, Henzinger TA, Saraç E. A theory of register monitors. In: Vol Part F138033. IEEE; 2018:394-403. doi:<a href=\"https://doi.org/10.1145/3209108.3209194\">10.1145/3209108.3209194</a>","short":"T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.","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.","apa":"Ferrere, T., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1145/3209108.3209194\">https://doi.org/10.1145/3209108.3209194</a>","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.","mla":"Ferrere, Thomas, et al. <i>A Theory of Register Monitors</i>. Vol. Part F138033, IEEE, 2018, pp. 394–403, doi:<a href=\"https://doi.org/10.1145/3209108.3209194\">10.1145/3209108.3209194</a>.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register Monitors,” Part F138033:394–403. IEEE, 2018. <a href=\"https://doi.org/10.1145/3209108.3209194\">https://doi.org/10.1145/3209108.3209194</a>."},"author":[{"full_name":"Ferrere, Thomas","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Ege","last_name":"Saraç","full_name":"Saraç, Ege"}],"publisher":"IEEE","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","title":"A theory of register monitors","month":"07","date_published":"2018-07-09T00:00:00Z","day":"09","type":"conference","scopus_import":"1","date_updated":"2023-09-08T11:49:13Z","page":"394 - 403","doi":"10.1145/3209108.3209194","_id":"144","conference":{"location":"Oxford, UK","name":"LICS: Logic in Computer Science","start_date":"2018-07-09","end_date":"2018-07-12"},"article_processing_charge":"No","department":[{"_id":"ToHe"}],"status":"public","alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"volume":"Part F138033","external_id":{"isi":["000545262800041"]},"fulldoi":"https://doi.org/10.1145/3209108.3209194","isi":1,"date_created":"2018-12-11T11:44:52Z","oa_version":"None","language":[{"iso":"eng"}]},{"department":[{"_id":"ToHe"}],"status":"public","page":"147 - 164","date_updated":"2025-07-10T11:51:10Z","scopus_import":"1","conference":{"start_date":"2018-07-15","end_date":"2018-07-17","name":"FM: Formal Methods","location":"Oxford, UK"},"article_processing_charge":"No","_id":"156","doi":"10.1007/978-3-319-95582-7_9","date_created":"2018-12-11T11:44:55Z","isi":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-319-95582-7_9","external_id":{"isi":["000489765800009"]},"volume":10951,"alternative_title":["LNCS"],"author":[{"full_name":"Ferrere, Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas"}],"citation":{"short":"T. Ferrere, in:, Springer, 2018, pp. 147–164.","ama":"Ferrere T. The compound interest in relaxing punctuality. In: Vol 10951. Springer; 2018:147-164. doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>","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. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>","chicago":"Ferrere, Thomas. “The Compound Interest in Relaxing Punctuality,” 10951:147–64. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>.","mla":"Ferrere, Thomas. <i>The Compound Interest in Relaxing Punctuality</i>. Vol. 10951, Springer, 2018, pp. 147–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>.","ieee":"T. Ferrere, “The compound interest in relaxing punctuality,” presented at the FM: Formal Methods, Oxford, UK, 2018, vol. 10951, pp. 147–164."},"file_date_updated":"2020-10-09T06:22:41Z","publist_id":"7765","abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","publication_status":"published","quality_controlled":"1","oa":1,"project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"day":"12","ddc":["000"],"intvolume":"     10951","type":"conference","year":"2018","file":[{"access_level":"open_access","creator":"dernst","date_created":"2020-10-09T06:22:41Z","relation":"main_file","success":1,"file_id":"8637","file_name":"2018_LNCS_Ferrere.pdf","checksum":"a045c213c42c445f1889326f8db82a0a","date_updated":"2020-10-09T06:22:41Z","content_type":"application/pdf","file_size":485576}],"date_published":"2018-07-12T00:00:00Z","title":"The compound interest in relaxing punctuality","month":"07"},{"intvolume":"     10981","type":"conference","ddc":["000"],"day":"18","title":"Layered Concurrent Programs","month":"07","file":[{"file_id":"5705","file_name":"2018_LNCS_Kragl.pdf","checksum":"c64fff560fe5a7532ec10626ad1c215e","date_updated":"2020-07-14T12:45:04Z","content_type":"application/pdf","file_size":1603844,"creator":"dernst","access_level":"open_access","date_created":"2018-12-17T12:52:12Z","relation":"main_file"}],"date_published":"2018-07-18T00:00:00Z","year":"2018","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7761","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"}],"author":[{"last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"}],"file_date_updated":"2020-07-14T12:45:04Z","citation":{"ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>","short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","apa":"Kragl, B., &#38; Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>","mla":"Kragl, Bernhard, and Shaz Qadeer. <i>Layered Concurrent Programs</i>. Vol. 10981, Springer, 2018, pp. 79–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>.","ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102."},"related_material":{"record":[{"status":"public","id":"8332","relation":"dissertation_contains"}]},"project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa":1,"quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"oa_version":"Published Version","isi":1,"has_accepted_license":"1","date_created":"2018-12-11T11:44:57Z","volume":10981,"alternative_title":["LNCS"],"fulldoi":"https://doi.org/10.1007/978-3-319-96145-3_5","external_id":{"isi":["000491481600005"]},"status":"public","tmp":{"image":"/images/cc_by.png","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"},"department":[{"_id":"ToHe"}],"doi":"10.1007/978-3-319-96145-3_5","_id":"160","conference":{"end_date":"2018-07-17","start_date":"2018-07-14","location":"Oxford, UK","name":"CAV: Computer Aided Verification"},"article_processing_charge":"No","scopus_import":"1","date_updated":"2026-04-08T07:23:52Z","page":"79 - 102"},{"month":"05","title":"Contracts for system design","date_published":"2018-05-01T00:00:00Z","year":"2018","article_type":"original","intvolume":"        12","type":"journal_article","issue":"2-3","day":"01","publication":"Foundations and Trends in Electronic Design Automation","publication_identifier":{"issn":["1551-3939"]},"oa":1,"quality_controlled":"1","publication_status":"published","publisher":"Now Publishers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"author":[{"full_name":"Benveniste, Albert","last_name":"Benveniste","first_name":"Albert"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"first_name":"Benoît","last_name":"Caillaud","full_name":"Caillaud, Benoît"},{"last_name":"Passerone","full_name":"Passerone, Roberto","first_name":"Roberto"},{"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","full_name":"Sangiovanni-Vincentelli, Alberto","last_name":"Sangiovanni-Vincentelli"},{"first_name":"Werner","last_name":"Damm","full_name":"Damm, Werner"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."}],"citation":{"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.” <i>Foundations and Trends in Electronic Design Automation</i>. Now Publishers, 2018. <a href=\"https://doi.org/10.1561/1000000053\">https://doi.org/10.1561/1000000053</a>.","mla":"Benveniste, Albert, et al. “Contracts for System Design.” <i>Foundations and Trends in Electronic Design Automation</i>, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:<a href=\"https://doi.org/10.1561/1000000053\">10.1561/1000000053</a>.","ieee":"A. Benveniste <i>et al.</i>, “Contracts for system design,” <i>Foundations and Trends in Electronic Design Automation</i>, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.","apa":"Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. <i>Foundations and Trends in Electronic Design Automation</i>. Now Publishers. <a href=\"https://doi.org/10.1561/1000000053\">https://doi.org/10.1561/1000000053</a>","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.","ama":"Benveniste A, Nickovic D, Caillaud B, et al. Contracts for system design. <i>Foundations and Trends in Electronic Design Automation</i>. 2018;12(2-3):124-400. doi:<a href=\"https://doi.org/10.1561/1000000053\">10.1561/1000000053</a>","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."},"volume":12,"fulldoi":"https://doi.org/10.1561/1000000053","language":[{"iso":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://hal.inria.fr/hal-00757488/","open_access":"1"}],"date_created":"2018-12-16T22:59:19Z","_id":"5677","doi":"10.1561/1000000053","article_processing_charge":"No","scopus_import":"1","date_updated":"2023-10-17T11:53:09Z","page":"124-400","status":"public","department":[{"_id":"ToHe"}]},{"day":"21","intvolume":"     11316","type":"conference","year":"2018","date_published":"2018-11-21T00:00:00Z","title":"Infinite-duration poorman-bidding games","month":"11","author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"}],"citation":{"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.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>","mla":"Avni, Guy, et al. <i>Infinite-Duration Poorman-Bidding Games</i>. Vol. 11316, Springer, 2018, pp. 21–36, doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>.","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>.","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.","apa":"Avni, G., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>"},"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 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."}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Springer","quality_controlled":"1","oa":1,"arxiv":1,"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030046118"]},"date_created":"2018-12-30T22:59:14Z","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.04372"}],"language":[{"iso":"eng"}],"oa_version":"Preprint","fulldoi":"https://doi.org/10.1007/978-3-030-04612-5_2","external_id":{"isi":["000865933000002"],"arxiv":["1804.04372"]},"volume":11316,"alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"status":"public","page":"21-36","scopus_import":"1","date_updated":"2026-04-16T09:54:39Z","conference":{"start_date":"2018-12-15","end_date":"2018-12-17","name":"14th International Conference on Web and Internet Economics, WINE","location":"Oxford, UK"},"article_processing_charge":"No","_id":"5788","doi":"10.1007/978-3-030-04612-5_2"},{"publication_identifier":{"isbn":["9781538655603"]},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"oa":1,"quality_controlled":"1","publication_status":"published","publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain."}],"file_date_updated":"2020-07-14T12:47:13Z","citation":{"apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., &#38; Nickovicl, D. (2018). Keynote: The first-order logic of signals. In <i>2018 International Conference on Embedded Software</i> (pp. 1–10). Turin, Italy: IEEE. <a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">https://doi.org/10.1109/emsoft.2018.8537203</a>","mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” <i>2018 International Conference on Embedded Software</i>, IEEE, 2018, pp. 1–10, doi:<a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">10.1109/emsoft.2018.8537203</a>.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In <i>2018 International Conference on Embedded Software</i>, 1–10. IEEE, 2018. <a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">https://doi.org/10.1109/emsoft.2018.8537203</a>.","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in <i>2018 International Conference on Embedded Software</i>, Turin, Italy, 2018, pp. 1–10.","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: <i>2018 International Conference on Embedded Software</i>. IEEE; 2018:1-10. doi:<a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">10.1109/emsoft.2018.8537203</a>","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: Embedded Software, 1–10."},"author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"last_name":"Ferrere","full_name":"Ferrere, Thomas","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nickovicl, Deian","last_name":"Nickovicl","first_name":"Deian"}],"title":"Keynote: The first-order logic of signals","month":"09","date_published":"2018-09-30T00:00:00Z","file":[{"file_size":338006,"content_type":"application/pdf","checksum":"234a33ad9055b3458fcdda6af251b33a","file_name":"2018_EMSOFT_Bakhirkin.pdf","file_id":"7839","date_updated":"2020-07-14T12:47:13Z","relation":"main_file","date_created":"2020-05-14T16:01:29Z","access_level":"open_access","creator":"dernst"}],"year":"2018","type":"conference","ddc":["000"],"publication":"2018 International Conference on Embedded Software","day":"30","_id":"5959","doi":"10.1109/emsoft.2018.8537203","article_processing_charge":"No","conference":{"start_date":"2018-09-30","end_date":"2018-10-05","name":"EMSOFT: Embedded Software","location":"Turin, Italy"},"date_updated":"2025-07-10T11:53:06Z","scopus_import":"1","page":"1-10","status":"public","department":[{"_id":"ToHe"}],"external_id":{"isi":["000492828500005"]},"fulldoi":"https://doi.org/10.1109/emsoft.2018.8537203","oa_version":"Published Version","language":[{"iso":"eng"}],"has_accepted_license":"1","isi":1,"date_created":"2019-02-13T09:19:28Z"},{"type":"book_chapter","oa_version":"None","language":[{"iso":"eng"}],"publication":"Handbook of Model Checking","date_created":"2018-12-11T11:44:25Z","day":"19","date_published":"2018-05-19T00:00:00Z","month":"05","title":"Introduction to model checking","fulldoi":"https://doi.org/10.1007/978-3-319-10575-8_1","year":"2018","editor":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","status":"public","citation":{"ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26.","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.","ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. <i>Handbook of Model Checking</i>. Handbook of Model Checking. Springer; 2018:1-26. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>.","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in <i>Handbook of Model Checking</i>, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>.","apa":"Clarke, E., Henzinger, T. A., &#38; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), <i>Handbook of Model Checking</i> (pp. 1–26). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>"},"department":[{"_id":"ToHe"}],"author":[{"first_name":"Edmund","last_name":"Clarke","full_name":"Clarke, Edmund"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Veith","full_name":"Veith, Helmut","first_name":"Helmut"}],"publist_id":"7994","abstract":[{"lang":"eng","text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking."}],"series_title":"Handbook of Model Checking","doi":"10.1007/978-3-319-10575-8_1","_id":"60","publication_status":"published","page":"1 - 26","date_updated":"2021-01-12T08:05:35Z","scopus_import":1,"quality_controlled":"1"},{"ddc":["000"],"day":"01","intvolume":"       117","type":"conference","year":"2018","month":"08","title":"Timed network games with clocks","file":[{"creator":"dernst","access_level":"open_access","date_created":"2019-02-14T14:22:04Z","relation":"main_file","date_updated":"2020-07-14T12:47:15Z","file_id":"6007","checksum":"41ab2ae9b63f5eb49fa995250c0ba128","file_name":"2018_LIPIcs_Avni.pdf","content_type":"application/pdf","file_size":542889}],"date_published":"2018-08-01T00:00:00Z","abstract":[{"text":"Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load.  Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks.  The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting.","lang":"eng"}],"author":[{"full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","orcid":"0000-0001-5588-8287"},{"last_name":"Guha","full_name":"Guha, Shibashis","first_name":"Shibashis"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"citation":{"apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>","ista":"Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23."},"file_date_updated":"2020-07-14T12:47:15Z","related_material":{"record":[{"relation":"earlier_version","id":"963","status":"public"}]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication_status":"published","publication_identifier":{"issn":["1868-8969"]},"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"oa":1,"has_accepted_license":"1","date_created":"2019-02-14T14:12:09Z","language":[{"iso":"eng"}],"oa_version":"Published Version","volume":117,"alternative_title":["LIPIcs"],"fulldoi":"https://doi.org/10.4230/LIPICS.MFCS.2018.23","department":[{"_id":"ToHe"}],"article_number":"23","status":"public","tmp":{"image":"/images/cc_by.png","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"},"date_updated":"2025-07-10T12:01:59Z","scopus_import":"1","doi":"10.4230/LIPICS.MFCS.2018.23","_id":"6005","article_processing_charge":"No","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","location":"Liverpool, United Kingdom","start_date":"2018-08-27","end_date":"2018-08-31"}},{"has_accepted_license":"1","date_created":"2019-02-14T14:17:54Z","oa_version":"Published Version","language":[{"iso":"eng"}],"volume":9,"fulldoi":"https://doi.org/10.3390/g9030039","article_number":"39","department":[{"_id":"ToHe"}],"status":"public","tmp":{"image":"/images/cc_by.png","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"},"scopus_import":"1","date_updated":"2025-07-10T11:49:38Z","_id":"6006","doi":"10.3390/g9030039","article_processing_charge":"No","issue":"3","ddc":["004"],"publication":"Games","day":"01","type":"journal_article","intvolume":"         9","year":"2018","month":"09","title":"An abstraction-refinement methodology for reasoning about network games","date_published":"2018-09-01T00:00:00Z","file":[{"date_created":"2019-02-14T14:20:31Z","creator":"kschuh","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:47:16Z","file_name":"2018_MDPI_Avni.pdf","checksum":"749d65ca4ce74256a029d9644a1b1cb0","file_id":"6008","file_size":505155,"content_type":"application/pdf"}],"abstract":[{"text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. ","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"1003","relation":"earlier_version"}]},"citation":{"ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. 2018;9(3). doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>, vol. 9, no. 3, 39, MDPI, 2018, doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>. MDPI, 2018. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” <i>Games</i>, vol. 9, no. 3. MDPI, 2018.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. MDPI. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>"},"file_date_updated":"2020-07-14T12:47:16Z","author":[{"last_name":"Avni","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy"},{"last_name":"Guha","full_name":"Guha, Shibashis","first_name":"Shibashis"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"publisher":"MDPI","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication_status":"published","project":[{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"publication_identifier":{"issn":["2073-4336"]},"oa":1},{"date_published":"2018-02-15T00:00:00Z","title":"Synthesis from component libraries with costs","month":"02","year":"2018","intvolume":"       712","article_type":"original","type":"journal_article","day":"15","publication":"Theoretical Computer Science","ddc":["000"],"oa":1,"project":[{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"publication_status":"published","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","author":[{"full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"citation":{"apa":"Avni, G., &#38; Kupferman, O. (2018). Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>","mla":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>, vol. 712, Elsevier, 2018, pp. 50–72, doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>.","ieee":"G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” <i>Theoretical Computer Science</i>, vol. 712. Elsevier, pp. 50–72, 2018.","chicago":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>.","short":"G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.","ama":"Avni G, Kupferman O. Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. 2018;712:50-72. doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>","ista":"Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72."},"corr_author":"1","publist_id":"7197","abstract":[{"text":"Synthesis is the automated construction of a system from its specification. In real life, hardware and software systems are rarely constructed from scratch. Rather, a system is typically constructed from a library of components. Lustig and Vardi formalized this intuition and studied LTL synthesis from component libraries. In real life, designers seek optimal systems. In this paper we add optimality considerations to the setting. We distinguish between quality considerations (for example, size - the smaller a system is, the better it is), and pricing (for example, the payment to the company who manufactured the component). We study the problem of designing systems with minimal quality-cost and price. A key point is that while the quality cost is individual - the choices of a designer are independent of choices made by other designers that use the same library, pricing gives rise to a resource-allocation game - designers that use the same component share its price, with the share being proportional to the number of uses (a component can be used several times in a design). We study both closed and open settings, and in both we solve the problem of finding an optimal design. In a setting with multiple designers, we also study the game-theoretic problems of the induced resource-allocation game.","lang":"eng"}],"fulldoi":"https://doi.org/10.1016/j.tcs.2017.11.001","external_id":{"isi":["000424959200003"]},"volume":712,"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529","open_access":"1"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:47:28Z","isi":1,"ec_funded":1,"article_processing_charge":"No","_id":"608","doi":"10.1016/j.tcs.2017.11.001","page":"50 - 72","date_updated":"2026-06-18T18:58:53Z","scopus_import":"1","status":"public","department":[{"_id":"ToHe"}]}]