--- _id: '15082' abstract: - lang: eng text: "Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n." acknowledgement: Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922. article_number: '56' article_processing_charge: No author: - first_name: Oswin full_name: Aichholzer, Oswin last_name: Aichholzer - first_name: Julia full_name: Obmann, Julia last_name: Obmann - first_name: Pavel full_name: Patak, Pavel id: B593B804-1035-11EA-B4F1-947645A5BB83 last_name: Patak - first_name: Daniel full_name: Perz, Daniel last_name: Perz - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 citation: ama: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.' apa: Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual. chicago: Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020. ieee: O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020. ista: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.' mla: Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020. short: O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020. conference: end_date: 2020-03-18 location: Würzburg, Germany, Virtual name: 'EuroCG: European Workshop on Computational Geometry' start_date: 2020-03-16 date_created: 2024-03-05T08:57:17Z date_published: 2020-04-01T00:00:00Z date_updated: 2024-03-05T09:00:07Z day: '01' department: - _id: KrCh - _id: UlWa language: - iso: eng main_file_link: - open_access: '1' url: https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf month: '04' oa: 1 oa_version: Published Version publication: 36th European Workshop on Computational Geometry publication_status: published quality_controlled: '1' status: public title: Disjoint tree-compatible plane perfect matchings type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7810' abstract: - lang: eng text: "Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries.\r\nIn this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques." alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In: European Symposium on Programming. Vol 12075. Springer Nature; 2020:112-140. doi:10.1007/978-3-030-44914-8_5' apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-44914-8_5' chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5. ieee: K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140. ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.' mla: Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5. short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140. conference: end_date: 2020-04-30 location: Dublin, Ireland name: 'ESOP: Programming Languages and Systems' start_date: 2020-04-25 date_created: 2020-05-10T22:00:50Z date_published: 2020-04-18T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-030-44914-8_5 external_id: isi: - '000681656800005' file: - access_level: open_access checksum: 8618b80f4cf7b39a60e61a6445ad9807 content_type: application/pdf creator: dernst date_created: 2020-05-26T13:34:48Z date_updated: 2020-07-14T12:48:03Z file_id: '7895' file_name: 2020_LNCS_Chatterjee.pdf file_size: 651250 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' intvolume: ' 12075' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 112-140 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies publication: European Symposium on Programming publication_identifier: eissn: - '16113349' isbn: - '9783030449131' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Optimal and perfectly parallel algorithms for on-demand data-flow analysis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 12075 year: '2020' ... --- _id: '8728' abstract: - lang: eng text: Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many techniques for computing these objectives in general MCs/MDPs, they have not been thoroughly studied in terms of parameterized algorithms, particularly when treewidth is used as the parameter. This is in sharp contrast to qualitative objectives for MCs, MDPs and graph games, for which treewidth-based algorithms yield significant complexity improvements. In this work, we show that treewidth can also be used to obtain faster algorithms for the quantitative problems. For an MC with n states and m transitions, we show that each of the classical quantitative objectives can be computed in O((n+m)⋅t2) time, given a tree decomposition of the MC with width t. Our results also imply a bound of O(κ⋅(n+m)⋅t2) for each objective on MDPs, where κ is the number of strategy-iteration refinements required for the given input and objective. Finally, we make an experimental evaluation of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms outperform existing well-established methods by one or more orders of magnitude. alternative_title: - LNCS article_processing_charge: No author: - first_name: Ali full_name: Asadi, Ali last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Kiarash full_name: Mohammadi, Kiarash last_name: Mohammadi - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: Automated Technology for Verification and Analysis. Vol 12302. Springer Nature; 2020:253-270. doi:10.1007/978-3-030-59152-6_14' apa: 'Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14' chicago: Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14. ieee: A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270. ista: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.' mla: Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14. short: A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis, in:, Automated Technology for Verification and Analysis, Springer Nature, 2020, pp. 253–270. conference: end_date: 2020-10-23 location: Hanoi, Vietnam name: 'ATVA: Automated Technology for Verification and Analysis' start_date: 2020-10-19 date_created: 2020-11-06T07:30:05Z date_published: 2020-10-12T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '12' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-030-59152-6_14 external_id: isi: - '000723555700014' file: - access_level: open_access checksum: ae83f27e5b189d5abc2e7514f1b7e1b5 content_type: application/pdf creator: dernst date_created: 2020-11-06T07:41:03Z date_updated: 2020-11-06T07:41:03Z file_id: '8729' file_name: 2020_LNCS_ATVA_Asadi_accepted.pdf file_size: 726648 relation: main_file success: 1 file_date_updated: 2020-11-06T07:41:03Z has_accepted_license: '1' intvolume: ' 12302' isi: 1 language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 253-270 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies publication: Automated Technology for Verification and Analysis publication_identifier: eisbn: - '9783030591526' eissn: - 1611-3349 isbn: - '9783030591519' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 12302 year: '2020' ... --- _id: '8089' abstract: - lang: eng text: "We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize positive polynomials over a semi-algebraic set.\r\n\r\nOn the theoretical side, the worst-case complexity of our approach is subexponential, whereas the worst-case complexity of the previous complete method (Kapur, ACA 2004) is doubly-exponential. Even when restricted to linear invariants, the best previous complexity for complete invariant generation is exponential (Colon et al, CAV 2003). On the practical side, we reduce the invariant generation problem to quadratic programming (QCLP), which is a classical optimization problem with many industrial solvers. We demonstrate the applicability of our approach by providing experimental results on several academic benchmarks. To the best of our knowledge, the only previous invariant generation method that provides completeness guarantees for invariants consisting of polynomial inequalities is (Kapur, ACA 2004), which relies on quantifier elimination and cannot even handle toy programs such as our running example." article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Hongfei full_name: Fu, Hongfei id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87 last_name: Fu - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Ehsan Kafshdar full_name: Goharshady, Ehsan Kafshdar last_name: Goharshady citation: ama: 'Chatterjee K, Fu H, Goharshady AK, Goharshady EK. Polynomial invariant generation for non-deterministic recursive programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:672-687. doi:10.1145/3385412.3385969' apa: 'Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969' chicago: Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385969. ieee: K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial invariant generation for non-deterministic recursive programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 672–687. ista: 'Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.' mla: Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–87, doi:10.1145/3385412.3385969. short: K. Chatterjee, H. Fu, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–687. conference: end_date: 2020-06-20 location: London, United Kingdom name: 'PLDI: Programming Language Design and Implementation' start_date: 2020-06-15 date_created: 2020-07-05T22:00:45Z date_published: 2020-06-11T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '11' department: - _id: KrCh doi: 10.1145/3385412.3385969 external_id: arxiv: - '1902.04373' isi: - '000614622300045' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.04373 month: '06' oa: 1 oa_version: Preprint page: 672-687 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation publication_identifier: isbn: - '9781450376136' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Polynomial invariant generation for non-deterministic recursive programs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '6918' abstract: - lang: eng text: "We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem." acknowledgement: We are grateful to the anonymous reviewers for their comments, which significantly improved the present work. The research was partially supported by the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian Academy of Sciences (ÖAW). article_number: '106665' article_processing_charge: No article_type: original author: - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Fatemeh full_name: Mohammadi, Fatemeh last_name: Mohammadi citation: ama: Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2020;193. doi:10.1016/j.ress.2019.106665 apa: Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665 chicago: Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665. ieee: A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020. ista: Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665. mla: Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665. short: A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020). date_created: 2019-09-29T22:00:44Z date_published: 2020-01-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' department: - _id: KrCh doi: 10.1016/j.ress.2019.106665 external_id: arxiv: - '1712.09692' isi: - '000501641400050' intvolume: ' 193' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.09692 month: '01' oa: 1 oa_version: Preprint project: - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: Reliability Engineering and System Safety publication_identifier: issn: - '09518320' publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: An efficient algorithm for computing network reliability in small treewidth type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 193 year: '2020' ... --- _id: '6887' abstract: - lang: eng text: 'The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ' alternative_title: - LIPIcs article_number: '7' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Svozil, Alexander last_name: Svozil citation: ama: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7' apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7' chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7. ieee: K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140. ista: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.' mla: Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7. short: K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:07:58Z date_published: 2019-08-01T00:00:00Z date_updated: 2022-08-12T10:54:34Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.7 ec_funded: 1 file: - access_level: open_access checksum: e1f0e4061212454574f34a1368d018ec content_type: application/pdf creator: kschuh date_created: 2019-10-01T08:20:30Z date_updated: 2020-07-14T12:47:43Z file_id: '6922' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 730112 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Leibniz International Proceedings in Informatics publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Near-linear time algorithms for Streett objectives in graphs and MDPs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 140 year: '2019' ... --- _id: '6885' abstract: - lang: eng text: 'A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ' alternative_title: - LIPIcs article_number: '27' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27' apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27. ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.' ista: 'Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.' mla: Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:06:14Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:09:27Z day: '01' ddc: - '000' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.27 file: - access_level: open_access checksum: 4985e26e1572d1575d64d38acabd71d6 content_type: application/pdf creator: kschuh date_created: 2019-09-27T12:09:35Z date_updated: 2020-07-14T12:47:43Z file_id: '6914' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 538120 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Long-run average behavior of vector addition systems with states tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2019' ... --- _id: '6889' abstract: - lang: eng text: 'We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ' alternative_title: - LIPIcs article_number: '6' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nir full_name: Piterman, Nir last_name: Piterman citation: ama: 'Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6' apa: 'Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6' chicago: Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6. ieee: 'K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.' ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.' mla: Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6. short: K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:11:43Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:09:28Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.6 file: - access_level: open_access checksum: 7b2ecfd4d9d02360308c0ca986fc10a7 content_type: application/pdf creator: kschuh date_created: 2019-10-01T08:49:45Z date_updated: 2020-07-14T12:47:43Z file_id: '6923' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 509163 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Combinations of Qualitative Winning for Stochastic Parity Games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2019' ... --- _id: '6884' abstract: - lang: eng text: 'In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. 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. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players'' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. ' alternative_title: - LIPIcs article_number: '11' author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic citation: ama: 'Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11' apa: 'Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11' chicago: Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.11. ieee: 'G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.' ista: 'Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.' mla: Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11. short: G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Aachen, Germany name: 'MFCS: nternational Symposium on Mathematical Foundations of Computer Science' start_date: 2019-08-26 date_created: 2019-09-18T08:04:26Z date_published: 2019-08-01T00:00:00Z date_updated: 2023-08-07T14:08:34Z day: '01' ddc: - '004' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPICS.MFCS.2019.11 ec_funded: 1 external_id: arxiv: - '1905.03835' file: - access_level: open_access checksum: 6346e116a4f4ed1414174d96d2c4fbd7 content_type: application/pdf creator: kschuh date_created: 2019-09-27T11:45:15Z date_updated: 2020-07-14T12:47:42Z file_id: '6913' file_name: 2019_LIPIcs_Avni.pdf file_size: 554457 relation: main_file file_date_updated: 2020-07-14T12:47:42Z has_accepted_license: '1' intvolume: ' 138' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '9239' relation: later_version status: public scopus_import: 1 status: public title: Bidding mechanisms in graph games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 138 year: '2019' ... --- _id: '5948' abstract: - lang: eng text: We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs. For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination, whereas our result corrects the previous flaw and establishes completeness with a rigorous proof. Second, we present the first sound approach to establish lower bounds on expected termination time through RSMs. alternative_title: - LNCS article_processing_charge: No author: - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. In: International Conference on Verification, Model Checking, and Abstract Interpretation. Vol 11388. Springer Nature; 2019:468-490. doi:10.1007/978-3-030-11245-5_22' apa: 'Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-11245-5_22' chicago: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-11245-5_22. ieee: H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” in International Conference on Verification, Model Checking, and Abstract Interpretation, Cascais, Portugal, 2019, vol. 11388, pp. 468–490. ista: 'Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.' mla: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” International Conference on Verification, Model Checking, and Abstract Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22. short: H. Fu, K. Chatterjee, in:, International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490. conference: end_date: 2019-01-15 location: Cascais, Portugal name: 'VMCAI: Verification, Model Checking, and Abstract Interpretation' start_date: 2019-01-13 date_created: 2019-02-10T22:59:17Z date_published: 2019-01-11T00:00:00Z date_updated: 2023-08-24T14:42:22Z day: '11' department: - _id: KrCh doi: 10.1007/978-3-030-11245-5_22 external_id: arxiv: - '1701.02944' isi: - '000931943000022' intvolume: ' 11388' isi: 1 language: - iso: eng main_file_link: - url: https://arxiv.org/abs/1701.02944 month: '01' oa_version: Preprint page: 468-490 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: International Conference on Verification, Model Checking, and Abstract Interpretation publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Termination of nondeterministic probabilistic programs type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11388 year: '2019' ... --- _id: '6462' abstract: - lang: eng text: A controller is a device that interacts with a plant. At each time point,it reads the plant’s state and issues commands with the goal that the plant oper-ates optimally. Constructing optimal controllers is a fundamental and challengingproblem. Machine learning techniques have recently been successfully applied totrain controllers, yet they have limitations. Learned controllers are monolithic andhard to reason about. In particular, it is difficult to add features without retraining,to guarantee any level of performance, and to achieve acceptable performancewhen encountering untrained scenarios. These limitations can be addressed bydeploying quantitative run-timeshieldsthat serve as a proxy for the controller.At each time point, the shield reads the command issued by the controller andmay choose to alter it before passing it on to the plant. We show how optimalshields that interfere as little as possible while guaranteeing a desired level ofcontroller performance, can be generated systematically and automatically usingreactive synthesis. First, we abstract the plant by building a stochastic model.Second, we consider the learned controller to be a black box. Third, we mea-surecontroller performanceandshield interferenceby two quantitative run-timemeasures that are formally defined using weighted automata. Then, the problemof constructing a shield that guarantees maximal performance with minimal inter-ference is the problem of finding an optimal strategy in a stochastic2-player game“controller versus shield” played on the abstract state space of the plant with aquantitative objective obtained from combining the performance and interferencemeasures. We illustrate the effectiveness of our approach by automatically con-structing lightweight shields for learned traffic-light controllers in various roadnetworks. The shields we generate avoid liveness bugs, improve controller per-formance in untrained and changing traffic situations, and add features to learnedcontrollers, such as giving priority to emergency vehicles. alternative_title: - LNCS article_processing_charge: No author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Bettina full_name: Konighofer, Bettina last_name: Konighofer - first_name: Stefan full_name: Pranger, Stefan last_name: Pranger citation: ama: 'Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. Run-time optimization for learned controllers through quantitative games. In: 31st International Conference on Computer-Aided Verification. Vol 11561. Springer; 2019:630-649. doi:10.1007/978-3-030-25540-4_36' apa: 'Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., & Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. https://doi.org/10.1007/978-3-030-25540-4_36' chicago: Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.” In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019. https://doi.org/10.1007/978-3-030-25540-4_36. ieee: G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649. ista: 'Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649.' mla: Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.” 31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36. short: G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 630–649. conference: end_date: 2019-07-18 location: New York, NY, United States name: 'CAV: Computer Aided Verification' start_date: 2019-07-13 date_created: 2019-05-16T11:22:30Z date_published: 2019-07-12T00:00:00Z date_updated: 2023-08-25T10:33:27Z day: '12' ddc: - '000' department: - _id: ToHe - _id: KrCh doi: 10.1007/978-3-030-25540-4_36 external_id: isi: - '000491468000036' file: - access_level: open_access checksum: c231579f2485c6fd4df17c9443a4d80b content_type: application/pdf creator: dernst date_created: 2019-08-14T09:35:24Z date_updated: 2020-07-14T12:47:31Z file_id: '6816' file_name: 2019_CAV_Avni.pdf file_size: 659766 relation: main_file file_date_updated: 2020-07-14T12:47:31Z has_accepted_license: '1' intvolume: ' 11561' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 630-649 project: - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: 31st International Conference on Computer-Aided Verification publication_identifier: isbn: - '9783030255398' issn: - 0302-9743 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: Run-time optimization for learned controllers through quantitative games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11561 year: '2019' ... --- _id: '6836' abstract: - lang: eng text: Direct reciprocity is a powerful mechanism for the evolution of cooperation on the basis of repeated interactions1,2,3,4. It requires that interacting individuals are sufficiently equal, such that everyone faces similar consequences when they cooperate or defect. Yet inequality is ubiquitous among humans5,6 and is generally considered to undermine cooperation and welfare7,8,9,10. Most previous models of reciprocity do not include inequality11,12,13,14,15. These models assume that individuals are the same in all relevant aspects. Here we introduce a general framework to study direct reciprocity among unequal individuals. Our model allows for multiple sources of inequality. Subjects can differ in their endowments, their productivities and in how much they benefit from public goods. We find that extreme inequality prevents cooperation. But if subjects differ in productivity, some endowment inequality can be necessary for cooperation to prevail. Our mathematical predictions are supported by a behavioural experiment in which we vary the endowments and productivities of the subjects. We observe that overall welfare is maximized when the two sources of heterogeneity are aligned, such that more productive individuals receive higher endowments. By contrast, when endowments and productivities are misaligned, cooperation quickly breaks down. Our findings have implications for policy-makers concerned with equity, efficiency and the provisioning of public goods. article_processing_charge: No article_type: letter_note author: - first_name: Oliver P. full_name: Hauser, Oliver P. last_name: Hauser - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin A. full_name: Nowak, Martin A. last_name: Nowak citation: ama: Hauser OP, Hilbe C, Chatterjee K, Nowak MA. Social dilemmas among unequals. Nature. 2019;572(7770):524-527. doi:10.1038/s41586-019-1488-5 apa: Hauser, O. P., Hilbe, C., Chatterjee, K., & Nowak, M. A. (2019). Social dilemmas among unequals. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1488-5 chicago: Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.” Nature. Springer Nature, 2019. https://doi.org/10.1038/s41586-019-1488-5. ieee: O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” Nature, vol. 572, no. 7770. Springer Nature, pp. 524–527, 2019. ista: Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527. mla: Hauser, Oliver P., et al. “Social Dilemmas among Unequals.” Nature, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:10.1038/s41586-019-1488-5. short: O.P. Hauser, C. Hilbe, K. Chatterjee, M.A. Nowak, Nature 572 (2019) 524–527. date_created: 2019-09-01T22:00:56Z date_published: 2019-08-22T00:00:00Z date_updated: 2023-08-29T07:42:54Z day: '22' ddc: - '000' department: - _id: KrCh doi: 10.1038/s41586-019-1488-5 ec_funded: 1 external_id: isi: - '000482219600045' file: - access_level: open_access checksum: a6e0e3168bf62de624e7772cdfaeb26f content_type: application/pdf creator: dernst date_created: 2020-05-14T10:00:32Z date_updated: 2020-07-14T12:47:42Z file_id: '7828' file_name: 2019_Nature_Hauser.pdf file_size: 18577756 relation: main_file file_date_updated: 2020-07-14T12:47:42Z has_accepted_license: '1' intvolume: ' 572' isi: 1 issue: '7770' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 524-527 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Nature publication_identifier: eissn: - '14764687' issn: - '00280836' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/too-much-inequality-impedes-support-for-public-goods-according-to-research-published-in-nature/ scopus_import: '1' status: public title: Social dilemmas among unequals type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 572 year: '2019' ... --- _id: '6942' abstract: - lang: eng text: "Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of \U0001D714 -regular winning conditions; e.g., safety, reachability, liveness, parity conditions; provides a robust and expressive specification formalism for properties that arise in analysis of reactive systems. The resolutions of nondeterminism in games and MDPs are represented as strategies, and we consider succinct representation of such strategies. The decision-tree data structure from machine learning retains the flavor of decisions of strategies and allows entropy-based minimization to obtain succinct trees. However, in contrast to traditional machine-learning problems where small errors are allowed, for winning strategies in graph games and MDPs no error is allowed, and the decision tree must represent the entire strategy. In this work we propose decision trees with linear classifiers for representation of strategies in graph games and MDPs. We have implemented strategy representation using this data structure and we present experimental results for problems on graph games and MDPs, which show that this new data structure presents a much more efficient strategy representation as compared to standard decision trees." alternative_title: - LNCS article_processing_charge: No author: - first_name: Pranav full_name: Ashok, Pranav last_name: Ashok - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Jan full_name: Křetínský, Jan last_name: Křetínský - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy representation by decision trees with linear classifiers. In: 16th International Conference on Quantitative Evaluation of Systems. Vol 11785. Springer Nature; 2019:109-128. doi:10.1007/978-3-030-30281-8_7' apa: 'Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., & Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In 16th International Conference on Quantitative Evaluation of Systems (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-30281-8_7' chicago: Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.” In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-30281-8_7. ieee: P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128. ista: 'Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. 2019. Strategy representation by decision trees with linear classifiers. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128.' mla: Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” 16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7. short: P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman, in:, 16th International Conference on Quantitative Evaluation of Systems, Springer Nature, 2019, pp. 109–128. conference: end_date: 2019-09-12 location: Glasgow, United Kingdom name: 'QEST: Quantitative Evaluation of Systems' start_date: 2019-09-10 date_created: 2019-10-14T06:57:49Z date_published: 2019-09-04T00:00:00Z date_updated: 2023-08-30T06:59:36Z day: '04' department: - _id: KrCh - _id: ChLa doi: 10.1007/978-3-030-30281-8_7 external_id: arxiv: - '1906.08178' isi: - '000679281300007' intvolume: ' 11785' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1906.08178 month: '09' oa: 1 oa_version: Preprint page: 109-128 project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: 16th International Conference on Quantitative Evaluation of Systems publication_identifier: eisbn: - '9783030302818' isbn: - '9783030302801' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Strategy representation by decision trees with linear classifiers type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11785 year: '2019' ... --- _id: '7183' abstract: - lang: eng text: 'A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Ω(n2).' alternative_title: - LNCS article_processing_charge: No author: - first_name: Tomás full_name: Brázdil, Tomás last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Antonín full_name: Kucera, Antonín last_name: Kucera - first_name: Petr full_name: Novotný, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotný - first_name: Dominik full_name: Velan, Dominik last_name: Velan citation: ama: 'Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. Deciding fast termination for probabilistic VASS with nondeterminism. In: International Symposium on Automated Technology for Verification and Analysis. Vol 11781. Springer Nature; 2019:462-478. doi:10.1007/978-3-030-31784-3_27' apa: 'Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., & Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In International Symposium on Automated Technology for Verification and Analysis (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. https://doi.org/10.1007/978-3-030-31784-3_27' chicago: Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-31784-3_27. ieee: T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding fast termination for probabilistic VASS with nondeterminism,” in International Symposium on Automated Technology for Verification and Analysis, Taipei, Taiwan, 2019, vol. 11781, pp. 462–478. ista: 'Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478.' mla: Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27. short: T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, D. Velan, in:, International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2019, pp. 462–478. conference: end_date: 2019-10-31 location: Taipei, Taiwan name: 'ATVA: Automated TEchnology for Verification and Analysis' start_date: 2019-10-28 date_created: 2019-12-15T23:00:44Z date_published: 2019-10-21T00:00:00Z date_updated: 2023-09-06T12:40:58Z day: '21' department: - _id: KrCh doi: 10.1007/978-3-030-31784-3_27 external_id: arxiv: - '1907.11010' isi: - '000723515700027' intvolume: ' 11781' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1907.11010 month: '10' oa: 1 oa_version: Preprint page: 462-478 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: International Symposium on Automated Technology for Verification and Analysis publication_identifier: eissn: - '16113349' isbn: - '9783030317836' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Deciding fast termination for probabilistic VASS with nondeterminism type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 11781 year: '2019' ... --- _id: '7210' abstract: - lang: eng text: The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants. But these amplifiers of natural selection typically increase fixation time. Here we study population structures that achieve a tradeoff between fixation probability and time. First, we show that no amplifiers can have an asymptotically lower absorption time than the well-mixed population. Then we design population structures that substantially augment the fixation probability with just a minor increase in fixation time. Finally, we show that those structures enable higher effective rate of evolution than the well-mixed population provided that the rate of generating advantageous mutants is relatively low. Our work sheds light on how population structure affects the rate of evolution. Moreover, our structures could be useful for lab-based, medical, or industrial applications of evolutionary optimization. article_number: '138' article_processing_charge: No article_type: original author: - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin A. full_name: Nowak, Martin A. last_name: Nowak citation: ama: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2019;2. doi:10.1038/s42003-019-0373-y apa: Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-019-0373-y chicago: Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology. Springer Nature, 2019. https://doi.org/10.1038/s42003-019-0373-y. ieee: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” Communications Biology, vol. 2. Springer Nature, 2019. ista: Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138. mla: Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y. short: J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Communications Biology 2 (2019). date_created: 2019-12-23T13:36:50Z date_published: 2019-04-23T00:00:00Z date_updated: 2023-09-07T13:19:22Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.1038/s42003-019-0373-y ec_funded: 1 external_id: isi: - '000465425700006' pmid: - '31044163' file: - access_level: open_access checksum: d1a69bfe73767e4246f0a38e4e1554dd content_type: application/pdf creator: dernst date_created: 2019-12-23T13:39:30Z date_updated: 2020-07-14T12:47:53Z file_id: '7211' file_name: 2019_CommBio_Tkadlec.pdf file_size: 1670274 relation: main_file file_date_updated: 2020-07-14T12:47:53Z has_accepted_license: '1' intvolume: ' 2' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Communications Biology publication_identifier: issn: - 2399-3642 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '7196' relation: part_of_dissertation status: public scopus_import: '1' status: public title: Population structure determines the tradeoff between fixation probability and fixation time tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2 year: '2019' ... --- _id: '10190' abstract: - lang: eng text: 'The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning. In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VCDPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.' acknowledgement: "The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions. This work is supported by the Austrian Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE), by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian Science Fund (FWF) Schrodinger grant J-4220.\r\n" article_number: '124' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550' apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic partial order reduction. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360550' chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550. ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial order reduction,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Athens, Greece, 2019, vol. 3. ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 124.' mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550. short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, 2019. conference: end_date: 2019-10-25 location: Athens, Greece name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications' start_date: 2019-10-23 date_created: 2021-10-27T14:57:06Z date_published: 2019-10-10T00:00:00Z date_updated: 2023-09-07T13:30:27Z day: '10' ddc: - '000' department: - _id: GradSch - _id: KrCh doi: 10.1145/3360550 external_id: arxiv: - '1909.00989' file: - access_level: open_access checksum: 2149979c46964c4d117af06ccb6c0834 content_type: application/pdf creator: cchlebak date_created: 2021-11-12T11:41:56Z date_updated: 2021-11-12T11:41:56Z file_id: '10278' file_name: 2019_ACM_Chatterjee.pdf file_size: 570829 relation: main_file success: 1 file_date_updated: 2021-11-12T11:41:56Z has_accepted_license: '1' intvolume: ' 3' keyword: - safety - risk - reliability and quality - software language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/doi/10.1145/3360550 month: '10' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms publication: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public status: public title: Value-centric dynamic partial order reduction tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 3 year: '2019' ... --- _id: '7402' abstract: - lang: eng text: Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary, to represent the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time. Consequently, our polynomial-time algorithm for adversarial stopping time also computes an optimal plan among all possible plans. article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen citation: ama: 'Chatterjee K, Doyen L. Graph planning with expected finite horizon. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2019:1-13. doi:10.1109/lics.2019.8785706' apa: 'Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706' chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706. ieee: K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” in 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, BC, Canada, 2019, pp. 1–13. ista: 'Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.' mla: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706. short: K. Chatterjee, L. Doyen, in:, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13. conference: end_date: 2019-06-27 location: Vancouver, BC, Canada name: 'LICS: Symposium on Logic in Computer Science' start_date: 2019-06-24 date_created: 2020-01-29T16:18:33Z date_published: 2019-06-01T00:00:00Z date_updated: 2023-09-07T14:48:11Z day: '01' department: - _id: KrCh doi: 10.1109/lics.2019.8785706 external_id: arxiv: - '1802.03642' isi: - '000805002800001' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.03642 month: '06' oa: 1 oa_version: Preprint page: 1-13 publication: 34th Annual ACM/IEEE Symposium on Logic in Computer Science publication_identifier: isbn: - '9781728136080' publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '11402' relation: later_version status: public scopus_import: '1' status: public title: Graph planning with expected finite horizon type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '7950' abstract: - lang: eng text: "The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete. We present some partial results:\r\n1. An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2. Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3. Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2.\r\n3. A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars. In this version, tokens and vertices \ have colours, and colours have weights. The goal is to get every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved." article_number: '1903.06981' article_processing_charge: No author: - first_name: Ahmad full_name: Biniaz, Ahmad last_name: Biniaz - first_name: Kshitij full_name: Jain, Kshitij last_name: Jain - first_name: Anna full_name: Lubiw, Anna last_name: Lubiw - first_name: Zuzana full_name: Masárová, Zuzana id: 45CFE238-F248-11E8-B48F-1D18A9856A87 last_name: Masárová orcid: 0000-0002-6660-1322 - first_name: Tillmann full_name: Miltzow, Tillmann last_name: Miltzow - first_name: Debajyoti full_name: Mondal, Debajyoti last_name: Mondal - first_name: Anurag Murty full_name: Naredla, Anurag Murty last_name: Naredla - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Alexi full_name: Turcotte, Alexi last_name: Turcotte citation: ama: Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv. apa: Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. arXiv. chicago: Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” ArXiv, n.d. ieee: A. Biniaz et al., “Token swapping on trees,” arXiv. . ista: Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981. mla: Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981. short: A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.). date_created: 2020-06-08T12:25:25Z date_published: 2019-03-16T00:00:00Z date_updated: 2024-01-04T12:42:08Z day: '16' department: - _id: HeEd - _id: UlWa - _id: KrCh external_id: arxiv: - '1903.06981' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.06981 month: '03' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted related_material: record: - id: '7944' relation: dissertation_contains status: public - id: '12833' relation: later_version status: public status: public title: Token swapping on trees type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6780' abstract: - lang: eng text: "In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property" article_number: '129' article_processing_charge: No author: - first_name: Mingzhang full_name: Huang, Mingzhang last_name: Huang - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 citation: ama: 'Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Vol 3. ACM; 2019. doi:10.1145/3360555' apa: 'Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555' chicago: Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555. ieee: M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece, 2019, vol. 3. ista: 'Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.' mla: Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555. short: M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019. conference: end_date: 2019-10-25 location: Athens, Greece name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications' start_date: 2019-10-23 date_created: 2019-08-09T09:54:20Z date_published: 2019-10-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1145/3360555 ec_funded: 1 external_id: arxiv: - '1901.06087' file: - access_level: open_access checksum: 3482d8ace6fb4991eb7810e3b70f1b9f content_type: application/pdf creator: akafshda date_created: 2019-08-12T15:40:57Z date_updated: 2020-07-14T12:47:40Z file_id: '6807' file_name: oopsla-2019.pdf file_size: 1024643 relation: main_file - access_level: open_access checksum: 4e5a6fb2b59a75222a4e8335a5a60eac content_type: application/pdf creator: dernst date_created: 2020-05-12T15:15:14Z date_updated: 2020-07-14T12:47:40Z file_id: '7821' file_name: 2019_ACM_Huang.pdf file_size: 538579 relation: main_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' intvolume: ' 3' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '10' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: 'Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ' publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public status: public title: Modular verification for almost-sure termination of probabilistic programs tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 3 year: '2019' ... --- _id: '6380' abstract: - lang: eng text: 'There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. ' article_number: '53' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Nastaran full_name: Okati, Nastaran last_name: Okati - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL). doi:10.1145/3290366 apa: Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366 chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366. ieee: K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019. ista: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53. mla: Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366. short: K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019). date_created: 2019-05-06T12:18:17Z date_published: 2019-01-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.1145/3290366 ec_funded: 1 file: - access_level: open_access checksum: c157752f96877b36685ad7063ada4524 content_type: application/pdf creator: dernst date_created: 2019-05-06T12:23:11Z date_updated: 2020-07-14T12:47:29Z file_id: '6381' file_name: 2019_ACM_POPL_Chatterjee.pdf file_size: 1294962 relation: main_file file_date_updated: 2020-07-14T12:47:29Z has_accepted_license: '1' intvolume: ' 3' issue: POPL language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Proceedings of the ACM on Programming Languages publication_identifier: issn: - 2475-1421 publication_status: published publisher: ACM pubrep_id: '1056' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public status: public title: Efficient parameterized algorithms for data packing tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2019' ... --- _id: '6056' abstract: - lang: eng text: In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs. article_number: '8751326' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Arash full_name: Pourdamghani, Arash last_name: Pourdamghani citation: ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: IEEE International Conference on Blockchain and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326' apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326' chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.' ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019.' ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.' mla: 'Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.' short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019. conference: end_date: 2019-05-17 location: Seoul, Korea name: IEEE International Conference on Blockchain and Cryptocurrency start_date: 2019-05-14 date_created: 2019-02-26T09:03:15Z date_published: 2019-05-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' department: - _id: KrCh doi: 10.1109/BLOC.2019.8751326 ec_funded: 1 external_id: arxiv: - '1902.07986' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.07986 month: '05' oa: 1 oa_version: Preprint project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies publication: IEEE International Conference on Blockchain and Cryptocurrency publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: 1 status: public title: 'Probabilistic smart contracts: Secure randomness on the blockchain' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6378' abstract: - lang: eng text: 'In today''s cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner''s chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Arash full_name: Pourdamghani, Arash last_name: Pourdamghani citation: ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381. doi:10.1145/3297280.3297319' apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319' chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.' ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.' ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.' mla: 'Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.' short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381. conference: end_date: 2019-04-12 location: Limassol, Cyprus name: ACM Symposium on Applied Computing start_date: 2019-04-08 date_created: 2019-05-06T12:11:36Z date_published: 2019-04-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.1145/3297280.3297319 ec_funded: 1 external_id: isi: - '000474685800049' file: - access_level: open_access checksum: fbfbcd5a0c7a743862bfc3045539a614 content_type: application/pdf creator: dernst date_created: 2019-05-06T12:09:27Z date_updated: 2020-07-14T12:47:29Z file_id: '6379' file_name: 2019_ACM_Chatterjee.pdf file_size: 1023934 relation: main_file file_date_updated: 2020-07-14T12:47:29Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Submitted Version page: 374-381 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Proceedings of the 34th ACM Symposium on Applied Computing publication_identifier: isbn: - '9781450359337' publication_status: published publisher: ACM pubrep_id: '1069' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving' type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: Part F147772 year: '2019' ... --- _id: '6175' abstract: - lang: eng text: "We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds." article_processing_charge: No author: - first_name: Peixin full_name: Wang, Peixin last_name: Wang - first_name: Hongfei full_name: Fu, Hongfei id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87 last_name: Fu - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Xudong full_name: Qin, Xudong last_name: Qin - first_name: Wenjun full_name: Shi, Wenjun last_name: Shi citation: ama: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581' apa: 'Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581' chicago: 'Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.' ieee: 'P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.' ista: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.' mla: 'Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.' short: 'P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220.' conference: end_date: 2019-06-26 location: Phoenix, AZ, United States name: 'PLDI: Conference on Programming Language Design and Implementation' start_date: 2019-06-22 date_created: 2019-03-25T10:13:25Z date_published: 2019-06-08T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '08' ddc: - '000' department: - _id: KrCh doi: 10.1145/3314221.3314581 ec_funded: 1 external_id: arxiv: - '1902.04659' isi: - '000523190300014' file: - access_level: open_access checksum: 703a5e9b8c8587f2a44085ffd9a4db64 content_type: application/pdf creator: akafshda date_created: 2019-03-25T10:11:22Z date_updated: 2020-07-14T12:47:20Z file_id: '6176' file_name: paper.pdf file_size: 4051066 relation: main_file file_date_updated: 2020-07-14T12:47:20Z has_accepted_license: '1' isi: 1 keyword: - Program Cost Analysis - Program Termination - Probabilistic Programs - Martingales language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 204-220 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: 'PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '5457' relation: earlier_version status: public - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Cost analysis of nondeterministic probabilistic programs type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2019' ... --- _id: '6490' abstract: - lang: eng text: "Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.\r\n\r\nTwo classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.\r\n" article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Ehsan Kafshdar full_name: Goharshady, Ehsan Kafshdar last_name: Goharshady citation: ama: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :400-408. doi:10.1145/3297280.3297322' apa: 'Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322' chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322. ieee: K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 400–408. ista: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.' mla: Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 400–08, doi:10.1145/3297280.3297322. short: K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408. conference: end_date: 2019-04-12 location: Limassol, Cyprus name: 'SAC: Symposium on Applied Computing' start_date: 2019-04-08 date_created: 2019-05-26T21:59:15Z date_published: 2019-04-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1145/3297280.3297322 external_id: isi: - '000474685800052' file: - access_level: open_access checksum: dddc20f6d9881f23b8755eb720ec9d6f content_type: application/pdf creator: dernst date_created: 2020-05-14T09:50:11Z date_updated: 2020-07-14T12:47:32Z file_id: '7827' file_name: 2019_ACM_Chatterjee.pdf file_size: 6937138 relation: main_file file_date_updated: 2020-07-14T12:47:32Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Submitted Version page: 400-408 publication: Proceedings of the 34th ACM Symposium on Applied Computing publication_identifier: isbn: - '9781450359337' publication_status: submitted publisher: ACM pubrep_id: '1070' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: The treewidth of smart contracts type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: Part F147772 year: '2019' ... --- _id: '7158' abstract: - lang: eng text: "Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n" article_number: '23' article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Prateesh full_name: Goyal, Prateesh last_name: Goyal - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: ama: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525 apa: Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525 chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525. ieee: K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019. ista: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23. mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525. short: K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019). date_created: 2019-12-09T08:33:33Z date_published: 2019-11-01T00:00:00Z date_updated: 2024-03-27T23:30:34Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1145/3363525 ec_funded: 1 external_id: isi: - '000564108400004' file: - access_level: open_access checksum: 291cc86a07bd010d4815e177dac57b70 content_type: application/pdf creator: dernst date_created: 2020-10-08T12:58:10Z date_updated: 2020-10-08T12:58:10Z file_id: '8632' file_name: 2019_ACMTransactions_Chatterjee.pdf file_size: 667357 relation: main_file success: 1 file_date_updated: 2020-10-08T12:58:10Z has_accepted_license: '1' intvolume: ' 41' isi: 1 issue: '4' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: ACM Transactions on Programming Languages and Systems publication_identifier: issn: - 0164-0925 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 41 year: '2019' ... --- _id: '7014' abstract: - lang: eng text: "We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms." article_number: '20' article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 citation: ama: Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3339984 apa: Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984 chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984. ieee: K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019. ista: Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20. mla: Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984. short: K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019). date_created: 2019-11-13T08:33:43Z date_published: 2019-10-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' department: - _id: KrCh doi: 10.1145/3339984 ec_funded: 1 external_id: arxiv: - '1705.00317' isi: - '000564108400001' intvolume: ' 41' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1705.00317 month: '10' oa: 1 oa_version: Preprint project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: ACM Transactions on Programming Languages and Systems publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '639' relation: earlier_version status: public - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Non-polynomial worst-case analysis of recursive programs type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 41 year: '2019' ... --- _id: '10883' abstract: - lang: eng text: 'Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.' acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.' alternative_title: - EPiC Series in Computing article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvořák, Wolfgang last_name: Dvořák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Svozil, Alexander last_name: Svozil citation: ama: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k' apa: 'Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k' chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k. ieee: K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253. ista: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.' mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k. short: K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253. conference: end_date: 2018-11-21 location: Awassa, Ethiopia name: 'LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning' start_date: 2018-11-17 date_created: 2022-03-18T12:46:32Z date_published: 2018-10-23T00:00:00Z date_updated: 2022-07-29T09:24:31Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.29007/5z5k ec_funded: 1 external_id: arxiv: - '1909.04983' file: - access_level: open_access checksum: 1229aa8640bd6db610c85decf2265480 content_type: application/pdf creator: dernst date_created: 2022-05-17T07:51:08Z date_updated: 2022-05-17T07:51:08Z file_id: '11392' file_name: 2018_EPiCs_Chatterjee.pdf file_size: 720893 relation: main_file success: 1 file_date_updated: 2022-05-17T07:51:08Z has_accepted_license: '1' intvolume: ' 57' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 233-253 project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning publication_identifier: issn: - 2398-7340 publication_status: published publisher: EasyChair quality_controlled: '1' scopus_import: '1' status: public title: Quasipolynomial set-based symbolic algorithms for parity games type: conference user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 57 year: '2018' ... --- _id: '325' abstract: - lang: eng text: Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach. article_number: '34' author: - first_name: Sheshansh full_name: Agrawal, Sheshansh last_name: Agrawal - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny citation: ama: 'Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122' apa: 'Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122' chicago: 'Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.' ieee: 'S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.' ista: 'Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.' mla: 'Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.' short: S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018. conference: end_date: 2018-01-13 location: Los Angeles, CA, USA name: 'POPL: Principles of Programming Languages' start_date: 2018-01-07 date_created: 2018-12-11T11:45:50Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T07:42:07Z day: '01' department: - _id: KrCh doi: 10.1145/3158122 external_id: arxiv: - '1709.04037' intvolume: ' 2' issue: POPL language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1709.04037 month: '01' oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: ACM publist_id: '7540' quality_controlled: '1' status: public title: 'Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2018' ... --- _id: '59' abstract: - lang: eng text: Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches. author: - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Barbara full_name: Jobstmann, Barbara last_name: Jobstmann citation: ama: 'Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27' apa: Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27 chicago: Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27. ieee: R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962. ista: 'Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.' mla: Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27. short: R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962. date_created: 2018-12-11T11:44:24Z date_published: 2018-05-19T00:00:00Z date_updated: 2021-01-12T08:05:10Z day: '19' department: - _id: KrCh doi: 10.1007/978-3-319-10575-8_27 edition: '1' editor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Edmund M. full_name: Clarke, Edmund M. last_name: Clarke - first_name: Helmut full_name: Veith, Helmut last_name: Veith - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem language: - iso: eng month: '05' oa_version: None page: 921 - 962 publication: Handbook of Model Checking publication_identifier: isbn: - 978-3-319-10574-1 publication_status: published publisher: Springer publist_id: '7995' quality_controlled: '1' scopus_import: 1 status: public title: Graph games and reactive synthesis type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '86' abstract: - lang: eng text: Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms. acknowledgement: 'This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer; 2018:143-161. doi:10.1007/978-3-319-95246-8_9' apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9 chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9. ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161. ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.' mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161. date_created: 2018-12-11T11:44:33Z date_published: 2018-07-20T00:00:00Z date_updated: 2021-01-12T08:20:14Z day: '20' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-95246-8_9 ec_funded: 1 editor: - first_name: Marten full_name: Lohstroh, Marten last_name: Lohstroh - first_name: Patricia full_name: Derler, Patricia last_name: Derler - first_name: Marjan full_name: Sirjani, Marjan last_name: Sirjani file: - access_level: open_access checksum: 9995c6ce6957333baf616fc4f20be597 content_type: application/pdf creator: dernst date_created: 2019-11-19T08:22:18Z date_updated: 2020-07-14T12:48:14Z file_id: '7053' file_name: 2018_PrinciplesModeling_Chatterjee.pdf file_size: 516307 relation: main_file file_date_updated: 2020-07-14T12:48:14Z has_accepted_license: '1' intvolume: ' 10760' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 143 - 161 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Principles of Modeling publication_status: published publisher: Springer publist_id: '7968' quality_controlled: '1' scopus_import: 1 status: public title: Computing average response time type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10760 year: '2018' ... --- _id: '454' abstract: - lang: eng text: Direct reciprocity is a mechanism for cooperation among humans. Many of our daily interactions are repeated. We interact repeatedly with our family, friends, colleagues, members of the local and even global community. In the theory of repeated games, it is a tacit assumption that the various games that a person plays simultaneously have no effect on each other. Here we introduce a general framework that allows us to analyze “crosstalk” between a player’s concurrent games. In the presence of crosstalk, the action a person experiences in one game can alter the person’s decision in another. We find that crosstalk impedes the maintenance of cooperation and requires stronger levels of forgiveness. The magnitude of the effect depends on the population structure. In more densely connected social groups, crosstalk has a stronger effect. A harsh retaliator, such as Tit-for-Tat, is unable to counteract crosstalk. The crosstalk framework provides a unified interpretation of direct and upstream reciprocity in the context of repeated games. acknowledgement: "This work was supported by the European Research Council (ERC) start grant 279307: Graph Games (C.K.), Austrian Science Fund (FWF) grant no P23499-N23 (C.K.), FWF\r\nNFN grant no S11407-N23 RiSE/SHiNE (C.K.), Office of Naval Research grant N00014-16-1-2914 (M.A.N.), National Cancer Institute grant CA179991 (M.A.N.) and by the John Templeton Foundation. J.G.R. is supported by an Erwin Schrödinger fellowship\r\n(Austrian Science Fund FWF J-3996). C.H. acknowledges generous support from the\r\nISTFELLOW program. The Program for Evolutionary Dynamics is supported in part by\r\na gift from B Wu and Eric Larson." article_number: '555' article_processing_charge: No author: - first_name: Johannes full_name: Reiter, Johannes id: 4A918E98-F248-11E8-B48F-1D18A9856A87 last_name: Reiter orcid: 0000-0002-0170-7353 - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: David full_name: Rand, David last_name: Rand - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: ama: Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 2018;9(1). doi:10.1038/s41467-017-02721-8 apa: Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-02721-8 chicago: Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8. ieee: J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018. ista: Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555. mla: Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8. short: J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications 9 (2018). date_created: 2018-12-11T11:46:34Z date_published: 2018-02-07T00:00:00Z date_updated: 2023-09-11T12:51:03Z day: '07' ddc: - '004' department: - _id: KrCh doi: 10.1038/s41467-017-02721-8 ec_funded: 1 external_id: isi: - '000424318200001' file: - access_level: open_access checksum: b6b90367545b4c615891c960ab0567f1 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:18Z date_updated: 2020-07-14T12:46:31Z file_id: '4741' file_name: IST-2018-964-v1+1_2018_Hilbe_Crosstalk_in.pdf file_size: 843646 relation: main_file file_date_updated: 2020-07-14T12:46:31Z has_accepted_license: '1' intvolume: ' 9' isi: 1 issue: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Nature Communications publication_status: published publisher: Nature Publishing Group publist_id: '7368' pubrep_id: '964' quality_controlled: '1' scopus_import: '1' status: public title: Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 9 year: '2018' ... --- _id: '143' abstract: - lang: eng text: 'Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. We also show that if the complexity of a VASS is not linear, it is at least quadratic. Second, we classify VASS according to quantitative properties of their cycles. We show that certain singularities in these properties are the key reason for non-polynomial asymptotic complexity of VASS. In absence of singularities, we show that the asymptotic complexity is always polynomial and of the form Θ(nk), for some integer k d, where d is the dimension of the VASS. We present a polynomial-time algorithm computing the optimal k. For general VASS, the same algorithm, which is based on a complete technique for the construction of ranking functions in VASS, produces a valid lower bound, i.e., a k such that the termination complexity is (nk). Our results are based on new insights into the geometry of VASS dynamics, which hold the potential for further applicability to VASS analysis.' alternative_title: - ACM/IEEE Symposium on Logic in Computer Science article_processing_charge: No author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny - first_name: Dominik full_name: Velan, Dominik last_name: Velan - first_name: Florian full_name: Zuleger, Florian last_name: Zuleger citation: ama: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033. IEEE; 2018:185-194. doi:10.1145/3209108.3209191' apa: 'Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191' chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191. ieee: 'T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.' ista: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.' mla: Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191. short: T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194. conference: end_date: 2018-07-12 location: Oxford, United Kingdom name: 'LICS: Logic in Computer Science' start_date: 2018-07-09 date_created: 2018-12-11T11:44:51Z date_published: 2018-07-09T00:00:00Z date_updated: 2023-09-11T13:23:42Z day: '09' department: - _id: KrCh doi: 10.1145/3209108.3209191 ec_funded: 1 external_id: isi: - '000545262800020' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.10985 month: '07' oa: 1 oa_version: Preprint page: 185 - 194 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_identifier: isbn: - 978-1-4503-5583-4 publication_status: published publisher: IEEE publist_id: '7780' quality_controlled: '1' scopus_import: '1' status: public title: Efficient algorithms for asymptotic bounds on termination time in VASS type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: F138033 year: '2018' ... --- _id: '157' abstract: - lang: eng text: 'Social dilemmas occur when incentives for individuals are misaligned with group interests 1-7 . According to the ''tragedy of the commons'', these misalignments can lead to overexploitation and collapse of public resources. The resulting behaviours can be analysed with the tools of game theory 8 . The theory of direct reciprocity 9-15 suggests that repeated interactions can alleviate such dilemmas, but previous work has assumed that the public resource remains constant over time. Here we introduce the idea that the public resource is instead changeable and depends on the strategic choices of individuals. An intuitive scenario is that cooperation increases the public resource, whereas defection decreases it. Thus, cooperation allows the possibility of playing a more valuable game with higher payoffs, whereas defection leads to a less valuable game. We analyse this idea using the theory of stochastic games 16-19 and evolutionary game theory. We find that the dependence of the public resource on previous interactions can greatly enhance the propensity for cooperation. For these results, the interaction between reciprocity and payoff feedback is crucial: neither repeated interactions in a constant environment nor single interactions in a changing environment yield similar cooperation rates. Our framework shows which feedbacks between exploitation and environment - either naturally occurring or designed - help to overcome social dilemmas.' acknowledgement: "European Research Council Start Grant 279307, Austrian Science Fund (FWF) grant P23499-N23, \r\nC.H. acknowledges support from the ISTFELLOW programme." article_processing_charge: No author: - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Štepán full_name: Šimsa, Štepán last_name: Šimsa - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: ama: Hilbe C, Šimsa Š, Chatterjee K, Nowak M. Evolution of cooperation in stochastic games. Nature. 2018;559(7713):246-249. doi:10.1038/s41586-018-0277-x apa: Hilbe, C., Šimsa, Š., Chatterjee, K., & Nowak, M. (2018). Evolution of cooperation in stochastic games. Nature. Nature Publishing Group. https://doi.org/10.1038/s41586-018-0277-x chicago: Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” Nature. Nature Publishing Group, 2018. https://doi.org/10.1038/s41586-018-0277-x. ieee: C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” Nature, vol. 559, no. 7713. Nature Publishing Group, pp. 246–249, 2018. ista: Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249. mla: Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.” Nature, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:10.1038/s41586-018-0277-x. short: C. Hilbe, Š. Šimsa, K. Chatterjee, M. Nowak, Nature 559 (2018) 246–249. date_created: 2018-12-11T11:44:56Z date_published: 2018-07-04T00:00:00Z date_updated: 2023-09-11T13:43:22Z day: '04' ddc: - '000' department: - _id: KrCh doi: 10.1038/s41586-018-0277-x ec_funded: 1 external_id: isi: - '000438240900054' file: - access_level: open_access checksum: 011ab905cf9a410bc2b96f15174d654d content_type: application/pdf creator: dernst date_created: 2019-11-19T08:09:57Z date_updated: 2020-07-14T12:45:02Z file_id: '7049' file_name: 2018_Nature_Hilbe.pdf file_size: 2834442 relation: main_file file_date_updated: 2020-07-14T12:45:02Z has_accepted_license: '1' intvolume: ' 559' isi: 1 issue: '7713' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 246 - 249 project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Nature publication_status: published publisher: Nature Publishing Group publist_id: '7764' quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/engineering-cooperation/ scopus_import: '1' status: public title: Evolution of cooperation in stochastic games type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 559 year: '2018' ... --- _id: '310' abstract: - lang: eng text: A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and coliveness. Our lower bounds are linear in the number of vertices of the graph, even for constant-diameter graphs. For none of these problems lower bounds on the number of symbolic operations were known before. The lower bounds show an interesting separation of these problems from the reachability problem, which can be solved with O(D) symbolic operations, where D is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires Õ(n/D) symbolic steps to achieve a (1 +ϵ)-approximation for any constant > 0. This compares to O(n/D) symbolic steps for the (naive) exact algorithm and O(D) symbolic steps for a 2-approximation. Finally we also give a refined analysis of the strongly connected components algorithms of [15], showing that it uses an optimal number of symbolic steps that is proportional to the sum of the diameters of the strongly connected components. article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer citation: ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. In: ACM; 2018:2341-2356. doi:10.1137/1.9781611975031.151' apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. https://doi.org/10.1137/1.9781611975031.151' chicago: 'Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.' ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.' ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.' mla: 'Chatterjee, Krishnendu, et al. Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. ACM, 2018, pp. 2341–56, doi:10.1137/1.9781611975031.151.' short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356. conference: end_date: 2018-01-10 location: New Orleans, Louisiana, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2018-01-07 date_created: 2018-12-11T11:45:45Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-09-13T08:50:16Z day: '01' department: - _id: KrCh doi: 10.1137/1.9781611975031.151 ec_funded: 1 external_id: arxiv: - '1711.09148' isi: - '000483921200152' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.09148 month: '01' oa: 1 oa_version: Preprint page: 2341 - 2356 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication_status: published publisher: ACM publist_id: '7555' quality_controlled: '1' scopus_import: '1' status: public title: 'Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter' type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5679' abstract: - lang: eng text: We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can handle. Finally, we discuss algorithmic approaches for the two above methods that lead to automated analysis techniques for almost-sure termination of probabilistic programs. alternative_title: - LNCS article_processing_charge: No author: - first_name: Mingzhang full_name: Huang, Mingzhang last_name: Huang - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:10.1007/978-3-030-02768-1_11' apa: 'Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11' chicago: Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11. ieee: M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201. ista: Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201. mla: Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:10.1007/978-3-030-02768-1_11. short: M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201. conference: end_date: 2018-12-06 location: Wellington, New Zealand name: 16th Asian Symposium on Programming Languages and Systems, APLAS start_date: 2018-12-02 date_created: 2018-12-16T22:59:20Z date_published: 2018-12-01T00:00:00Z date_updated: 2023-09-13T09:02:22Z day: '01' department: - _id: KrCh doi: 10.1007/978-3-030-02768-1_11 editor: - first_name: Sukyoung full_name: Ryu, Sukyoung last_name: Ryu external_id: arxiv: - '1806.06683' isi: - '000916310900011' intvolume: ' 11275' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1806.06683 month: '12' oa: 1 oa_version: Preprint page: 181-201 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication_identifier: isbn: - '9783030027674' issn: - '03029743' publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: New approaches for almost-sure termination of probabilistic programs type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 11275 year: '2018' ... --- _id: '419' abstract: - lang: eng text: 'Reciprocity is a major factor in human social life and accounts for a large part of cooperation in our communities. Direct reciprocity arises when repeated interactions occur between the same individuals. The framework of iterated games formalizes this phenomenon. Despite being introduced more than five decades ago, the concept keeps offering beautiful surprises. Recent theoretical research driven by new mathematical tools has proposed a remarkable dichotomy among the crucial strategies: successful individuals either act as partners or as rivals. Rivals strive for unilateral advantages by applying selfish or extortionate strategies. Partners aim to share the payoff for mutual cooperation, but are ready to fight back when being exploited. Which of these behaviours evolves depends on the environment. Whereas small population sizes and a limited number of rounds favour rivalry, partner strategies are selected when populations are large and relationships stable. Only partners allow for evolution of cooperation, while the rivals’ attempt to put themselves first leads to defection. Hilbe et al. synthesize recent theoretical work on zero-determinant and ‘rival’ versus ‘partner’ strategies in social dilemmas. They describe the environments under which these contrasting selfish or cooperative strategies emerge in evolution.' article_processing_charge: No article_type: review author: - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: ama: Hilbe C, Chatterjee K, Nowak M. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2018;2:469–477. doi:10.1038/s41562-018-0320-9 apa: Hilbe, C., Chatterjee, K., & Nowak, M. (2018). Partners and rivals in direct reciprocity. Nature Human Behaviour. Nature Publishing Group. https://doi.org/10.1038/s41562-018-0320-9 chicago: Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0320-9. ieee: C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 469–477, 2018. ista: Hilbe C, Chatterjee K, Nowak M. 2018. Partners and rivals in direct reciprocity. Nature Human Behaviour. 2, 469–477. mla: Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9. short: C. Hilbe, K. Chatterjee, M. Nowak, Nature Human Behaviour 2 (2018) 469–477. date_created: 2018-12-11T11:46:22Z date_published: 2018-03-19T00:00:00Z date_updated: 2023-09-13T09:38:54Z day: '19' ddc: - '000' department: - _id: KrCh doi: 10.1038/s41562-018-0320-9 ec_funded: 1 external_id: isi: - '000446612000016' file: - access_level: open_access checksum: 571b8cc0ba14e8d5d8b18e439a9835eb content_type: application/pdf creator: dernst date_created: 2019-11-19T08:19:51Z date_updated: 2020-07-14T12:46:25Z file_id: '7052' file_name: 2018_NatureHumanBeh_Hilbe.pdf file_size: 598033 relation: main_file file_date_updated: 2020-07-14T12:46:25Z has_accepted_license: '1' intvolume: ' 2' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 469–477 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Nature Human Behaviour publication_status: published publisher: Nature Publishing Group publist_id: '7404' quality_controlled: '1' related_material: link: - relation: erratum url: http://doi.org/10.1038/s41562-018-0342-3 scopus_import: '1' status: public title: Partners and rivals in direct reciprocity type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2 year: '2018' ... --- _id: '79' abstract: - lang: eng text: 'Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Sebastian full_name: Arming, Sebastian last_name: Arming - first_name: Ezio full_name: Bartocci, Ezio last_name: Bartocci - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Joost P full_name: Katoen, Joost P id: 4524F760-F248-11E8-B48F-1D18A9856A87 last_name: Katoen - first_name: Ana full_name: Sokolova, Ana last_name: Sokolova citation: ama: 'Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:10.1007/978-3-319-99154-2_4' apa: 'Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4' chicago: Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4. ieee: 'S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.' ista: 'Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.' mla: Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4. short: S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70. conference: end_date: 2018-09-07 location: Beijing, China name: 'QEST: Quantitative Evaluation of Systems' start_date: 2018-09-04 date_created: 2018-12-11T11:44:31Z date_published: 2018-08-15T00:00:00Z date_updated: 2023-09-13T09:38:28Z day: '15' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-99154-2_4 external_id: arxiv: - '1806.05126' isi: - '000548912200004' intvolume: ' 11024' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1806.05126 month: '08' oa: 1 oa_version: Preprint page: 53-70 publication_status: published publisher: Springer publist_id: '7975' quality_controlled: '1' scopus_import: '1' status: public title: Parameter-independent strategies for pMDPs via POMDPs type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 11024 year: '2018' ... --- _id: '297' 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. alternative_title: - LNCS article_processing_charge: No author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21' apa: 'Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21' chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21. ieee: 'T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.' 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.' mla: Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21. short: T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp. 385–407. conference: end_date: 2018-04-20 location: Thessaloniki, Greece name: 'TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2018-04-14 date_created: 2018-12-11T11:45:41Z date_published: 2018-04-12T00:00:00Z date_updated: 2023-09-19T09:57:08Z day: '12' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-89960-2_21 ec_funded: 1 external_id: isi: - '000546326300021' file: - access_level: open_access checksum: b13874ffb114932ad9cc2586b7469db4 content_type: application/pdf creator: dernst date_created: 2018-12-17T16:29:08Z date_updated: 2020-07-14T12:45:57Z file_id: '5723' file_name: 2018_LNCS_Brazdil.pdf file_size: 1829940 relation: main_file file_date_updated: 2020-07-14T12:45:57Z has_accepted_license: '1' intvolume: ' 10805' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 385 - 407 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_status: published publisher: Springer publist_id: '7584' quality_controlled: '1' scopus_import: '1' status: public title: Strategy representation by decision trees in reactive synthesis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10805 year: '2018' ... --- _id: '141' abstract: - lang: eng text: 'Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples.' acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer - first_name: Simin full_name: Oraee, Simin last_name: Oraee - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13' apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13' chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13. ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.' ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.' mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13. short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197. conference: end_date: 2018-07-17 location: Oxford, United Kingdom name: 'CAV: Computer Aided Verification' start_date: 2018-07-14 date_created: 2018-12-11T11:44:51Z date_published: 2018-07-18T00:00:00Z date_updated: 2023-09-19T09:59:55Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-319-96142-2_13 ec_funded: 1 external_id: isi: - '000491469700013' file: - access_level: open_access checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc content_type: application/pdf creator: dernst date_created: 2018-12-18T08:52:38Z date_updated: 2020-07-14T12:44:53Z file_id: '5737' file_name: 2018_LNCS_Chatterjee.pdf file_size: 675606 relation: main_file file_date_updated: 2020-07-14T12:44:53Z has_accepted_license: '1' intvolume: ' 10982' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 178-197 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_status: published publisher: Springer publist_id: '7782' quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: Symbolic algorithms for graphs and Markov decision processes with fairness objectives tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10982 year: '2018' ... --- _id: '293' abstract: - lang: eng text: People sometimes make their admirable deeds and accomplishments hard to spot, such as by giving anonymously or avoiding bragging. Such ‘buried’ signals are hard to reconcile with standard models of signalling or indirect reciprocity, which motivate costly pro-social behaviour by reputational gains. To explain these phenomena, we design a simple game theory model, which we call the signal-burying game. This game has the feature that senders can bury their signal by deliberately reducing the probability of the signal being observed. If the signal is observed, however, it is identified as having been buried. We show under which conditions buried signals can be maintained, using static equilibrium concepts and calculations of the evolutionary dynamics. We apply our analysis to shed light on a number of otherwise puzzling social phenomena, including modesty, anonymous donations, subtlety in art and fashion, and overeagerness. acknowledgement: This work was supported by a grant from the John Templeton Foundation and by the Office of Naval Research Grant N00014-16-1-2914 (M.A.N.). C.H. acknowledges generous support from the ISTFELLOW programme and by the Schrödinger scholarship of the Austrian Science Fund (FWF) J3475. article_processing_charge: No article_type: original author: - first_name: Moshe full_name: Hoffman, Moshe last_name: Hoffman - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: ama: Hoffman M, Hilbe C, Nowak M. The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. 2018;2:397-404. doi:10.1038/s41562-018-0354-z apa: Hoffman, M., Hilbe, C., & Nowak, M. (2018). The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. Nature Publishing Group. https://doi.org/10.1038/s41562-018-0354-z chicago: Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0354-z. ieee: M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why we obscure positive traits and good deeds,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 397–404, 2018. ista: Hoffman M, Hilbe C, Nowak M. 2018. The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. 2, 397–404. mla: Hoffman, Moshe, et al. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 397–404, doi:10.1038/s41562-018-0354-z. short: M. Hoffman, C. Hilbe, M. Nowak, Nature Human Behaviour 2 (2018) 397–404. date_created: 2018-12-11T11:45:39Z date_published: 2018-05-28T00:00:00Z date_updated: 2023-09-19T10:12:03Z day: '28' ddc: - '000' department: - _id: KrCh doi: 10.1038/s41562-018-0354-z ec_funded: 1 external_id: isi: - '000435551300009' file: - access_level: open_access checksum: 32efaf06a597495c184df91b3fbb19c0 content_type: application/pdf creator: dernst date_created: 2019-11-19T08:17:23Z date_updated: 2020-07-14T12:45:54Z file_id: '7051' file_name: 2018_NatureHumanBeh_Hoffman.pdf file_size: 194734 relation: main_file file_date_updated: 2020-07-14T12:45:54Z has_accepted_license: '1' intvolume: ' 2' isi: 1 language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 397 - 404 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Nature Human Behaviour publication_status: published publisher: Nature Publishing Group publist_id: '7588' quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/the-logic-of-modesty-why-it-pays-to-be-humble/ scopus_import: '1' status: public title: The signal-burying game can explain why we obscure positive traits and good deeds type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2 year: '2018' ... --- _id: '5967' abstract: - lang: eng text: "The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n" article_processing_charge: No author: - first_name: Kristoffer Arnsfelt full_name: Hansen, Kristoffer Arnsfelt last_name: Hansen - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Abraham full_name: Neyman, Abraham last_name: Neyman citation: ama: 'Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198' apa: 'Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198' chicago: Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198. ieee: K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150. ista: 'Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. EC: Conference on Economics and Computation, 149–150.' mla: Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198. short: K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–150. conference: end_date: 2018-06-22 location: Ithaca, NY, United States name: 'EC: Conference on Economics and Computation' start_date: 2018-06-18 date_created: 2019-02-13T10:31:41Z date_published: 2018-06-18T00:00:00Z date_updated: 2023-09-19T10:45:15Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1145/3219166.3219198 external_id: isi: - '000492755100020' file: - access_level: open_access checksum: bb52683e349cfd864f4769a8f38f2798 content_type: application/pdf creator: dernst date_created: 2019-11-19T08:24:24Z date_updated: 2020-07-14T12:47:14Z file_id: '7054' file_name: 2018_EC18_Hansen.pdf file_size: 302539 relation: main_file file_date_updated: 2020-07-14T12:47:14Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 149-150 publication: Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18 publication_identifier: isbn: - '9781450358293' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: The Big Match with a clock and a bit of memory type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5993' abstract: - lang: eng text: 'In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism.' article_number: '7' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Hongfei full_name: Fu, Hongfei id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87 last_name: Fu - first_name: Petr full_name: Novotný, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotný - first_name: Rouzbeh full_name: Hasheminezhad, Rouzbeh last_name: Hasheminezhad citation: ama: Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800 apa: Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800 chicago: Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800. ieee: K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018. ista: Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7. mla: Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800. short: K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018). date_created: 2019-02-14T12:29:10Z date_published: 2018-06-01T00:00:00Z date_updated: 2023-09-19T14:38:42Z day: '01' department: - _id: KrCh doi: 10.1145/3174800 ec_funded: 1 external_id: arxiv: - '1510.08517' isi: - '000434634500003' intvolume: ' 40' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1510.08517 month: '06' oa: 1 oa_version: Submitted Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: ACM Transactions on Programming Languages and Systems publication_identifier: issn: - 0164-0925 publication_status: published publisher: Association for Computing Machinery (ACM) quality_controlled: '1' related_material: record: - id: '1438' relation: earlier_version status: public scopus_import: '1' status: public title: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 40 year: '2018' ... --- _id: '25' abstract: - lang: eng text: 'Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples.' acknowledgement: '∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ' article_processing_charge: No author: - first_name: Karel full_name: Horák, Karel last_name: Horák - first_name: Branislav full_name: Bošanský, Branislav last_name: Bošanský - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662' apa: 'Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662' chicago: 'Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.' ieee: 'K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.' ista: 'Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.' mla: 'Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.' short: K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770. conference: end_date: 2018-07-19 location: Stockholm, Sweden name: 'IJCAI: International Joint Conference on Artificial Intelligence' start_date: 2018-07-13 date_created: 2018-12-11T11:44:13Z date_published: 2018-07-01T00:00:00Z date_updated: 2023-09-19T14:44:59Z day: '01' department: - _id: KrCh doi: 10.24963/ijcai.2018/662 ec_funded: 1 external_id: isi: - '000764175404127' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.24963/ijcai.2018/662 month: '07' oa: 1 oa_version: Published Version page: 4764 - 4770 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence publication_status: published publisher: IJCAI publist_id: '8030' quality_controlled: '1' scopus_import: '1' status: public title: 'Goal-HSVI: Heuristic search value iteration for goal-POMDPs' type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2018-July year: '2018' ... --- _id: '24' abstract: - lang: eng 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. 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" article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Adrian full_name: Elgyütt, Adrian id: 4A2E9DBA-F248-11E8-B48F-1D18A9856A87 last_name: Elgyütt - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny - first_name: Owen full_name: Rouillé, Owen last_name: Rouillé citation: ama: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652' apa: 'Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652' chicago: Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652. ieee: 'K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.' 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.' mla: Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652. short: K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699. conference: end_date: 2018-07-19 location: Stockholm, Sweden name: 'IJCAI: International Joint Conference on Artificial Intelligence' start_date: 2018-07-13 date_created: 2018-12-11T11:44:13Z date_published: 2018-07-01T00:00:00Z date_updated: 2023-09-19T14:45:48Z day: '01' department: - _id: KrCh - _id: ToHe doi: 10.24963/ijcai.2018/652 ec_funded: 1 external_id: arxiv: - '1804.10601' isi: - '000764175404117' intvolume: ' 2018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.10601 month: '07' oa: 1 oa_version: Preprint page: 4692 - 4699 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication_status: published publisher: IJCAI publist_id: '8031' quality_controlled: '1' scopus_import: '1' status: public title: Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2018 year: '2018' ... --- _id: '34' abstract: - lang: eng text: Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies. alternative_title: - ICAPS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chemlík, Martin last_name: Chemlík - first_name: Ufuk full_name: Topcu, Ufuk last_name: Topcu citation: ama: 'Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55.' apa: 'Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.' chicago: Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018. ieee: 'K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.' ista: 'Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.' mla: Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55. short: K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55. conference: end_date: 2018-06-29 location: Delft, Netherlands name: 'ICAPS: International Conference on Automated Planning and Scheduling' start_date: 2018-06-24 date_created: 2018-12-11T11:44:16Z date_published: 2018-06-01T00:00:00Z date_updated: 2023-09-19T14:44:14Z day: '01' department: - _id: KrCh ec_funded: 1 external_id: arxiv: - '1710.00675' isi: - '000492986200006' intvolume: ' 2018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1710.00675 month: '06' oa: 1 oa_version: Preprint page: 47 - 55 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: AAAI Press publist_id: '8021' quality_controlled: '1' scopus_import: '1' status: public title: Sensor synthesis for POMDPs with reachability objectives type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2018 year: '2018' ... --- _id: '35' abstract: - lang: eng text: 'We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Svozil, Alexander last_name: Svozil citation: ama: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018.' apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.' chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018. ieee: K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018. ista: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling.' mla: Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018. short: K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018. conference: end_date: 2018-06-29 location: Delft, Netherlands name: 'ICAPS: International Conference on Automated Planning and Scheduling' start_date: 2018-06-24 date_created: 2018-12-11T11:44:17Z date_published: 2018-06-01T00:00:00Z date_updated: 2023-09-26T10:41:41Z day: '01' department: - _id: KrCh ec_funded: 1 external_id: arxiv: - '1804.07031' isi: - '000492986200007' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.07031 month: '06' oa: 1 oa_version: None project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: '28th International Conference on Automated Planning and Scheduling ' publication_status: published publisher: AAAI Press publist_id: '8020' quality_controlled: '1' related_material: record: - id: '9293' relation: later_version status: public scopus_import: '1' status: public title: Algorithms and conditional lower bounds for planning problems type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '738' abstract: - lang: eng text: 'This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Alexander full_name: Kößler, Alexander last_name: Kößler - first_name: Ulrich full_name: Schmid, Ulrich last_name: Schmid citation: ama: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4 apa: Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4 chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4. ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018. ista: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207. mla: Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4. short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207. date_created: 2018-12-11T11:48:14Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-09-27T12:52:38Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/s11241-017-9293-4 ec_funded: 1 external_id: isi: - '000419955500006' file: - access_level: open_access checksum: c2590ef160709d8054cf29ee173f1454 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:14Z date_updated: 2020-07-14T12:47:56Z file_id: '5267' file_name: IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf file_size: 1163507 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 54' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 166 - 207 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Real-Time Systems publication_status: published publisher: Springer publist_id: '6929' pubrep_id: '960' quality_controlled: '1' related_material: record: - id: '2820' relation: earlier_version status: public scopus_import: '1' status: public title: Automated competitive analysis of real time scheduling with graph games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 54 year: '2018' ... --- _id: '198' abstract: - lang: eng text: We consider a class of students learning a language from a teacher. The situation can be interpreted as a group of child learners receiving input from the linguistic environment. The teacher provides sample sentences. The students try to learn the grammar from the teacher. In addition to just listening to the teacher, the students can also communicate with each other. The students hold hypotheses about the grammar and change them if they receive counter evidence. The process stops when all students have converged to the correct grammar. We study how the time to convergence depends on the structure of the classroom by introducing and evaluating various complexity measures. We find that structured communication between students, although potentially introducing confusion, can greatly reduce some of the complexity measures. Our theory can also be interpreted as applying to the scientific process, where nature is the teacher and the scientists are the students. article_number: '20180073' article_processing_charge: No article_type: original author: - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: ama: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. Journal of the Royal Society Interface. 2018;15(140). doi:10.1098/rsif.2018.0073 apa: Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2018.0073 chicago: Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073. ieee: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018. ista: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073. mla: Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073. short: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018). date_created: 2018-12-11T11:45:09Z date_published: 2018-03-01T00:00:00Z date_updated: 2023-10-18T06:36:00Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1098/rsif.2018.0073 ec_funded: 1 external_id: isi: - '000428576200023' pmid: - '29593089' file: - access_level: open_access checksum: 444e1a9d98eb0e780671be82b13025f3 content_type: application/pdf creator: dernst date_created: 2019-02-12T07:54:37Z date_updated: 2020-07-14T12:45:22Z file_id: '5955' file_name: 2018_RS_IbsenJensen.pdf file_size: 219837 relation: main_file file_date_updated: 2020-07-14T12:45:22Z has_accepted_license: '1' intvolume: ' 15' isi: 1 issue: '140' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version pmid: 1 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Journal of the Royal Society Interface publication_identifier: eissn: - 1742-5662 publication_status: published publisher: The Royal Society publist_id: '7715' quality_controlled: '1' related_material: link: - relation: supplementary_material url: https://dx.doi.org/10.6084/m9.figshare.c.4028971 record: - id: '9814' relation: research_data status: public scopus_import: '1' status: public title: Language acquisition with communication between learners type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2018' ... --- _id: '5751' abstract: - lang: eng text: 'Because of the intrinsic randomness of the evolutionary process, a mutant with a fitness advantage has some chance to be selected but no certainty. Any experiment that searches for advantageous mutants will lose many of them due to random drift. It is therefore of great interest to find population structures that improve the odds of advantageous mutants. Such structures are called amplifiers of natural selection: they increase the probability that advantageous mutants are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous mutants, even for very small fitness advantage. Despite intensive research over the past decade, arbitrarily strong amplifiers have remained rare. Here we show how to construct a large variety of them. Our amplifiers are so simple that they could be useful in biotechnology, when optimizing biological molecules, or as a diagnostic tool, when searching for faster dividing cells or viruses. They could also occur in natural population structures.' article_number: '71' article_processing_charge: No author: - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin A. full_name: Nowak, Martin A. last_name: Nowak citation: ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 2018;1(1). doi:10.1038/s42003-018-0078-7 apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-018-0078-7 chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7. ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018. ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71. mla: Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7. short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018). date_created: 2018-12-18T13:22:58Z date_published: 2018-06-14T00:00:00Z date_updated: 2024-02-21T13:48:42Z day: '14' ddc: - '004' - '519' - '576' department: - _id: KrCh doi: 10.1038/s42003-018-0078-7 ec_funded: 1 external_id: isi: - '000461126500071' file: - access_level: open_access checksum: a9db825fa3b64a51ff3de035ec973b3e content_type: application/pdf creator: dernst date_created: 2018-12-18T13:37:04Z date_updated: 2020-07-14T12:47:10Z file_id: '5752' file_name: 2018_CommBiology_Pavlogiannis.pdf file_size: 1804194 relation: main_file file_date_updated: 2020-07-14T12:47:10Z has_accepted_license: '1' intvolume: ' 1' isi: 1 issue: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Communications Biology publication_identifier: issn: - 2399-3642 publication_status: published publisher: Springer Nature pubrep_id: '1045' quality_controlled: '1' related_material: record: - id: '7196' relation: part_of_dissertation status: public - id: '5559' relation: popular_science status: public scopus_import: '1' status: public title: Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 1 year: '2018' ... --- _id: '66' abstract: - lang: eng text: 'Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions.' alternative_title: - LIPIcs article_number: '11' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir full_name: Goharshady, Amir id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Yaron full_name: Velner, Yaron last_name: Velner citation: ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11' apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11' chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11. ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.' ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.' mla: Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11. short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-09-07 location: Beijing, China name: 'CONCUR: Conference on Concurrency Theory' start_date: 2018-09-04 date_created: 2018-12-11T11:44:27Z date_published: 2018-09-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.CONCUR.2018.11 ec_funded: 1 external_id: arxiv: - '1806.03108' file: - access_level: open_access checksum: 68a055b1aaa241cc38375083cf832a7d content_type: application/pdf creator: dernst date_created: 2018-12-17T12:08:00Z date_updated: 2020-07-14T12:47:34Z file_id: '5696' file_name: 2018_CONCUR_Chatterjee.pdf file_size: 1078309 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' intvolume: ' 118' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication_identifier: isbn: - 978-3-95977-087-3 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7988' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Ergodic mean-payoff games for the analysis of attacks in crypto-currencies tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 118 year: '2018' ...