[{"date_updated":"2024-10-09T20:55:54Z","publist_id":"5290","file_date_updated":"2020-07-14T12:45:17Z","abstract":[{"text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.1142/S0218195914500034","has_accepted_license":"1","date_published":"2014-03-16T00:00:00Z","ddc":["000"],"oa_version":"Published Version","_id":"1816","status":"public","publisher":"World Scientific Publishing","acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","year":"2014","citation":{"ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 2014;24(1):61-86. doi:10.1142/S0218195914500034","ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","apa":"Huber, S., Held, M., Meerwald, P., & Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195914500034","ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” International Journal of Computational Geometry and Applications, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.","chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2014. https://doi.org/10.1142/S0218195914500034.","short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” International Journal of Computational Geometry and Applications, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:10.1142/S0218195914500034."},"day":"16","intvolume":" 24","file":[{"date_updated":"2020-07-14T12:45:17Z","content_type":"application/pdf","creator":"system","checksum":"be45c133ab4d43351260e21beaa8f4b1","access_level":"open_access","relation":"main_file","file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","date_created":"2018-12-12T10:08:43Z","file_size":991734,"file_id":"4704"}],"issue":"1","scopus_import":1,"corr_author":"1","author":[{"full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","orcid":"0000-0002-8871-5814","first_name":"Stefan"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"first_name":"Peter","full_name":"Meerwald, Peter","last_name":"Meerwald"},{"full_name":"Kwitt, Roland","last_name":"Kwitt","first_name":"Roland"}],"publication":"International Journal of Computational Geometry and Applications","type":"journal_article","doi":"10.1142/S0218195914500034","oa":1,"title":"Topology-preserving watermarking of vector graphics","publication_status":"published","pubrep_id":"443","department":[{"_id":"HeEd"}],"volume":24,"language":[{"iso":"eng"}],"page":"61 - 86","month":"03","date_created":"2018-12-11T11:54:10Z","quality_controlled":"1"},{"title":"Movement templates for learning of hitting and batting","type":"book_chapter","doi":"10.1007/978-3-319-03194-1_3","publication":"Learning Motor Skills","author":[{"last_name":"Muelling","full_name":"Muelling, Katharina","first_name":"Katharina"},{"last_name":"Kroemer","full_name":"Kroemer, Oliver","first_name":"Oliver"},{"full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph"},{"last_name":"Schölkopf","full_name":"Schölkopf, Bernhard","first_name":"Bernhard"}],"scopus_import":1,"quality_controlled":"1","date_created":"2018-12-11T11:54:14Z","month":"01","series_title":"From Algorithms to Robot Experiments","page":"69 - 82","publication_status":"published","department":[{"_id":"ChLa"}],"volume":97,"language":[{"iso":"eng"}],"date_published":"2014-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-319-03194-1_3","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can properly be returned to the opponent. These predictions get more accurate over time, hence the behaviors need to be continuously modified. As a result, movement templates with a learned global shape need to be adapted during the execution so that the racket reaches a target position and velocity that will return the ball over to the other side of the net or court. It requires altering learned movements to hit a varying target with the necessary velocity at a specific instant in time. Such a task cannot be incorporated straightforwardly in most movement representations suitable for learning. For example, the standard formulation of the dynamical system based motor primitives (introduced by Ijspeert et al (2002b)) does not satisfy this property despite their flexibility which has allowed learning tasks ranging from locomotion to kendama. In order to fulfill this requirement, we reformulate the Ijspeert framework to incorporate the possibility of specifying a desired hitting point and a desired hitting velocity while maintaining all advantages of the original formulation.We show that the proposed movement template formulation works well in two scenarios, i.e., for hitting a ball on a string with a table tennis racket at a specified velocity and for returning balls launched by a ball gun successfully over the net using forehand movements."}],"alternative_title":["Springer Tracts in Advanced Robotics"],"publist_id":"5274","date_updated":"2021-01-12T06:53:28Z","intvolume":" 97","day":"01","publisher":"Springer","year":"2014","citation":{"chicago":"Muelling, Katharina, Oliver Kroemer, Christoph Lampert, and Bernhard Schölkopf. “Movement Templates for Learning of Hitting and Batting.” In Learning Motor Skills, edited by Jens Kober and Jan Peters, 97:69–82. From Algorithms to Robot Experiments. Springer, 2014. https://doi.org/10.1007/978-3-319-03194-1_3.","mla":"Muelling, Katharina, et al. “Movement Templates for Learning of Hitting and Batting.” Learning Motor Skills, edited by Jens Kober and Jan Peters, vol. 97, Springer, 2014, pp. 69–82, doi:10.1007/978-3-319-03194-1_3.","short":"K. Muelling, O. Kroemer, C. Lampert, B. Schölkopf, in:, J. Kober, J. Peters (Eds.), Learning Motor Skills, Springer, 2014, pp. 69–82.","ista":"Muelling K, Kroemer O, Lampert C, Schölkopf B. 2014.Movement templates for learning of hitting and batting. In: Learning Motor Skills. Springer Tracts in Advanced Robotics, vol. 97, 69–82.","ama":"Muelling K, Kroemer O, Lampert C, Schölkopf B. Movement templates for learning of hitting and batting. In: Kober J, Peters J, eds. Learning Motor Skills. Vol 97. From Algorithms to Robot Experiments. Springer; 2014:69-82. doi:10.1007/978-3-319-03194-1_3","ieee":"K. Muelling, O. Kroemer, C. Lampert, and B. Schölkopf, “Movement templates for learning of hitting and batting,” in Learning Motor Skills, vol. 97, J. Kober and J. Peters, Eds. Springer, 2014, pp. 69–82.","apa":"Muelling, K., Kroemer, O., Lampert, C., & Schölkopf, B. (2014). Movement templates for learning of hitting and batting. In J. Kober & J. Peters (Eds.), Learning Motor Skills (Vol. 97, pp. 69–82). Springer. https://doi.org/10.1007/978-3-319-03194-1_3"},"_id":"1829","status":"public","editor":[{"last_name":"Kober","full_name":"Kober, Jens","first_name":"Jens"},{"first_name":"Jan","last_name":"Peters","full_name":"Peters, Jan"}],"oa_version":"None"},{"page":"64 - 79","publication_status":"published","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"language":[{"iso":"eng"}],"volume":53,"month":"11","article_processing_charge":"No","date_created":"2018-12-11T11:54:18Z","scopus_import":"1","publication":"Discrete & Computational Geometry","author":[{"first_name":"Josef","full_name":"Cibulka, Josef","last_name":"Cibulka"},{"full_name":"Gao, Pu","last_name":"Gao","first_name":"Pu"},{"first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","full_name":"Krcál, Marek"},{"full_name":"Valla, Tomáš","last_name":"Valla","first_name":"Tomáš"},{"first_name":"Pavel","full_name":"Valtr, Pavel","last_name":"Valtr"}],"oa":1,"title":"On the geometric ramsey number of outerplanar graphs","type":"journal_article","doi":"10.1007/s00454-014-9646-x","main_file_link":[{"url":"http://arxiv.org/abs/1310.7004","open_access":"1"}],"status":"public","_id":"1842","oa_version":"Submitted Version","isi":1,"day":"14","arxiv":1,"publisher":"Springer","year":"2014","acknowledgement":"Marek Krčál was supported by the ERC Advanced Grant No. 267165.","citation":{"apa":"Cibulka, J., Gao, P., Krcál, M., Valla, T., & Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9646-x","ieee":"J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete & Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.","ama":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 2014;53(1):64-79. doi:10.1007/s00454-014-9646-x","ista":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 53(1), 64–79.","mla":"Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.” Discrete & Computational Geometry, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:10.1007/s00454-014-9646-x.","short":"J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete & Computational Geometry 53 (2014) 64–79.","chicago":"Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9646-x."},"issue":"1","external_id":{"isi":["000346774600005"],"arxiv":["1310.7004"]},"intvolume":" 53","publist_id":"5260","date_updated":"2025-09-29T13:11:56Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices.","lang":"eng"}],"date_published":"2014-11-14T00:00:00Z","fulldoi":"https://doi.org/10.1007/s00454-014-9646-x"},{"_id":"1844","status":"public","oa_version":"Published Version","day":"12","isi":1,"citation":{"ama":"Risso V, Manssour Triedo F, Delgado Delgado A, et al. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 2014;32(2):440-455. doi:10.1093/molbev/msu312","ista":"Risso V, Manssour Triedo F, Delgado Delgado A, Arco R, Barroso Deljesús A, Inglés Prieto Á, Godoy Ruiz R, Gavira J, Gaucher E, Ibarra Molero B, Sánchez Ruiz J. 2014. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 32(2), 440–455.","ieee":"V. Risso et al., “Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history,” Molecular Biology and Evolution, vol. 32, no. 2. Oxford University Press, pp. 440–455, 2014.","apa":"Risso, V., Manssour Triedo, F., Delgado Delgado, A., Arco, R., Barroso Deljesús, A., Inglés Prieto, Á., … Sánchez Ruiz, J. (2014). Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msu312","chicago":"Risso, Valeria, Fadia Manssour Triedo, Asuncion Delgado Delgado, Rocio Arco, Alicia Barroso Deljesús, Álvaro Inglés Prieto, Raquel Godoy Ruiz, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” Molecular Biology and Evolution. Oxford University Press, 2014. https://doi.org/10.1093/molbev/msu312.","short":"V. Risso, F. Manssour Triedo, A. Delgado Delgado, R. Arco, A. Barroso Deljesús, Á. Inglés Prieto, R. Godoy Ruiz, J. Gavira, E. Gaucher, B. Ibarra Molero, J. Sánchez Ruiz, Molecular Biology and Evolution 32 (2014) 440–455.","mla":"Risso, Valeria, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” Molecular Biology and Evolution, vol. 32, no. 2, Oxford University Press, 2014, pp. 440–55, doi:10.1093/molbev/msu312."},"year":"2014","publisher":"Oxford University Press","external_id":{"isi":["000350050700012"]},"issue":"2","file":[{"date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","creator":"system","checksum":"06215318e66be8f3e0c33abb07e9d3da","access_level":"open_access","relation":"main_file","file_name":"IST-2016-430-v1+1_Mol_Biol_Evol-2015-Risso-440-55.pdf","date_created":"2018-12-12T10:16:56Z","file_size":1545246,"file_id":"5247"}],"intvolume":" 32","date_updated":"2025-09-29T13:11:19Z","publist_id":"5257","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:45:19Z","abstract":[{"lang":"eng","text":"Local protein interactions ("molecular context" effects) dictate amino acid replacements and can be described in terms of site-specific, energetic preferences for any different amino acid. It has been recently debated whether these preferences remain approximately constant during evolution or whether, due to coevolution of sites, they change strongly. Such research highlights an unresolved and fundamental issue with far-reaching implications for phylogenetic analysis and molecular evolution modeling. Here, we take advantage of the recent availability of phenotypically supported laboratory resurrections of Precambrian thioredoxins and β-lactamases to experimentally address the change of site-specific amino acid preferences over long geological timescales. Extensive mutational analyses support the notion that evolutionary adjustment to a new amino acid may occur, but to a large extent this is insufficient to erase the primitive preference for amino acid replacements. Generally, site-specific amino acid preferences appear to remain conserved throughout evolutionary history despite local sequence divergence. We show such preference conservation to be readily understandable in molecular terms and we provide crystallographic evidence for an intriguing structural-switch mechanism: Energetic preference for an ancestral amino acid in a modern protein can be linked to reorganization upon mutation to the ancestral local structure around the mutated site. Finally, we point out that site-specific preference conservation naturally leads to one plausible evolutionary explanation for the existence of intragenic global suppressor mutations."}],"ddc":["571"],"has_accepted_license":"1","date_published":"2014-11-12T00:00:00Z","fulldoi":"https://doi.org/10.1093/molbev/msu312","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"page":"440 - 455","language":[{"iso":"eng"}],"department":[{"_id":"HaJa"}],"volume":32,"publication_status":"published","pubrep_id":"430","month":"11","license":"https://creativecommons.org/licenses/by-nc/4.0/","date_created":"2018-12-11T11:54:19Z","article_processing_charge":"No","quality_controlled":"1","scopus_import":"1","publication":"Molecular Biology and Evolution","author":[{"full_name":"Risso, Valeria","last_name":"Risso","first_name":"Valeria"},{"last_name":"Manssour Triedo","full_name":"Manssour Triedo, Fadia","first_name":"Fadia"},{"full_name":"Delgado Delgado, Asuncion","last_name":"Delgado Delgado","first_name":"Asuncion"},{"first_name":"Rocio","full_name":"Arco, Rocio","last_name":"Arco"},{"first_name":"Alicia","full_name":"Barroso Deljesús, Alicia","last_name":"Barroso Deljesús"},{"orcid":"0000-0002-5409-8571","first_name":"Álvaro","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro"},{"last_name":"Godoy Ruiz","full_name":"Godoy Ruiz, Raquel","first_name":"Raquel"},{"last_name":"Gavira","full_name":"Gavira, Josè","first_name":"Josè"},{"full_name":"Gaucher, Eric","last_name":"Gaucher","first_name":"Eric"},{"first_name":"Beatriz","full_name":"Ibarra Molero, Beatriz","last_name":"Ibarra Molero"},{"full_name":"Sánchez Ruiz, Jose","last_name":"Sánchez Ruiz","first_name":"Jose"}],"oa":1,"title":"Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history","doi":"10.1093/molbev/msu312","type":"journal_article"},{"file":[{"date_created":"2018-12-12T10:16:43Z","file_size":435320,"file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","file_id":"5232","creator":"system","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"1d4a046f1af945c407c5c4d411d4c5e4"}],"day":"01","das_tickbox":"1","publisher":"EMS Press","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053.","year":"2014","citation":{"short":"H. Edelsbrunner, D. Morozovy, in:, EMS Press, 2014, pp. 31–50.","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. EMS Press, 2014, pp. 31–50, doi:10.4171/120-1/3.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. EMS Press, 2014. https://doi.org/10.4171/120-1/3.","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","apa":"Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: EMS Press. https://doi.org/10.4171/120-1/3","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: EMS Press; 2014:31-50. doi:10.4171/120-1/3"},"status":"public","_id":"2905","oa_version":"Submitted Version","has_accepted_license":"1","date_published":"2014-01-01T00:00:00Z","ddc":["000"],"fulldoi":"https://doi.org/10.4171/120-1/3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","date_updated":"2026-07-06T11:55:48Z","publist_id":"3842","quality_controlled":"1","article_processing_charge":"No","date_created":"2018-12-11T12:00:16Z","month":"01","page":"31 - 50","pubrep_id":"544","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"title":"Persistent homology: Theory and practice","oa":1,"type":"conference","doi":"10.4171/120-1/3","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Dmitriy","last_name":"Morozovy","full_name":"Morozovy, Dmitriy"}],"conference":{"start_date":"2012-07-02","location":"Kraków, Poland","name":"ECM: European Congress of Mathematics","end_date":"2012-07-07"},"corr_author":"1"},{"issue":"7","external_id":{"arxiv":["1306.1309"],"isi":["000345494900006"]},"intvolume":" 16","status":"public","_id":"1904","oa_version":"Submitted Version","isi":1,"das_tickbox":"1","arxiv":1,"day":"23","publisher":"EMS Press","year":"2014","citation":{"ieee":"R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “Strichartz inequality for orthonormal functions,” Journal of the European Mathematical Society, vol. 16, no. 7. EMS Press, pp. 1507–1526, 2014.","apa":"Frank, R., Lewin, M., Lieb, É., & Seiringer, R. (2014). Strichartz inequality for orthonormal functions. Journal of the European Mathematical Society. EMS Press. https://doi.org/10.4171/JEMS/467","ista":"Frank R, Lewin M, Lieb É, Seiringer R. 2014. Strichartz inequality for orthonormal functions. Journal of the European Mathematical Society. 16(7), 1507–1526.","ama":"Frank R, Lewin M, Lieb É, Seiringer R. Strichartz inequality for orthonormal functions. Journal of the European Mathematical Society. 2014;16(7):1507-1526. doi:10.4171/JEMS/467","short":"R. Frank, M. Lewin, É. Lieb, R. Seiringer, Journal of the European Mathematical Society 16 (2014) 1507–1526.","mla":"Frank, Rupert, et al. “Strichartz Inequality for Orthonormal Functions.” Journal of the European Mathematical Society, vol. 16, no. 7, EMS Press, 2014, pp. 1507–26, doi:10.4171/JEMS/467.","chicago":"Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “Strichartz Inequality for Orthonormal Functions.” Journal of the European Mathematical Society. EMS Press, 2014. https://doi.org/10.4171/JEMS/467."},"date_published":"2014-08-23T00:00:00Z","fulldoi":"https://doi.org/10.4171/JEMS/467","publist_id":"5191","date_updated":"2026-07-06T11:56:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We prove a Strichartz inequality for a system of orthonormal functions, with an optimal behavior of the constant in the limit of a large number of functions. The estimate generalizes the usual Strichartz inequality, in the same fashion as the Lieb-Thirring inequality generalizes the Sobolev inequality. As an application, we consider the Schrödinger equation with a time-dependent potential and we show the existence of the wave operator in Schatten spaces.","lang":"eng"}],"article_processing_charge":"No","date_created":"2018-12-11T11:54:38Z","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"quality_controlled":"1","page":"1507 - 1526","publication_status":"published","department":[{"_id":"RoSe"}],"volume":16,"language":[{"iso":"eng"}],"month":"08","title":"Strichartz inequality for orthonormal functions","oa":1,"type":"journal_article","main_file_link":[{"url":"http://arxiv.org/abs/1306.1309","open_access":"1"}],"doi":"10.4171/JEMS/467","scopus_import":"1","publication":"Journal of the European Mathematical Society","author":[{"full_name":"Frank, Rupert","last_name":"Frank","first_name":"Rupert"},{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"last_name":"Lieb","full_name":"Lieb, Élliott","first_name":"Élliott"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}]},{"doi":"10.2168/LMCS-10(1:10)2014","type":"journal_article","publication_identifier":{"issn":["1860-5974"]},"title":"Exact and approximate determinization of discounted-sum automata","oa":1,"scopus_import":"1","author":[{"first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publication":"Logical Methods in Computer Science","date_created":"2018-12-11T11:56:28Z","article_processing_charge":"No","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"volume":10,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"pubrep_id":"389","publication_status":"published","month":"02","fulldoi":"https://doi.org/10.2168/LMCS-10(1:10)2014","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"has_accepted_license":"1","date_published":"2014-02-13T00:00:00Z","publist_id":"4728","date_updated":"2026-07-06T13:22:33Z","ec_funded":1,"file_date_updated":"2020-07-14T12:45:34Z","abstract":[{"lang":"eng","text":" A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λi, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, reflecting the assumption that earlier weights are more important than later weights. Unfortunately, determinization of NDAs, which is often essential in formal verification, is, in general, not possible. We provide positive news, showing that every NDA with an integral discount factor is determinizable. We complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor λ, there is a nondeterminizable λ-NDA. We also prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. For general NDAs, we look into approximate determinization, which is always possible as the influence of a word's suffix decays. We show that the naive approach, of unfolding the automaton computations up to a sufficient level, is doubly exponential in the discount factor. We provide an alternative construction for approximate determinization, which is singly exponential in the discount factor, in the precision, and in the number of states. We also prove matching lower bounds, showing that the exponential dependency on each of these three parameters cannot be avoided. All our results hold equally for automata over finite words and for automata over infinite words. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"4643","file_name":"IST-2015-389-v1+1_1401.3957.pdf","date_created":"2018-12-12T10:07:45Z","file_size":550936,"checksum":"9f6ea2e2d8d4a32ff0becc29d835bbf8","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","creator":"system"}],"intvolume":" 10","external_id":{"isi":["000333744700015"]},"issue":"1","oa_version":"Published Version","_id":"2233","status":"public","citation":{"short":"U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).","mla":"Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” Logical Methods in Computer Science, vol. 10, no. 1, International Federation for Computational Logic, 2014, doi:10.2168/LMCS-10(1:10)2014.","chicago":"Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” Logical Methods in Computer Science. International Federation for Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:10)2014.","ieee":"U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation for Computational Logic, 2014.","apa":"Boker, U., & Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.2168/LMCS-10(1:10)2014","ama":"Boker U, Henzinger TA. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 2014;10(1). doi:10.2168/LMCS-10(1:10)2014","ista":"Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1)."},"year":"2014","publisher":"International Federation for Computational Logic","das_tickbox":"1","day":"13","isi":1},{"month":"02","pubrep_id":"428","publication_status":"published","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"volume":10,"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"article_processing_charge":"No","date_created":"2018-12-11T11:56:29Z","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"first_name":"Václav","last_name":"Brožek","full_name":"Brožek, Václav"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"last_name":"Kučera","full_name":"Kučera, Antonín","first_name":"Antonín"}],"publication":"Logical Methods in Computer Science","scopus_import":"1","type":"journal_article","doi":"10.2168/LMCS-10(1:13)2014","title":"Markov decision processes with multiple long-run average objectives","oa":1,"publication_identifier":{"issn":["1860-5974"]},"publisher":"International Federation for Computational Logic","year":"2014","citation":{"mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science, vol. 10, no. 1, International Federation for Computational Logic, 2014, doi:10.2168/LMCS-10(1:13)2014.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” Logical Methods in Computer Science. International Federation for Computational Logic, 2014. https://doi.org/10.2168/LMCS-10(1:13)2014.","apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation for Computational Logic. https://doi.org/10.2168/LMCS-10(1:13)2014","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation for Computational Logic, 2014.","ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 2014;10(1). doi:10.2168/LMCS-10(1:13)2014"},"isi":1,"das_tickbox":"1","day":"14","oa_version":"Published Version","status":"public","_id":"2234","intvolume":" 10","file":[{"file_id":"4656","file_size":375388,"date_created":"2018-12-12T10:07:57Z","file_name":"IST-2016-428-v1+1_1104.3489.pdf","access_level":"open_access","checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:45:34Z","content_type":"application/pdf"}],"issue":"1","external_id":{"isi":["000333744700001"]},"abstract":[{"text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with κ limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are necessary for strategies even for ε-approximation, and that finite-memory randomized strategies are sufficient for achieving Pareto optimal values. Under the satisfaction objective, in contrast to the case of one limit-average function, infinite memory is necessary for strategies achieving a specific value (i.e. randomized finite-memory strategies are not sufficient), whereas memoryless randomized strategies are sufficient for ε-approximation, for all ε > 0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be ε-approximated in time polynomial in the size of the MDP and 1/ε, and exponential in the number of limit-average functions, for all ε > 0. Our analysis also reveals flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, corrects the flaws, and allows us to obtain improved results.","lang":"eng"}],"ec_funded":1,"file_date_updated":"2020-07-14T12:45:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-06T13:23:35Z","publist_id":"4727","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.2168/LMCS-10(1:13)2014","date_published":"2014-02-14T00:00:00Z","has_accepted_license":"1","ddc":["000"]},{"doi":"10.1007/978-94-007-7687-6_1","type":"book_chapter","title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","author":[{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","first_name":"Simon","orcid":"0000-0003-2279-1061"}],"publication":"Cellular and Molecular Control of Neuronal Migration","scopus_import":"1","corr_author":"1","quality_controlled":"1","date_created":"2018-12-11T11:56:39Z","article_processing_charge":"No","month":"01","volume":800,"language":[{"iso":"eng"}],"department":[{"_id":"SiHi"}],"publication_status":"published","page":"1 - 24","fulldoi":"https://doi.org/10.1007/978-94-007-7687-6_1","date_published":"2014-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"Coordinated migration of newly-born neurons to their target territories is essential for correct neuronal circuit assembly in the developing brain. Although a cohort of signaling pathways has been implicated in the regulation of cortical projection neuron migration, the precise molecular mechanisms and how a balanced interplay of cell-autonomous and non-autonomous functions of candidate signaling molecules controls the discrete steps in the migration process, are just being revealed. In this chapter, I will focally review recent advances that improved our understanding of the cell-autonomous and possible cell-nonautonomous functions of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential steps of cortical projection neuron migration. I will then elaborate on the emerging concept that the Reelin signaling pathway, acts exactly at precise stages in the course of cortical projection neuron migration. Lastly, I will discuss how finely tuned transcriptional programs and downstream effectors govern particular aspects in driving radial migration at discrete stages and how they regulate the precise positioning of cortical projection neurons in the developing cerebral cortex."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4679","date_updated":"2026-07-07T13:04:40Z","alternative_title":["Advances in Experimental Medicine and Biology"],"intvolume":" 800","external_id":{"isi":["000333646000002"]},"year":"2014","citation":{"apa":"Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1","ieee":"S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical projection neuron migration,” in Cellular and Molecular Control of Neuronal Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.","ista":"Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.","ama":"Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1","short":"S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24.","mla":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1.","chicago":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” In Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014. https://doi.org/10.1007/978-94-007-7687-6_1."},"publisher":"Springer","day":"01","das_tickbox":"1","isi":1,"editor":[{"full_name":"Nguyen, Laurent","last_name":"Nguyen","first_name":"Laurent"}],"oa_version":"None","_id":"2265","status":"public"},{"ec_funded":1,"abstract":[{"text":"We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties inMDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5046","alternative_title":["LNCS"],"date_updated":"2026-07-07T13:15:34Z","fulldoi":"https://doi.org/10.1007/978-3-319-11936-6_8","date_published":"2014-11-01T00:00:00Z","year":"2014","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 246967 (VERIWARE), by the EU FP7 project HIERATIC, by the Czech Science Foundation grant No P202/12/P612, by EPSRC project EP/K038575/1.","citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In 12th International Symposium on Automated Technology for Verification and Analysis, 8837:98–114. Springer, 2014. https://doi.org/10.1007/978-3-319-11936-6_8.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, 12th International Symposium on Automated Technology for Verification and Analysis, Springer, 2014, pp. 98–114.","mla":"Brázdil, Tomáš, et al. “Verification of Markov Decision Processes Using Learning Algorithms.” 12th International Symposium on Automated Technology for Verification and Analysis, vol. 8837, Springer, 2014, pp. 98–114, doi:10.1007/978-3-319-11936-6_8.","ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of Markov decision processes using learning algorithms. 12th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 98–114.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Verification of Markov decision processes using learning algorithms. In: 12th International Symposium on Automated Technology for Verification and Analysis. Vol 8837. Springer; 2014:98-114. doi:10.1007/978-3-319-11936-6_8","ieee":"T. Brázdil et al., “Verification of Markov decision processes using learning algorithms,” in 12th International Symposium on Automated Technology for Verification and Analysis, Sydney, Australia, 2014, vol. 8837, pp. 98–114.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of Markov decision processes using learning algorithms. In 12th International Symposium on Automated Technology for Verification and Analysis (Vol. 8837, pp. 98–114). Sydney, Australia: Springer. https://doi.org/10.1007/978-3-319-11936-6_8"},"publisher":"Springer","das_tickbox":"1","arxiv":1,"day":"01","oa_version":"Submitted Version","_id":"2027","status":"public","intvolume":" 8837","external_id":{"arxiv":["1402.2967"]},"author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","orcid":"0000-0002-8122-2881"},{"first_name":"Marta","last_name":"Kwiatkowska","full_name":"Kwiatkowska, Marta"},{"first_name":"David","last_name":"Parker","full_name":"Parker, David"},{"first_name":"Mateusz","full_name":"Ujma, Mateusz","last_name":"Ujma"}],"publication":"12th International Symposium on Automated Technology for Verification and Analysis","scopus_import":"1","conference":{"start_date":"2014-11-03","end_date":"2014-11-07","name":"ATVA: Automated Technology for Verification and Analysis","location":"Sydney, Australia"},"doi":"10.1007/978-3-319-11936-6_8","main_file_link":[{"url":"http://arxiv.org/abs/1402.2967","open_access":"1"}],"type":"conference","title":"Verification of Markov decision processes using learning algorithms","oa":1,"month":"11","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"volume":8837,"publication_status":"published","page":"98 - 114","quality_controlled":"1","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"24696","_id":"26241A12-B435-11E9-9278-68D0E5697425","name":"Light-regulated ligand traps for spatio-temporal inhibition of cell signaling"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:55:17Z","article_processing_charge":"No"},{"acknowledgement":"This work is supported by AFOSR grant FA 9550-11-1-0165, program grant RPG 24/2012 from the Human Frontiers of Science (DBF) and travel support from the European Commission Marie Curie International Reintegration Grant PIRG04-GA-2008-239429 (KB). DP was supported by NIHR01 GM104987 and the Wyss Institute of Biologically Inspired Engineering. ","year":"2014","citation":{"ama":"Bodova K, Paydarfar D, Forger D. Characterizing spiking in noisy type II neurons. Journal of Theoretical Biology. 2014;365:40-54. doi:10.1016/j.jtbi.2014.09.041","ista":"Bodova K, Paydarfar D, Forger D. 2014. Characterizing spiking in noisy type II neurons. Journal of Theoretical Biology. 365, 40–54.","ieee":"K. Bodova, D. Paydarfar, and D. Forger, “Characterizing spiking in noisy type II neurons,” Journal of Theoretical Biology, vol. 365. Academic Press, pp. 40–54, 2014.","apa":"Bodova, K., Paydarfar, D., & Forger, D. (2014). Characterizing spiking in noisy type II neurons. Journal of Theoretical Biology. Academic Press. https://doi.org/10.1016/j.jtbi.2014.09.041","chicago":"Bodova, Katarina, David Paydarfar, and Daniel Forger. “Characterizing Spiking in Noisy Type II Neurons.” Journal of Theoretical Biology. Academic Press, 2014. https://doi.org/10.1016/j.jtbi.2014.09.041.","short":"K. Bodova, D. Paydarfar, D. Forger, Journal of Theoretical Biology 365 (2014) 40–54.","mla":"Bodova, Katarina, et al. “Characterizing Spiking in Noisy Type II Neurons.” Journal of Theoretical Biology, vol. 365, Academic Press, 2014, pp. 40–54, doi:10.1016/j.jtbi.2014.09.041."},"publisher":"Academic Press","day":"12","das_tickbox":"1","isi":1,"oa_version":"Published Version","_id":"2028","status":"public","file":[{"file_id":"5316","file_name":"IST-2016-444-v1+1_1-s2.0-S0022519314005888-main.pdf","file_size":2679222,"date_created":"2018-12-12T10:17:58Z","relation":"main_file","checksum":"a9dbae18d3233b3dab6944fd3f2cd49e","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:25Z","creator":"system"}],"intvolume":" 365","external_id":{"isi":["000347267200005"]},"abstract":[{"lang":"eng","text":"Understanding the dynamics of noisy neurons remains an important challenge in neuroscience. Here, we describe a simple probabilistic model that accurately describes the firing behavior in a large class (type II) of neurons. To demonstrate the usefulness of this model, we show how it accurately predicts the interspike interval (ISI) distributions, bursting patterns and mean firing rates found by: (1) simulations of the classic Hodgkin-Huxley model with channel noise, (2) experimental data from squid giant axon with a noisy input current and (3) experimental data on noisy firing from a neuron within the suprachiasmatic nucleus (SCN). This simple model has 6 parameters, however, in some cases, two of these parameters are coupled and only 5 parameters account for much of the known behavior. From these parameters, many properties of spiking can be found through simple calculation. Thus, we show how the complex effects of noise can be understood through a simple and general probabilistic model."}],"file_date_updated":"2020-07-14T12:45:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5043","date_updated":"2026-07-07T13:13:09Z","fulldoi":"https://doi.org/10.1016/j.jtbi.2014.09.041","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"ddc":["570"],"has_accepted_license":"1","date_published":"2014-10-12T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","month":"10","language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"volume":365,"pubrep_id":"444","publication_status":"published","page":"40 - 54","quality_controlled":"1","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1016/j.jtbi.2015.03.013"}]},"date_created":"2018-12-11T11:55:18Z","article_processing_charge":"No","author":[{"id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","last_name":"Bodova","full_name":"Bodova, Katarina","orcid":"0000-0002-7214-0171","first_name":"Katarina"},{"full_name":"Paydarfar, David","last_name":"Paydarfar","first_name":"David"},{"last_name":"Forger","full_name":"Forger, Daniel","first_name":"Daniel"}],"publication":"Journal of Theoretical Biology","scopus_import":"1","corr_author":"1","doi":"10.1016/j.jtbi.2014.09.041","type":"journal_article","title":"Characterizing spiking in noisy type II neurons","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:48Z","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains. "}],"date_updated":"2026-07-07T14:01:10Z","alternative_title":["IST Austria Technical Report"],"ddc":["004"],"date_published":"2014-02-19T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.15479/AT:IST-2014-170-v1-1","day":"19","citation":{"apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria; 2014. doi:10.15479/AT:IST-2014-170-v1-1","ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1."},"year":"2014","publisher":"IST Austria","_id":"5415","status":"public","oa_version":"Published Version","file":[{"file_size":573457,"date_created":"2018-12-12T11:53:36Z","file_name":"IST-2014-170-v1+1_main.pdf","file_id":"5497","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:48Z","relation":"main_file","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","access_level":"open_access"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"publication_identifier":{"issn":["2664-1690"]},"oa":1,"title":"Nested weighted automata","doi":"10.15479/AT:IST-2014-170-v1-1","type":"technical_report","month":"02","page":"27","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"170","publication_status":"published","related_material":{"record":[{"status":"public","id":"5436","relation":"later_version"},{"id":"1656","relation":"later_version","status":"public"},{"relation":"later_version","id":"467","status":"public"}]},"date_created":"2018-12-12T11:39:12Z"},{"publist_id":"5013","date_updated":"2026-07-07T14:01:43Z","ec_funded":1,"abstract":[{"lang":"eng","text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with "controlled accumulation," allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable."}],"file_date_updated":"2020-07-14T12:45:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","fulldoi":"https://doi.org/10.1145/2629686","ddc":["000","004"],"date_published":"2014-09-16T00:00:00Z","has_accepted_license":"1","oa_version":"Submitted Version","status":"public","_id":"2038","citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic. 15(4), 27.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. ACM Transactions on Computational Logic. 2014;15(4). doi:10.1145/2629686","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic, vol. 15, no. 4. ACM, 2014.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/2629686","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic. ACM, 2014. https://doi.org/10.1145/2629686.","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic, vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic 15 (2014)."},"year":"2014","acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","publisher":"ACM","das_tickbox":"1","day":"16","isi":1,"file":[{"checksum":"354c41d37500b56320afce94cf9a99c2","access_level":"open_access","relation":"main_file","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:26Z","file_id":"4851","date_created":"2018-12-12T10:10:59Z","file_size":346184,"file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf"}],"intvolume":" 15","external_id":{"isi":["000345570700002"]},"issue":"4","scopus_import":"1","author":[{"first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"publication":"ACM Transactions on Computational Logic","doi":"10.1145/2629686","type":"journal_article","oa":1,"title":"Temporal specifications with accumulative values","article_number":"27","volume":15,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","pubrep_id":"192","month":"09","date_created":"2018-12-11T11:55:21Z","article_processing_charge":"No","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5385"},{"status":"public","id":"3356","relation":"earlier_version"}]},"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"intvolume":" 8634","issue":"PART 1","oa_version":"Preprint","status":"public","_id":"1903","year":"2014","citation":{"mla":"Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1.","short":"K. Chatterjee, in:, Springer, 2014, pp. 1–4.","chicago":"Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.","apa":"Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1","ieee":"K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.","ama":"Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:10.1007/978-3-662-44522-8_1","ista":"Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4."},"publisher":"Springer","day":"01","fulldoi":"https://doi.org/10.1007/978-3-662-44522-8_1","date_published":"2014-01-01T00:00:00Z","OA_type":"green","OA_place":"repository","alternative_title":["LNCS"],"publist_id":"5192","date_updated":"2026-07-07T14:01:25Z","abstract":[{"lang":"eng","text":"We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games."}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:38Z","article_processing_charge":"No","quality_controlled":"1","related_material":{"record":[{"id":"5381","relation":"earlier_version","status":"public"},{"status":"public","relation":"later_version","id":"2211"}]},"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":8634,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"publication_status":"published","pubrep_id":"141","page":"1 - 4","month":"01","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2011-0007","open_access":"1"}],"doi":"10.1007/978-3-662-44522-8_1","type":"conference","title":"Partial-observation stochastic reachability and parity games","oa":1,"scopus_import":"1","corr_author":"1","conference":{"location":"Budapest, Hungary","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2014-08-29","start_date":"2014-08-25"},"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}]},{"date_created":"2018-12-11T11:56:21Z","article_processing_charge":"No","quality_controlled":"1","related_material":{"record":[{"status":"public","id":"5381","relation":"earlier_version"},{"id":"1903","relation":"earlier_version","status":"public"},{"id":"2955","relation":"earlier_version","status":"public"}]},"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"volume":15,"publication_status":"published","month":"04","oa":1,"title":"Partial-observation stochastic games: How to win when belief fails","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"doi":"10.1145/2579821","type":"journal_article","article_number":"16","scopus_import":"1","publication":"ACM Transactions on Computational Logic","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"external_id":{"arxiv":["1107.2141"],"isi":["000336005000006"]},"issue":"2","intvolume":" 15","status":"public","_id":"2211","oa_version":"Preprint","day":"01","das_tickbox":"1","arxiv":1,"isi":1,"year":"2014","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic, vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.","short":"K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic 15 (2014).","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic. ACM, 2014. https://doi.org/10.1145/2579821.","apa":"Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/2579821","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic, vol. 15, no. 2. ACM, 2014.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic. 2014;15(2). doi:10.1145/2579821","ista":"Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic. 15(2), 16."},"publisher":"ACM","date_published":"2014-04-01T00:00:00Z","fulldoi":"https://doi.org/10.1145/2579821","publist_id":"4759","date_updated":"2026-07-07T14:01:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Our main results for pure strategies are as follows: (1) For one-sided games with player 2 having perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 having perfect observation we show that nonelementarymemory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least nonelementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibit serious flaws in previous results of the literature: we show a nonelementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}]},{"title":"Qualitative concurrent parity games: Bounded rationality","doi":"10.1007/978-3-662-44584-6_37","type":"conference","corr_author":"1","conference":{"start_date":"2014-09-02","location":"Rome, Italy","end_date":"2014-09-05","name":"CONCUR: Concurrency Theory"},"scopus_import":"1","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}],"date_created":"2018-12-11T11:55:27Z","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"status":"public","id":"3354","relation":"earlier_version"}]},"quality_controlled":"1","page":"544 - 559","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"volume":8704,"publication_status":"published","month":"09","date_published":"2014-09-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-662-44584-6_37","publist_id":"4992","alternative_title":["LNCS"],"date_updated":"2026-07-07T14:02:37Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games."}],"ec_funded":1,"intvolume":" 8704","_id":"2054","status":"public","editor":[{"full_name":"Baldan, Paolo","last_name":"Baldan","first_name":"Paolo"},{"first_name":"Daniele","last_name":"Gorla","full_name":"Gorla, Daniele"}],"oa_version":"None","day":"01","citation":{"ista":"Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37","chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.","short":"K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.","mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37."},"year":"2014","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"status":"public","_id":"535","oa_version":"Preprint","arxiv":1,"day":"01","isi":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:10.1007/s00453-013-9843-7.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer. https://doi.org/10.1007/s00453-013-9843-7","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.","ama":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 2014;70(3):457-492. doi:10.1007/s00453-013-9843-7","ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492."},"year":"2014","publisher":"Springer","external_id":{"isi":["000340552300005"],"arxiv":["1604.08234"]},"issue":"3","intvolume":" 70","publist_id":"7282","date_updated":"2026-07-08T05:50:38Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"abstract":[{"text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.","lang":"eng"}],"date_published":"2014-11-01T00:00:00Z","article_type":"original","fulldoi":"https://doi.org/10.1007/s00453-013-9843-7","page":"457 - 492","language":[{"iso":"eng"}],"volume":70,"department":[{"_id":"KrCh"}],"publication_status":"published","month":"11","date_created":"2018-12-11T11:47:01Z","article_processing_charge":"No","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"related_material":{"record":[{"status":"public","id":"10905","relation":"earlier_version"}]},"quality_controlled":"1","scopus_import":"1","publication":"Algorithmica","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"oa":1,"title":"Polynomial-time algorithms for energy games with special weight structures","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"doi":"10.1007/s00453-013-9843-7","type":"journal_article"},{"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"quality_controlled":"1","article_processing_charge":"No","date_created":"2018-12-11T11:54:28Z","month":"01","page":"185 - 200","pubrep_id":"641","publication_status":"published","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"volume":8837,"title":"Extensional crisis and proving identity","oa":1,"type":"conference","doi":"10.1007/978-3-319-11936-6_14","publication":"12th International Symposium on Automated Technology for Verification and Analysis","author":[{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"full_name":"Kragl, Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","orcid":"0000-0001-7745-9117"},{"first_name":"Andrei","last_name":"Voronkov","full_name":"Voronkov, Andrei"}],"conference":{"start_date":"2014-11-03","location":"Sydney, Australia","end_date":"2014-11-07","name":"ATVA: Automated Technology for Verification and Analysis"},"scopus_import":"1","intvolume":" 8837","file":[{"file_name":"IST-2016-641-v1+1_atva2014.pdf","date_created":"2018-12-12T10:10:15Z","file_size":244294,"file_id":"4801","date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","creator":"system","relation":"main_file","access_level":"open_access","checksum":"af4bd3fc1f4c93075e4dc5cbf625fe7b"}],"das_tickbox":"1","day":"01","publisher":"Springer","year":"2014","acknowledgement":"This research was supported in part by the Austrian National Research Network RiSE (S11410-N23).","citation":{"short":"A. Gupta, L. Kovács, B. Kragl, A. Voronkov, in:, 12th International Symposium on Automated Technology for Verification and Analysis, Springer, 2014, pp. 185–200.","mla":"Gupta, Ashutosh, et al. “Extensional Crisis and Proving Identity.” 12th International Symposium on Automated Technology for Verification and Analysis, vol. 8837, Springer, 2014, pp. 185–200, doi:10.1007/978-3-319-11936-6_14.","chicago":"Gupta, Ashutosh, Laura Kovács, Bernhard Kragl, and Andrei Voronkov. “Extensional Crisis and Proving Identity.” In 12th International Symposium on Automated Technology for Verification and Analysis, 8837:185–200. Springer, 2014. https://doi.org/10.1007/978-3-319-11936-6_14.","apa":"Gupta, A., Kovács, L., Kragl, B., & Voronkov, A. (2014). Extensional crisis and proving identity. In 12th International Symposium on Automated Technology for Verification and Analysis (Vol. 8837, pp. 185–200). Sydney, Australia: Springer. https://doi.org/10.1007/978-3-319-11936-6_14","ieee":"A. Gupta, L. Kovács, B. Kragl, and A. Voronkov, “Extensional crisis and proving identity,” in 12th International Symposium on Automated Technology for Verification and Analysis, Sydney, Australia, 2014, vol. 8837, pp. 185–200.","ista":"Gupta A, Kovács L, Kragl B, Voronkov A. 2014. Extensional crisis and proving identity. 12th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 185–200.","ama":"Gupta A, Kovács L, Kragl B, Voronkov A. Extensional crisis and proving identity. In: 12th International Symposium on Automated Technology for Verification and Analysis. Vol 8837. Springer; 2014:185-200. doi:10.1007/978-3-319-11936-6_14"},"status":"public","_id":"1872","oa_version":"Submitted Version","date_published":"2014-01-01T00:00:00Z","has_accepted_license":"1","ddc":["000"],"fulldoi":"https://doi.org/10.1007/978-3-319-11936-6_14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:45:19Z","abstract":[{"text":"Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics. An extensionality axiom asserts that two collections are equal if they consist of the same elements at the same indices. Using extensionality is often required to show that two collections are equal. A typical example is the set theory theorem (∀x)(∀y)x∪y = y ∪x. Interestingly, while humans have no problem with proving such set identities using extensionality, they are very hard for superposition theorem provers because of the calculi they use. In this paper we show how addition of a new inference rule, called extensionality resolution, allows first-order theorem provers to easily solve problems no modern first-order theorem prover can solve. We illustrate this by running the VAMPIRE theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps VAMPIRE to solve problems from the TPTP library of first-order problems that were never solved before by any prover.","lang":"eng"}],"ec_funded":1,"date_updated":"2026-07-08T06:49:33Z","publist_id":"5226","alternative_title":["LNCS"]},{"department":[{"_id":"SyCr"}],"oa_version":"Published Version","_id":"9753","status":"public","citation":{"ista":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2014. Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies, Dryad, 10.5061/dryad.nc0gc.","ama":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. 2014. doi:10.5061/dryad.nc0gc","apa":"Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., & Cremer, S. (2014). Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. Dryad. https://doi.org/10.5061/dryad.nc0gc","ieee":"S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies.” Dryad, 2014.","chicago":"Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia Cremer. “Data from: Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” Dryad, 2014. https://doi.org/10.5061/dryad.nc0gc.","short":"S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, (2014).","mla":"Tragust, Simon, et al. Data from: Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies. Dryad, 2014, doi:10.5061/dryad.nc0gc."},"year":"2014","publisher":"Dryad","day":"08","month":"10","date_created":"2021-07-30T08:24:11Z","article_processing_charge":"No","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"2284"}]},"date_updated":"2026-07-28T09:35:11Z","abstract":[{"lang":"eng","text":"Background: The brood of ants and other social insects is highly susceptible to pathogens, particularly those that penetrate the soft larval and pupal cuticle. We here test whether the presence of a pupal cocoon, which occurs in some ant species but not in others, affects the sanitary brood care and fungal infection patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We use a) a comparative approach analysing four species with either naked or cocooned pupae and b) a within-species analysis of a single ant species, in which both pupal types co-exist in the same colony. Results: We found that the presence of a cocoon did not compromise fungal pathogen detection by the ants and that species with cocooned pupae increased brood grooming after pathogen exposure. All tested ant species further removed brood from their nests, which was predominantly expressed towards larvae and naked pupae treated with the live fungal pathogen. In contrast, cocooned pupae exposed to live fungus were not removed at higher rates than cocooned pupae exposed to dead fungus or a sham control. Consistent with this, exposure to the live fungus caused high numbers of infections and fungal outgrowth in larvae and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion: Our study suggests that the pupal cocoon has a protective effect against fungal infection, causing an adaptive change in sanitary behaviours by the ants. It further demonstrates that brood removal - originally described for honeybees as “hygienic behaviour” – is a widespread sanitary behaviour in ants, which likely has important implications on disease dynamics in social insect colonies."}],"author":[{"full_name":"Tragust, Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","first_name":"Simon"},{"first_name":"Line V","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","last_name":"Ugelvig","full_name":"Ugelvig, Line V"},{"first_name":"Michel","last_name":"Chapuisat","full_name":"Chapuisat, Michel"},{"last_name":"Heinze","full_name":"Heinze, Jürgen","first_name":"Jürgen"},{"orcid":"0000-0002-2193-3868","first_name":"Sylvia","full_name":"Cremer, Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","doi":"10.5061/dryad.nc0gc","fulldoi":"https://doi.org/10.5061/dryad.nc0gc","main_file_link":[{"url":"https://doi.org/10.5061/dryad.nc0gc","open_access":"1"}],"type":"research_data_reference","date_published":"2014-10-08T00:00:00Z","oa":1,"title":"Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies"},{"month":"06","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"volume":51,"publication_status":"published","page":"129 - 163","quality_controlled":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10904"}]},"project":[{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T11:59:14Z","article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"publication":"Acta Informatica","scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1201.5073"}],"doi":"10.1007/s00236-013-0182-6","type":"journal_article","oa":1,"title":"Strategy synthesis for multi-dimensional quantitative objectives","acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","year":"2014","citation":{"apa":"Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0182-6","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6."},"publisher":"Springer","arxiv":1,"das_tickbox":"1","day":"01","isi":1,"oa_version":"Preprint","status":"public","_id":"2716","intvolume":" 51","external_id":{"isi":["000335981500002"],"arxiv":["1201.5073"]},"issue":"3-4","ec_funded":1,"abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4176","date_updated":"2026-07-28T11:24:52Z","article_type":"original","fulldoi":"https://doi.org/10.1007/s00236-013-0182-6","date_published":"2014-06-01T00:00:00Z"}]