---
res:
bibo_abstract:
- In the analysis of reactive systems a quantitative objective assigns a real value
to every trace of the system. The value decision problem for a quantitative objective
requires a trace whose value is at least a given threshold, and the exact value
decision problem requires a trace whose value is exactly the threshold. We compare
the computational complexity of the value and exact value decision problems for
classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff
for two standard models of reactive systems, namely, graphs and graph games.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Krishnendu
foaf_name: Chatterjee, Krishnendu
foaf_surname: Chatterjee
foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-4561-241X
- foaf_Person:
foaf_givenName: Laurent
foaf_name: Doyen, Laurent
foaf_surname: Doyen
- foaf_Person:
foaf_givenName: Thomas A
foaf_name: Henzinger, Thomas A
foaf_surname: Henzinger
foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
orcid: 0000−0002−2985−7724
bibo_doi: 10.1007/978-3-319-63121-9_18
bibo_volume: 10460
dct_date: 2017^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/03029743
dct_language: eng
dct_publisher: Springer@
dct_title: The cost of exactness in quantitative reachability@
...