--- _id: '3270' abstract: - lang: eng text: 'The persistence diagram of a filtered simplicial com- plex is usually computed by reducing the boundary matrix of the complex. We introduce a simple op- timization technique: by processing the simplices of the complex in decreasing dimension, we can “kill” columns (i.e., set them to zero) without reducing them. This technique completely avoids reduction on roughly half of the columns. We demonstrate that this idea significantly improves the running time of the reduction algorithm in practice. We also give an output-sensitive complexity analysis for the new al- gorithm which yields to sub-cubic asymptotic bounds under certain assumptions.' author: - first_name: Chao full_name: Chen, Chao id: 3E92416E-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Michael full_name: Kerber, Michael id: 36E4574A-F248-11E8-B48F-1D18A9856A87 last_name: Kerber orcid: 0000-0002-8030-9299 citation: ama: 'Chen C, Kerber M. Persistent homology computation with a twist. In: TU Dortmund; 2011:197-200.' apa: 'Chen, C., & Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.' chicago: Chen, Chao, and Michael Kerber. “Persistent Homology Computation with a Twist,” 197–200. TU Dortmund, 2011. ieee: 'C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.' ista: 'Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.' mla: Chen, Chao, and Michael Kerber. Persistent Homology Computation with a Twist. TU Dortmund, 2011, pp. 197–200. short: C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200. conference: end_date: 2011-03-30 location: Morschach, Switzerland name: 'EuroCG: European Workshop on Computational Geometry' start_date: 2011-03-28 date_created: 2018-12-11T12:02:22Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:17Z day: '01' department: - _id: HeEd language: - iso: eng month: '01' oa_version: None page: 197 - 200 publication_status: published publisher: TU Dortmund publist_id: '3376' quality_controlled: '1' status: public title: Persistent homology computation with a twist type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3298' abstract: - lang: eng text: We present a new algorithm for enforcing incompressibility for Smoothed Particle Hydrodynamics (SPH) by preserving uniform density across the domain. We propose a hybrid method that uses a Poisson solve on a coarse grid to enforce a divergence free velocity field, followed by a local density correction of the particles. This avoids typical grid artifacts and maintains the Lagrangian nature of SPH by directly transferring pressures onto particles. Our method can be easily integrated with existing SPH techniques such as the incompressible PCISPH method as well as weakly compressible SPH by adding an additional force term. We show that this hybrid method accelerates convergence towards uniform density and permits a significantly larger time step compared to earlier approaches while producing similar results. We demonstrate our approach in a variety of scenarios with significant pressure gradients such as splashing liquids. author: - first_name: Karthik full_name: Raveendran, Karthik last_name: Raveendran - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Greg full_name: Turk, Greg last_name: Turk citation: ama: 'Raveendran K, Wojtan C, Turk G. Hybrid smoothed particle hydrodynamics. In: Spencer S, ed. ACM; 2011:33-42. doi:10.1145/2019406.2019411' apa: 'Raveendran, K., Wojtan, C., & Turk, G. (2011). Hybrid smoothed particle hydrodynamics. In S. Spencer (Ed.) (pp. 33–42). Presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada: ACM. https://doi.org/10.1145/2019406.2019411' chicago: Raveendran, Karthik, Chris Wojtan, and Greg Turk. “Hybrid Smoothed Particle Hydrodynamics.” edited by Stephen Spencer, 33–42. ACM, 2011. https://doi.org/10.1145/2019406.2019411. ieee: 'K. Raveendran, C. Wojtan, and G. Turk, “Hybrid smoothed particle hydrodynamics,” presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada, 2011, pp. 33–42.' ista: 'Raveendran K, Wojtan C, Turk G. 2011. Hybrid smoothed particle hydrodynamics. SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 33–42.' mla: Raveendran, Karthik, et al. Hybrid Smoothed Particle Hydrodynamics. Edited by Stephen Spencer, ACM, 2011, pp. 33–42, doi:10.1145/2019406.2019411. short: K. Raveendran, C. Wojtan, G. Turk, in:, S. Spencer (Ed.), ACM, 2011, pp. 33–42. conference: end_date: 2011-08-07 location: Vancouver, Canada name: 'SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation' start_date: 2011-08-05 date_created: 2018-12-11T12:02:32Z date_published: 2011-08-05T00:00:00Z date_updated: 2023-02-23T11:21:05Z day: '05' ddc: - '000' department: - _id: ChWo doi: 10.1145/2019406.2019411 editor: - first_name: Stephen full_name: Spencer, Stephen last_name: Spencer file: - access_level: open_access checksum: 6579d27709946e0eefbfa60a456b4913 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:44Z date_updated: 2020-07-14T12:46:06Z file_id: '4769' file_name: IST-2016-598-v1+1_HybridSPH_Preprint.pdf file_size: 2536216 relation: main_file file_date_updated: 2020-07-14T12:46:06Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 33 - 42 publication_status: published publisher: ACM publist_id: '3343' pubrep_id: '598' quality_controlled: '1' scopus_import: 1 status: public title: Hybrid smoothed particle hydrodynamics type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3297' abstract: - lang: eng text: "Animating detailed liquid surfaces has always been a challenge for computer graphics researchers and visual effects artists. Over the past few years, researchers in this field have focused on mesh-based surface tracking to synthesize extremely detailed liquid surfaces as efficiently as possible. This course provides a solid understanding of the steps required to create a fluid simulator with a mesh-based liquid surface.\r\n\r\nThe course begins with an overview of several existing liquid-surface-tracking techniques and the pros and cons of each method. Then it explains how to embed a triangle mesh into a finite-difference-based fluid simulator and describes several methods for allowing the liquid surface to merge together or break apart. The final section showcases the benefits and further applications of a mesh-based liquid surface, highlighting state-of-the-art methods for tracking colors and textures, maintaining liquid volume, preserving small surface features, and simulating realistic surface-tension waves." article_number: '8' author: - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Matthias full_name: Müller Fischer, Matthias last_name: Müller Fischer - first_name: Tyson full_name: Brochu, Tyson last_name: Brochu citation: ama: 'Wojtan C, Müller Fischer M, Brochu T. Liquid simulation with mesh-based surface tracking. In: ACM; 2011. doi:10.1145/2037636.2037644' apa: 'Wojtan, C., Müller Fischer, M., & Brochu, T. (2011). Liquid simulation with mesh-based surface tracking. Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada: ACM. https://doi.org/10.1145/2037636.2037644' chicago: Wojtan, Chris, Matthias Müller Fischer, and Tyson Brochu. “Liquid Simulation with Mesh-Based Surface Tracking.” ACM, 2011. https://doi.org/10.1145/2037636.2037644. ieee: 'C. Wojtan, M. Müller Fischer, and T. Brochu, “Liquid simulation with mesh-based surface tracking,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada, 2011.' ista: 'Wojtan C, Müller Fischer M, Brochu T. 2011. Liquid simulation with mesh-based surface tracking. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 8.' mla: Wojtan, Chris, et al. Liquid Simulation with Mesh-Based Surface Tracking. 8, ACM, 2011, doi:10.1145/2037636.2037644. short: C. Wojtan, M. Müller Fischer, T. Brochu, in:, ACM, 2011. conference: end_date: 2011-08-11 location: Vancouver, BC, Canada name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques' start_date: 2011-08-07 date_created: 2018-12-11T12:02:31Z date_published: 2011-08-07T00:00:00Z date_updated: 2023-02-23T11:21:02Z day: '07' ddc: - '000' department: - _id: ChWo doi: 10.1145/2037636.2037644 file: - access_level: open_access checksum: 8d508ad7c82f50978acbaa4170ee0a75 content_type: application/pdf creator: system date_created: 2018-12-12T10:13:34Z date_updated: 2020-07-14T12:46:06Z file_id: '5018' file_name: IST-2016-599-v1+1_meshyFluidsCourseSIGGRAPH2011.pdf file_size: 34672096 relation: main_file file_date_updated: 2020-07-14T12:46:06Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version publication_status: published publisher: ACM publist_id: '3344' pubrep_id: '599' quality_controlled: '1' scopus_import: 1 status: public title: Liquid simulation with mesh-based surface tracking type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3290' abstract: - lang: eng text: 'Analysis of genomic data requires an efficient way to calculate likelihoods across very large numbers of loci. We describe a general method for finding the distribution of genealogies: we allow migration between demes, splitting of demes [as in the isolation-with-migration (IM) model], and recombination between linked loci. These processes are described by a set of linear recursions for the generating function of branch lengths. Under the infinite-sites model, the probability of any configuration of mutations can be found by differentiating this generating function. Such calculations are feasible for small numbers of sampled genomes: as an example, we show how the generating function can be derived explicitly for three genes under the two-deme IM model. This derivation is done automatically, using Mathematica. Given data from a large number of unlinked and nonrecombining blocks of sequence, these results can be used to find maximum-likelihood estimates of model parameters by tabulating the probabilities of all relevant mutational configurations and then multiplying across loci. The feasibility of the method is demonstrated by applying it to simulated data and to a data set previously analyzed by Wang and Hey (2010) consisting of 26,141 loci sampled from Drosophila simulans and D. melanogaster. Our results suggest that such likelihood calculations are scalable to genomic data as long as the numbers of sampled individuals and mutations per sequence block are small.' author: - first_name: Konrad full_name: Lohse, Konrad last_name: Lohse - first_name: Richard full_name: Harrison, Richard last_name: Harrison - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Lohse K, Harrison R, Barton NH. A general method for calculating likelihoods under the coalescent process. Genetics. 2011;189(3):977-987. doi:10.1534/genetics.111.129569 apa: Lohse, K., Harrison, R., & Barton, N. H. (2011). A general method for calculating likelihoods under the coalescent process. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.111.129569 chicago: Lohse, Konrad, Richard Harrison, and Nicholas H Barton. “A General Method for Calculating Likelihoods under the Coalescent Process.” Genetics. Genetics Society of America, 2011. https://doi.org/10.1534/genetics.111.129569. ieee: K. Lohse, R. Harrison, and N. H. Barton, “A general method for calculating likelihoods under the coalescent process,” Genetics, vol. 189, no. 3. Genetics Society of America, pp. 977–987, 2011. ista: Lohse K, Harrison R, Barton NH. 2011. A general method for calculating likelihoods under the coalescent process. Genetics. 189(3), 977–987. mla: Lohse, Konrad, et al. “A General Method for Calculating Likelihoods under the Coalescent Process.” Genetics, vol. 189, no. 3, Genetics Society of America, 2011, pp. 977–87, doi:10.1534/genetics.111.129569. short: K. Lohse, R. Harrison, N.H. Barton, Genetics 189 (2011) 977–987. date_created: 2018-12-11T12:02:29Z date_published: 2011-11-01T00:00:00Z date_updated: 2021-01-12T07:42:26Z day: '01' department: - _id: NiBa doi: 10.1534/genetics.111.129569 ec_funded: 1 intvolume: ' 189' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3213358/ month: '11' oa: 1 oa_version: Submitted Version page: 977 - 987 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Genetics publication_status: published publisher: Genetics Society of America publist_id: '3355' quality_controlled: '1' scopus_import: 1 status: public title: A general method for calculating likelihoods under the coalescent process type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 189 year: '2011' ... --- _id: '3312' abstract: - lang: eng text: We study the 3D reconstruction of plant roots from multiple 2D images. To meet the challenge caused by the delicate nature of thin branches, we make three innovations to cope with the sensitivity to image quality and calibration. First, we model the background as a harmonic function to improve the segmentation of the root in each 2D image. Second, we develop the concept of the regularized visual hull which reduces the effect of jittering and refraction by ensuring consistency with one 2D image. Third, we guarantee connectedness through adjustments to the 3D reconstruction that minimize global error. Our software is part of a biological phenotype/genotype study of agricultural root systems. It has been tested on more than 40 plant roots and results are promising in terms of reconstruction quality and efficiency. acknowledgement: This research is supported by the National Science Foundation (NSF) under grant DBI-0820624. article_number: '6126475' article_processing_charge: No author: - first_name: Ying full_name: Zheng, Ying last_name: Zheng - first_name: Steve full_name: Gu, Steve last_name: Gu - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Carlo full_name: Tomasi, Carlo last_name: Tomasi - first_name: Philip full_name: Benfey, Philip last_name: Benfey citation: ama: Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. Detailed Reconstruction of 3D Plant Root Shape. IEEE; 2011. doi:10.1109/ICCV.2011.6126475 apa: 'Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., & Benfey, P. (2011). Detailed reconstruction of 3D plant root shape. Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126475' chicago: Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey. Detailed Reconstruction of 3D Plant Root Shape. Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126475. ieee: Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011. ista: Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction of 3D plant root shape, IEEE,p. mla: Zheng, Ying, et al. “Detailed Reconstruction of 3D Plant Root Shape.” Proceedings of the IEEE International Conference on Computer Vision, 6126475, IEEE, 2011, doi:10.1109/ICCV.2011.6126475. short: Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, P. Benfey, Detailed Reconstruction of 3D Plant Root Shape, IEEE, 2011. conference: end_date: 2011-11-13 location: Barcelona, Spain name: 'ICCV: International Conference on Computer Vision' start_date: 2011-11-06 date_created: 2018-12-11T12:02:36Z date_published: 2011-12-31T00:00:00Z date_updated: 2020-07-14T23:03:43Z day: '31' ddc: - '000' department: - _id: HeEd doi: 10.1109/ICCV.2011.6126475 file: - access_level: open_access checksum: 30a33564b7b45a7ee31610898267fd0e content_type: application/pdf creator: system date_created: 2018-12-12T10:09:04Z date_updated: 2020-07-14T12:46:07Z file_id: '4727' file_name: IST-2016-541-v1+1_2011-P-07-RootReconstruction.pdf file_size: 5622728 relation: main_file file_date_updated: 2020-07-14T12:46:07Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Submitted Version publication: Proceedings of the IEEE International Conference on Computer Vision publication_status: published publisher: IEEE publist_id: '3328' pubrep_id: '541' quality_controlled: '1' status: public title: Detailed reconstruction of 3D plant root shape type: conference_poster user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3313' abstract: - lang: eng text: Interpreting an image as a function on a compact sub- set of the Euclidean plane, we get its scale-space by diffu- sion, spreading the image over the entire plane. This gener- ates a 1-parameter family of functions alternatively defined as convolutions with a progressively wider Gaussian ker- nel. We prove that the corresponding 1-parameter family of persistence diagrams have norms that go rapidly to zero as time goes to infinity. This result rationalizes experimental observations about scale-space. We hope this will lead to targeted improvements of related computer vision methods. article_number: '6126271' author: - first_name: Chao full_name: Chen, Chao id: 3E92416E-F248-11E8-B48F-1D18A9856A87 last_name: Chen - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: 'Chen C, Edelsbrunner H. Diffusion runs low on persistence fast. In: Proceedings of the IEEE International Conference on Computer Vision. IEEE; 2011. doi:10.1109/ICCV.2011.6126271' apa: 'Chen, C., & Edelsbrunner, H. (2011). Diffusion runs low on persistence fast. In Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126271' chicago: Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” In Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126271. ieee: C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011. ista: 'Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings of the IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision, 6126271.' mla: Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” Proceedings of the IEEE International Conference on Computer Vision, 6126271, IEEE, 2011, doi:10.1109/ICCV.2011.6126271. short: C. Chen, H. Edelsbrunner, in:, Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011. conference: end_date: 2011-11-13 location: Barcelona, Spain name: 'ICCV: International Conference on Computer Vision' start_date: 2011-11-06 date_created: 2018-12-11T12:02:37Z date_published: 2011-11-06T00:00:00Z date_updated: 2021-01-12T07:42:35Z day: '06' ddc: - '000' department: - _id: HeEd doi: 10.1109/ICCV.2011.6126271 file: - access_level: open_access checksum: 6984684081ba123808b344f9f2e64a8f content_type: application/pdf creator: system date_created: 2018-12-12T10:17:28Z date_updated: 2020-07-14T12:46:07Z file_id: '5282' file_name: IST-2016-540-v1+1_2011-P-08-RunEmpty.pdf file_size: 614050 relation: main_file file_date_updated: 2020-07-14T12:46:07Z has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version publication: Proceedings of the IEEE International Conference on Computer Vision publication_status: published publisher: IEEE publist_id: '3327' pubrep_id: '540' quality_controlled: '1' scopus_import: 1 status: public title: Diffusion runs low on persistence fast type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3311' abstract: - lang: eng text: Alpha shapes have been conceived in 1981 as an attempt to define the shape of a finite set of point in the plane. Since then, connections to diverse areas in the sciences and engineering have developed, including to pattern recognition, digital shape sampling and processing, and structural molecular biology. This survey begins with a historical account and discusses geometric, algorithmic, topological, and combinatorial aspects of alpha shapes in this sequence. article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: 'Edelsbrunner H. Alpha shapes - a survey. In: van de Weygaert R, Vegter G, Ritzerveld J, Icke V, eds. Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.' apa: 'Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G. Vegter, J. Ritzerveld, & V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.' chicago: 'Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited by R van de Weygaert, G Vegter, J Ritzerveld, and V Icke. Springer, n.d.' ieee: 'H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.' ista: 'Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. .' mla: 'Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited by R van de Weygaert et al., Springer.' short: 'H. Edelsbrunner, in:, R. van de Weygaert, G. Vegter, J. Ritzerveld, V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, Springer, n.d.' date_created: 2018-12-11T12:02:36Z date_published: 2011-12-31T00:00:00Z date_updated: 2022-05-24T07:56:30Z day: '31' ddc: - '510' department: - _id: HeEd editor: - first_name: R full_name: van de Weygaert, R last_name: van de Weygaert - first_name: G full_name: Vegter, G last_name: Vegter - first_name: J full_name: Ritzerveld, J last_name: Ritzerveld - first_name: V full_name: Icke, V last_name: Icke file: - access_level: open_access checksum: a592ea438351e7280eea993a7713ab8f content_type: application/pdf creator: dernst date_created: 2022-05-24T07:55:05Z date_updated: 2022-05-24T07:55:05Z file_id: '11408' file_name: 2010_AlphaShapes.pdf file_size: 475254 relation: main_file success: 1 file_date_updated: 2022-05-24T07:55:05Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Submitted Version publication: 'Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings' publication_status: inpress publisher: Springer publist_id: '3329' quality_controlled: '1' status: public title: Alpha shapes - a survey type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3326' abstract: - lang: eng text: 'Weighted automata map input words to numerical values. Ap- plications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. A weighted au- tomaton is defined with respect to a semiring. For the tropical semiring, the weight of a run is the sum of the weights of the transitions taken along the run, and the value of a word is the minimal weight of an accepting run on it. In the 90’s, Krob studied the decidability of problems on rational series defined with respect to the tropical semiring. Rational series are strongly related to weighted automata, and Krob’s results apply to them. In par- ticular, it follows from Krob’s results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata defined with respect to the tropical semir- ing with domain ∪ {∞}, and that the equality problem is undecidable when the domain is ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob’s reasoning, make the un- decidability result accessible to the automata-theoretic community, and strengthen it to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights on the transitions are from the set {−1, 0, 1}. The fact we work directly with the automata enables us to tighten also the decidability re- sults and to show that the universality problem for weighted automata defined with respect to the tropical semiring with domain ∪ {∞}, and in fact even with domain ≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of containment vs. universality and the front of the ∪ {∞} vs. the ∪ {∞} domains.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Shaull full_name: Almagor, Shaull last_name: Almagor - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: 'Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37' apa: 'Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37' chicago: Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37. ieee: 'S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.' ista: 'Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.' mla: Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37. short: S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491. conference: end_date: 2011-10-14 location: Taipei, Taiwan name: 'ATVA: Automated Technology for Verification and Analysis' start_date: 2011-10-11 date_created: 2018-12-11T12:02:41Z date_published: 2011-10-14T00:00:00Z date_updated: 2021-01-12T07:42:40Z day: '14' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-24372-1_37 file: - access_level: open_access checksum: a7ca08a2cb1b6925f4c18a3034ae5659 content_type: application/pdf creator: dernst date_created: 2020-05-19T16:08:32Z date_updated: 2020-07-14T12:46:07Z file_id: '7868' file_name: 2011_LNCS_Almagor.pdf file_size: 182309 relation: main_file file_date_updated: 2020-07-14T12:46:07Z has_accepted_license: '1' intvolume: ' 6996' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 482 - 491 publication_status: published publisher: Springer publist_id: '3309' quality_controlled: '1' status: public title: 'What’s decidable about weighted automata ' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6996 year: '2011' ... --- _id: '3325' abstract: - lang: eng text: We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of data values, tagged with symbols from a finite set, over a potentially infinite data do- main that supports only the operations of equality and ordering. The transducer uses a finite set of states, a finite set of variables ranging over the data domain, and a finite set of variables ranging over data strings. At every step, it can make decisions based on the next in- put symbol, updating its state, remembering the input data value in its data variables, and updating data-string variables by concatenat- ing data-string variables and new symbols formed from data vari- ables, while avoiding duplication. We establish that the problems of checking functional equivalence of two streaming transducers, and of checking whether a streaming transducer satisfies pre/post verification conditions specified by streaming acceptors over in- put/output data-strings, are in PSPACE. We identify a class of imperative and a class of functional pro- grams, manipulating lists of data items, which can be effectively translated to streaming data-string transducers. The imperative pro- grams dynamically modify a singly-linked heap by changing next- pointers of heap-nodes and by adding new nodes. The main re- striction specifies how the next-pointers can be used for traversal. We also identify an expressively equivalent fragment of functional programs that traverse a list using syntactically restricted recursive calls. Our results lead to algorithms for assertion checking and for checking functional equivalence of two programs, written possibly in different programming styles, for commonly used routines such as insert, delete, and reverse. article_processing_charge: No author: - first_name: Rajeev full_name: Alur, Rajeev last_name: Alur - first_name: Pavol full_name: Cerny, Pavol id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87 last_name: Cerny citation: ama: 'Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454' apa: 'Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454' chicago: Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. https://doi.org/10.1145/1926385.1926454. ieee: 'R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.' ista: 'Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.' mla: Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454. short: R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610. conference: end_date: 2011-01-28 location: Texas, USA name: 'POPL: Principles of Programming Languages' start_date: 2011-01-26 date_created: 2018-12-11T12:02:41Z date_published: 2011-01-26T00:00:00Z date_updated: 2022-03-21T08:12:51Z day: '26' department: - _id: ToHe doi: 10.1145/1926385.1926454 intvolume: ' 46' issue: '1' language: - iso: eng month: '01' oa_version: None page: 599 - 610 publication_status: published publisher: ACM publist_id: '3310' quality_controlled: '1' scopus_import: '1' status: public title: Streaming transducers for algorithmic verification of single pass list processing programs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 46 year: '2011' ... --- _id: '3324' abstract: - lang: eng text: 'Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program''s transition relation and then show that the relational abstraction is well-founded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear arithmetic) to express them. We believe we can significantly increase the class of programs that are amenable to automated termination proofs by identifying more expressive decidable logics for reasoning about well-founded relations. We therefore present a new decision procedure for reasoning about multiset orderings, which are among the most powerful orderings used to prove termination. We show that, using our decision procedure, one can automatically prove termination of natural abstractions of programs.' alternative_title: - LNCS author: - first_name: Ruzica full_name: Piskac, Ruzica last_name: Piskac - first_name: Thomas full_name: Wies, Thomas id: 447BFB88-F248-11E8-B48F-1D18A9856A87 last_name: Wies citation: ama: 'Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26' apa: 'Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26' chicago: Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26. ieee: 'R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.' ista: 'Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386.' mla: Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26. short: R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386. conference: end_date: 2011-01-25 location: Texas, USA name: 'VMCAI: Verification Model Checking and Abstract Interpretation' start_date: 2011-01-23 date_created: 2018-12-11T12:02:40Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:39Z day: '01' department: - _id: ToHe doi: 10.1007/978-3-642-18275-4_26 editor: - first_name: Ranjit full_name: Jhala, Ranjit last_name: Jhala - first_name: David full_name: Schmidt, David last_name: Schmidt intvolume: ' 6538' language: - iso: eng main_file_link: - open_access: '1' url: https://infoscience.epfl.ch/record/170697/ month: '01' oa: 1 oa_version: Submitted Version page: 371 - 386 publication_status: published publisher: Springer publist_id: '3311' quality_controlled: '1' scopus_import: 1 status: public title: Decision procedures for automating termination proofs type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6538 year: '2011' ... --- _id: '3327' abstract: - lang: eng text: We solve the open problems of translating, when possible, all common classes of nondeterministic word automata to deterministic and nondeterministic co-Büchi word automata. The handled classes include Büchi, parity, Rabin, Streett and Muller automata. The translations follow a unified approach and are all asymptotically tight. The problem of translating Büchi automata to equivalent co-Büchi automata was solved in [2], leaving open the problems of translating automata with richer acceptance conditions. For these classes, one cannot easily extend or use the construction in [2]. In particular, going via an intermediate Büchi automaton is not optimal and might involve a blow-up exponentially higher than the known lower bound. Other known translations are also not optimal and involve a doubly exponential blow-up. We describe direct, simple, and asymptotically tight constructions, involving a 2Θ(n) blow-up. The constructions are variants of the subset construction, and allow for symbolic implementations. Beyond the theoretical importance of the results, the new constructions have various applications, among which is an improved algorithm for translating, when possible, LTL formulas to deterministic Büchi word automata. alternative_title: - LNCS author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: 'Boker U, Kupferman O. Co-Büching them all. In: Hofmann M, ed. Vol 6604. Springer; 2011:184-198. doi:10.1007/978-3-642-19805-2_13' apa: 'Boker, U., & Kupferman, O. (2011). Co-Büching them all. In M. Hofmann (Ed.) (Vol. 6604, pp. 184–198). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Saarbrücken, Germany: Springer. https://doi.org/10.1007/978-3-642-19805-2_13' chicago: Boker, Udi, and Orna Kupferman. “Co-Büching Them All.” edited by Martin Hofmann, 6604:184–98. Springer, 2011. https://doi.org/10.1007/978-3-642-19805-2_13. ieee: 'U. Boker and O. Kupferman, “Co-Büching them all,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Saarbrücken, Germany, 2011, vol. 6604, pp. 184–198.' ista: 'Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6604, 184–198.' mla: Boker, Udi, and Orna Kupferman. Co-Büching Them All. Edited by Martin Hofmann, vol. 6604, Springer, 2011, pp. 184–98, doi:10.1007/978-3-642-19805-2_13. short: U. Boker, O. Kupferman, in:, M. Hofmann (Ed.), Springer, 2011, pp. 184–198. conference: end_date: 2011-04-03 location: Saarbrücken, Germany name: 'FoSSaCS: Foundations of Software Science and Computation Structures' start_date: 2011-03-26 date_created: 2018-12-11T12:02:41Z date_published: 2011-03-29T00:00:00Z date_updated: 2021-01-12T07:42:41Z day: '29' doi: 10.1007/978-3-642-19805-2_13 editor: - first_name: Martin full_name: Hofmann, Martin last_name: Hofmann extern: '1' intvolume: ' 6604' language: - iso: eng month: '03' oa_version: None page: 184 - 198 publication_status: published publisher: Springer publist_id: '3308' quality_controlled: '1' status: public title: Co-Büching them all type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6604 year: '2011' ... --- _id: '3337' abstract: - lang: eng text: Playing table tennis is a difficult task for robots, especially due to their limitations of acceleration. A key bottleneck is the amount of time needed to reach the desired hitting position and velocity of the racket for returning the incoming ball. Here, it often does not suffice to simply extrapolate the ball's trajectory after the opponent returns it but more information is needed. Humans are able to predict the ball's trajectory based on the opponent's moves and, thus, have a considerable advantage. Hence, we propose to incorporate an anticipation system into robot table tennis players, which enables the robot to react earlier while the opponent is performing the striking movement. Based on visual observation of the opponent's racket movement, the robot can predict the aim of the opponent and adjust its movement generation accordingly. The policies for deciding how and when to react are obtained by reinforcement learning. We conduct experiments with an existing robot player to show that the learned reaction policy can significantly improve the performance of the overall system. author: - first_name: Zhikun full_name: Wang, Zhikun last_name: Wang - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Katharina full_name: Mülling, Katharina last_name: Mülling - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Jan full_name: Peters, Jan last_name: Peters citation: ama: 'Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. Learning anticipation policies for robot table tennis. In: IEEE; 2011:332-337. doi:10.1109/IROS.2011.6094892' apa: 'Wang, Z., Lampert, C., Mülling, K., Schölkopf, B., & Peters, J. (2011). Learning anticipation policies for robot table tennis (pp. 332–337). Presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA: IEEE. https://doi.org/10.1109/IROS.2011.6094892' chicago: Wang, Zhikun, Christoph Lampert, Katharina Mülling, Bernhard Schölkopf, and Jan Peters. “Learning Anticipation Policies for Robot Table Tennis,” 332–37. IEEE, 2011. https://doi.org/10.1109/IROS.2011.6094892. ieee: 'Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, and J. Peters, “Learning anticipation policies for robot table tennis,” presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA, 2011, pp. 332–337.' ista: 'Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. 2011. Learning anticipation policies for robot table tennis. IROS: RSJ International Conference on Intelligent Robots and Systems, 332–337.' mla: Wang, Zhikun, et al. Learning Anticipation Policies for Robot Table Tennis. IEEE, 2011, pp. 332–37, doi:10.1109/IROS.2011.6094892. short: Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, J. Peters, in:, IEEE, 2011, pp. 332–337. conference: end_date: 2011-09-30 location: San Francisco, USA name: 'IROS: RSJ International Conference on Intelligent Robots and Systems' start_date: 2011-09-25 date_created: 2018-12-11T12:02:45Z date_published: 2011-01-01T00:00:00Z date_updated: 2021-01-12T07:42:45Z day: '01' department: - _id: ChLa doi: 10.1109/IROS.2011.6094892 language: - iso: eng month: '01' oa_version: None page: 332 - 337 publication_status: published publisher: IEEE publist_id: '3293' quality_controlled: '1' scopus_import: 1 status: public title: Learning anticipation policies for robot table tennis type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3339' abstract: - lang: eng text: 'Turn-based stochastic games and its important subclass Markov decision processes (MDPs) provide models for systems with both probabilistic and nondeterministic behaviors. We consider turn-based stochastic games with two classical quantitative objectives: discounted-sum and long-run average objectives. The game models and the quantitative objectives are widely used in probabilistic verification, planning, optimal inventory control, network protocol and performance analysis. Games and MDPs that model realistic systems often have very large state spaces, and probabilistic abstraction techniques are necessary to handle the state-space explosion. The commonly used full-abstraction techniques do not yield space-savings for systems that have many states with similar value, but does not necessarily have similar transition structure. A semi-abstraction technique, namely Magnifying-lens abstractions (MLA), that clusters states based on value only, disregarding differences in their transition relation was proposed for qualitative objectives (reachability and safety objectives). In this paper we extend the MLA technique to solve stochastic games with discounted-sum and long-run average objectives. We present the MLA technique based abstraction-refinement algorithm for stochastic games and MDPs with discounted-sum objectives. For long-run average objectives, our solution works for all MDPs and a sub-class of stochastic games where every state has the same value. ' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Luca full_name: De Alfaro, Luca last_name: De Alfaro - first_name: Roy full_name: Pritam, Roy last_name: Pritam citation: ama: Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. 2011. apa: Chatterjee, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv. chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011. ieee: K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011. ista: Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, . mla: Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011. short: K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011). date_created: 2018-12-11T12:02:46Z date_published: 2011-07-11T00:00:00Z date_updated: 2021-01-12T07:42:46Z day: '11' department: - _id: KrCh external_id: arxiv: - '1107.2132' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1107.2132 month: '07' oa: 1 oa_version: Preprint page: '17' publication: arXiv publication_status: published publisher: ArXiv publist_id: '3286' status: public title: Magnifying lens abstraction for stochastic games with discounted and long-run average objectives type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3342' abstract: - lang: eng text: 'We consider Markov decision processes (MDPs) with ω-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for Büchi objectives (a special case of parity objectives). Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs with Büchi objectives; our algorithm takes O(nm) symbolic steps as compared to the previous known algorithm that takes O(n 2) symbolic steps, where n is the number of states and m is the number of edges of the MDP. In practice MDPs often have constant out-degree, and then our symbolic algorithm takes O(nn) symbolic steps, as compared to the previous known O(n 2) symbolic steps algorithm. Second, we present a new algorithm, namely win-lose algorithm, with the following two properties: (a) the algorithm iteratively computes subsets of the almost-sure winning set and its complement, as compared to all previous algorithms that discover the almost-sure winning set upon termination; and (b) requires O(nK) symbolic steps, where K is the maximal number of edges of strongly connected components (scc’s) of the MDP. The win-lose algorithm requires symbolic computation of scc’s. Third, we improve the algorithm for symbolic scc computation; the previous known algorithm takes linear symbolic steps, and our new algorithm improves the constants associated with the linear number of steps. In the worst case the previous known algorithm takes 5·n symbolic steps, whereas our new algorithm takes 4 ·n symbolic steps.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Manas full_name: Joglekar, Manas last_name: Joglekar - first_name: Shah full_name: Nisarg, Shah last_name: Nisarg citation: ama: 'Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:10.1007/978-3-642-22110-1_21' apa: 'Chatterjee, K., Henzinger, M. H., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21' chicago: Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_21. ieee: 'K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.' ista: 'Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.' mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21. short: K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276. conference: end_date: 2011-07-20 location: Snowbird, USA name: 'CAV: Computer Aided Verification' start_date: 2011-07-14 date_created: 2018-12-11T12:02:47Z date_published: 2011-08-11T00:00:00Z date_updated: 2023-02-23T11:00:13Z day: '11' department: - _id: KrCh doi: 10.1007/978-3-642-22110-1_21 editor: - first_name: Ganesh full_name: Gopalakrishnan, Ganesh last_name: Gopalakrishnan - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer external_id: arxiv: - '1104.3348' intvolume: ' 6806' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.3348 month: '08' oa: 1 oa_version: Preprint page: 260 - 276 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3282' quality_controlled: '1' related_material: record: - id: '2831' relation: later_version status: public status: public title: Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives type: conference user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 6806 year: '2011' ... --- _id: '3347' abstract: - lang: eng text: 'The class of omega-regular languages provides a robust specification language in verification. Every omega-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens "eventually". Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness. It requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider automata with finitary acceptance conditions defined by finitary Buchi, parity and Streett languages. We study languages expressible by such automata: we give their topological complexity and present a regular-expression characterization. We compare the expressive power of finitary automata and give optimal algorithms for classical decisions questions. We show that the finitary languages are Sigma 2-complete; we present a complete picture of the expressive power of various classes of automata with finitary and infinitary acceptance conditions; we show that the languages defined by finitary parity automata exactly characterize the star-free fragment of omega B-regular languages; and we show that emptiness is NLOGSPACE-complete and universality as well as language inclusion are PSPACE-complete for finitary parity and Streett automata.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nathanaël full_name: Fijalkow, Nathanaël id: A1B5DD72-E997-11E9-8398-E808B6C6ADC0 last_name: Fijalkow citation: ama: 'Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16' apa: 'Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16' chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16. ieee: 'K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.' ista: 'Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.' mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages. Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16. short: K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226. conference: end_date: 2011-05-31 location: Tarragona, Spain name: 'LATA: Language and Automata Theory and Applications' start_date: 2011-05-26 date_created: 2018-12-11T12:02:48Z date_published: 2011-06-16T00:00:00Z date_updated: 2021-01-12T07:42:50Z day: '16' department: - _id: KrCh doi: 10.1007/978-3-642-21254-3_16 external_id: arxiv: - '1101.1727' intvolume: ' 6638' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1101.1727 month: '06' oa: 1 oa_version: Preprint page: 216 - 226 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3274' quality_controlled: '1' scopus_import: 1 status: public title: Finitary languages type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6638 year: '2011' ... --- _id: '3346' abstract: - lang: eng 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 k reward 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 single-objective case, both randomization and memory are necessary for strategies, and that finite-memory randomized strategies are sufficient. Under the satisfaction objective, in contrast to the single-objective case, infinite memory is necessary for strategies, and that randomized memoryless strategies are sufficient for epsilon-approximation, for all epsilon>;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 epsilon-approximated in time polynomial in the size of the MDP and 1/epsilon, and exponential in the number of reward functions, for all epsilon>;0. Our results also reveal flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, correct the flaws and obtain improved results. article_number: '5970225' author: - first_name: Tomáš full_name: Brázdil, Tomáš last_name: Brázdil - first_name: Václav full_name: Brožek, Václav last_name: Brožek - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Vojtěch full_name: Forejt, Vojtěch last_name: Forejt - first_name: Antonín full_name: Kučera, Antonín last_name: Kučera citation: ama: 'Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:10.1109/LICS.2011.10' apa: 'Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10' chicago: Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.10. ieee: 'T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.' ista: 'Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.' mla: Brázdil, Tomáš, et al. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10. short: T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011. conference: end_date: 2011-06-24 location: Toronto, Canada name: 'LICS: Logic in Computer Science' start_date: 2011-06-21 date_created: 2018-12-11T12:02:48Z date_published: 2011-06-21T00:00:00Z date_updated: 2021-01-12T07:42:49Z day: '21' department: - _id: KrCh doi: 10.1109/LICS.2011.10 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1104.3489 month: '06' oa: 1 oa_version: Submitted Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication_status: published publisher: IEEE publist_id: '3275' quality_controlled: '1' scopus_import: 1 status: public title: Two views on multiple mean payoff objectives in Markov Decision Processes type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3348' abstract: - lang: eng text: We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two-player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a linear (in the number of clocks) number of memory bits. Precisely, we show that for safety objectives, a memory of size (3 · |C|+lg(|C|+1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential bound. We also settle the open question of whether winning region controller strategies require memory for safety objectives by showing with an example the necessity of memory for region strategies to win for safety objectives. author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Vinayak full_name: Prabhu, Vinayak last_name: Prabhu citation: ama: 'Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:10.1145/1967701.1967734' apa: 'Chatterjee, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734' chicago: Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734. ieee: 'K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.' ista: 'Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.' mla: Chatterjee, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734. short: K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230. conference: end_date: 2011-04-14 location: Chicago, USA name: 'HSCC: Hybrid Systems - Computation and Control' start_date: 2011-04-12 date_created: 2018-12-11T12:02:49Z date_published: 2011-01-31T00:00:00Z date_updated: 2021-01-12T07:42:50Z day: '31' department: - _id: KrCh doi: 10.1145/1967701.1967734 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1101.5842 month: '01' oa: 1 oa_version: Submitted Version page: 221 - 230 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '3273' quality_controlled: '1' scopus_import: 1 status: public title: Synthesis of memory efficient real time controllers for safety objectives type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3344' abstract: - lang: eng text: 'Games played on graphs provide the mathematical framework to analyze several important problems in computer science as well as mathematics, such as the synthesis problem of Church, model checking of open reactive systems and many others. On the basis of mode of interaction of the players these games can be classified as follows: (a) turn-based (players make moves in turns); and (b) concurrent (players make moves simultaneously). On the basis of the information available to the players these games can be classified as follows: (a) perfect-information (players have perfect view of the game); and (b) partial-information (players have partial view of the game). In this talk we will consider all these classes of games with reachability objectives, where the goal of one player is to reach a set of target vertices of the graph, and the goal of the opponent player is to prevent the player from reaching the target. We will survey the results for various classes of games, and the results range from linear time decision algorithms to EXPTIME-complete problems to undecidable problems.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:10.1007/978-3-642-24288-5_1' apa: 'Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1' chicago: Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. https://doi.org/10.1007/978-3-642-24288-5_1. ieee: 'K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.' ista: 'Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.' mla: Chatterjee, Krishnendu. Graph Games with Reachability Objectives. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:10.1007/978-3-642-24288-5_1. short: K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1. conference: end_date: 2011-09-30 location: Genoa, Italy name: 'RP: Reachability Problems' start_date: 2011-09-28 date_created: 2018-12-11T12:02:47Z date_published: 2011-10-15T00:00:00Z date_updated: 2021-01-12T07:42:48Z day: '15' department: - _id: KrCh doi: 10.1007/978-3-642-24288-5_1 editor: - first_name: Giorgo full_name: Delzanno, Giorgo last_name: Delzanno - first_name: Igor full_name: Potapov, Igor last_name: Potapov intvolume: ' 6945' language: - iso: eng month: '10' oa_version: None page: 1 - 1 publication_status: published publisher: Springer publist_id: '3277' quality_controlled: '1' status: public title: Graph games with reachability objectives type: conference user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 6945 year: '2011' ... --- _id: '3343' abstract: - lang: eng text: 'We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the almost sure winning set for reachability and parity objectives in MDPs. We achieve the following running time for static algorithms in MDPs with graphs of n vertices and m edges: (1) O(m · min{ √m, n2/3 }) for the mec decomposition, improving the longstanding O(m·n) bound; (2) O(m·n2/3) for reachability objectives, improving the previous O(m · √m) bound for m > n4/3; and (3) O(m · min{ √m, n2/3 } · log(d)) for parity objectives with d priorities, improving the previous O(m · √m · d) bound. We also give incremental and decremental algorithms in linear time for mec decomposition and reachability objectives and O(m · log d) time for parity ob jectives.' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: ama: 'Chatterjee K, Henzinger MH. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:10.1137/1.9781611973082.101' apa: 'Chatterjee, K., & Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. https://doi.org/10.1137/1.9781611973082.101' chicago: Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. https://doi.org/10.1137/1.9781611973082.101. ieee: 'K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.' ista: 'Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.' mla: Chatterjee, Krishnendu, and Monika H. Henzinger. Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SIAM, 2011, pp. 1318–36, doi:10.1137/1.9781611973082.101. short: K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336. conference: end_date: 2011-01-25 location: San Francisco, SA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2011-01-23 date_created: 2018-12-11T12:02:47Z date_published: 2011-01-01T00:00:00Z date_updated: 2023-02-14T10:36:10Z day: '01' department: - _id: KrCh doi: 10.1137/1.9781611973082.101 language: - iso: eng main_file_link: - open_access: '1' url: https://eprints.cs.univie.ac.at/21/ month: '01' oa: 1 oa_version: Submitted Version page: 1318 - 1336 publication_status: published publisher: SIAM publist_id: '3278' quality_controlled: '1' scopus_import: '1' status: public title: Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2011' ... --- _id: '3360' abstract: - lang: eng text: 'A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values 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 lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 < lambda < 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we 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. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. ' alternative_title: - LIPIcs author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: ama: 'Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82' apa: 'Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82' chicago: Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82. ieee: 'U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.' ista: 'Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.' mla: Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82. short: U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96. conference: end_date: 2011-09-15 location: Bergen, Norway name: 'CSL: Computer Science Logic' start_date: 2011-09-12 date_created: 2018-12-11T12:02:53Z date_published: 2011-08-31T00:00:00Z date_updated: 2021-01-12T07:42:56Z day: '31' ddc: - '004' department: - _id: ToHe doi: 10.4230/LIPIcs.CSL.2011.82 ec_funded: 1 file: - access_level: open_access checksum: 250603c6be8ccad4fbd4d7b24221f0ee content_type: application/pdf creator: system date_created: 2018-12-12T10:10:17Z date_updated: 2020-07-14T12:46:10Z file_id: '4803' file_name: IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf file_size: 504270 relation: main_file file_date_updated: 2020-07-14T12:46:10Z has_accepted_license: '1' intvolume: ' 12' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '08' oa: 1 oa_version: Published Version page: 82 - 96 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EFB36C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '215543' name: COMponent-Based Embedded Systems design Techniques - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F1337C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '214373' name: Design for Embedded Systems publication_status: published publisher: Springer publist_id: '3255' pubrep_id: '82' quality_controlled: '1' scopus_import: 1 status: public title: Determinizing discounted-sum automata tmp: image: /images/cc_by_nc_nd.png 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) short: CC BY-NC-ND (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2011' ...