@inproceedings{10.1007/978-3-319-96142-2_9,
Abstract = {The problem of quantitative inclusion formalizes the goal of comparing quantitative dimensions between systems such as worst-case execution time, resource consumption, and the like. Such systems are typically represented by formalisms such as weighted logics or weighted automata. Despite its significance in analyzing the quality of computing systems, the study of quantitative inclusion has mostly been conducted from a theoretical standpoint. In this work, we conduct the first empirical study of quantitative inclusion for discounted-sum weighted automata (DS-inclusion, in short).},
Address = {Cham},
Author = {Bansal, Suguman and Chaudhuri, Swarat and Vardi, Moshe Y.},
BookTitle = {Computer Aided Verification},
Editor = {Chockler, Hana and Weissenbacher, Georg},
File = {Bansal2018\_Chapter\_AutomataVsLinear-ProgrammingDi (0) - a - a - w.pdf},
ISBN = {978-3-319-96142-2},
Keywords = {citesme! and readme},
Pages = {99--116},
Publisher = {Springer International Publishing},
Title = {Automata vs Linear-Programming Discounted-Sum Inclusion},
Year = {2018},
date-added = {2018-07-26 20:57:01 +0000},
date-modified = {2018-07-27 07:18:56 +0000},
file-2 = {CAV18b (0) - a - a - w.pdf},
file-3 = {Paper (0) - a - a - w.pdf},
doi = {10.1007/978-3-319-96142-2_9}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A