---
_id: '3857'
abstract:
- lang: eng
text: We consider probabilistic automata on infinite words with acceptance defined
by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider
quantitative and qualitative decision problems. We present extensions and adaptations
of proofs for probabilistic finite automata and present an almost complete characterization
of the decidability and undecidability frontier of the quantitative and qualitative
decision problems for probabilistic automata on infinite words.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability
and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:10.1007/978-3-642-15643-4_1'
apa: 'Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite
words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented
at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore:
Springer. https://doi.org/10.1007/978-3-642-15643-4_1'
chicago: 'Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata
on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer,
2010. https://doi.org/10.1007/978-3-642-15643-4_1.'
ieee: 'K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words:
decidability and undecidability results,” presented at the ATVA: Automated Technology
for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.'
ista: 'Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words:
decidability and undecidability results. ATVA: Automated Technology for Verification
and Analysis, LNCS, vol. 6252, 1–16.'
mla: 'Chatterjee, Krishnendu, and Thomas A. Henzinger. Probabilistic Automata
on Infinite Words: Decidability and Undecidability Results. Vol. 6252, Springer,
2010, pp. 1–16, doi:10.1007/978-3-642-15643-4_1.'
short: K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.
conference:
end_date: 2010-09-24
location: Singapore, Singapore
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2010-09-21
corr_author: '1'
date_created: 2018-12-11T12:05:33Z
date_published: 2010-10-12T00:00:00Z
date_updated: 2024-10-09T21:08:23Z
day: '12'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-15643-4_1
ec_funded: 1
intvolume: ' 6252'
language:
- iso: eng
month: '10'
oa_version: None
page: 1 - 16
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '2324'
pubrep_id: '28'
quality_controlled: '1'
related_material:
record:
- id: '5392'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Probabilistic Automata on infinite words: decidability and undecidability
results'
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6252
year: '2010'
...
---
_id: '3858'
abstract:
- lang: eng
text: 'We consider two-player zero-sum games on graphs. On the basis of the information
available to the players these games can be classified as follows: (a) 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) complete-observation (both players have com- plete view of the game).
We survey the complexity results for the problem of de- ciding the winner in various
classes of partial-observation games with ω-regular winning conditions specified
as parity objectives. We present a reduction from the class of parity objectives
that depend on sequence of states of the game to the sub-class of parity objectives
that only depend on the sequence of observations. We also establish that partial-observation
acyclic games are PSPACE-complete.'
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. The complexity of partial-observation parity games.
In: Vol 6397. Springer; 2010:1-14. doi:10.1007/978-3-642-16242-8_1'
apa: 'Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation
parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming,
Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation
Parity Games,” 6397:1–14. Springer, 2010. https://doi.org/10.1007/978-3-642-16242-8_1.
ieee: 'K. Chatterjee and L. Doyen, “The complexity of partial-observation parity
games,” presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.'
ista: 'Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity
games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS,
vol. 6397, 1–14.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. The Complexity of Partial-Observation
Parity Games. Vol. 6397, Springer, 2010, pp. 1–14, doi:10.1007/978-3-642-16242-8_1.
short: K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.
conference:
end_date: 2010-10-15
location: Yogyakarta, Indonesia
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2010-10-10
corr_author: '1'
date_created: 2018-12-11T12:05:33Z
date_published: 2010-12-09T00:00:00Z
date_updated: 2025-09-30T09:34:35Z
day: '09'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-642-16242-8_1
external_id:
isi:
- '000288062700001'
file:
- access_level: open_access
checksum: 770e86e5d78c56fddb4786a8da7ef126
content_type: application/pdf
creator: dernst
date_created: 2020-05-19T16:29:04Z
date_updated: 2020-07-14T12:46:18Z
file_id: '7872'
file_name: 2010_LPAR_Chatterjee.pdf
file_size: 142836
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 6397'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 1 - 14
publication_status: published
publisher: Springer
publist_id: '2323'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The complexity of partial-observation parity games
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6397
year: '2010'
...
---
_id: '3859'
abstract:
- lang: eng
text: This book constitutes the proceedings of the 8th International Conference
on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg,
Austria in September 2010. The 14 papers presented were carefully reviewed and
selected from 31 submissions. In addition, the volume contains 3 invited talks
and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental
and practical aspects of timed systems, and to bring together researchers from
different disciplines that share an interest in the modeling and analysis of timed
systems. Typical topics include foundations and semantics, methods and tools,
and applications.
alternative_title:
- LNCS
citation:
ama: Chatterjee K, Henzinger TA, eds. Formal Modeling and Analysis of Timed Systems.
Vol 6246. Springer; 2010. doi:10.1007/978-3-642-15297-9
apa: 'Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling
and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal
Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9'
chicago: Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling
and Analysis of Timed Systems. Vol. 6246. Springer, 2010. https://doi.org/10.1007/978-3-642-15297-9.
ieee: K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of
timed systems, vol. 6246. Springer, 2010.
ista: Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed
systems, Springer,p.
mla: Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling
and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9.
short: K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed
Systems, Springer, 2010.
conference:
end_date: 2010-09-10
location: Klosterneuburg, Austria
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2010-09-08
corr_author: '1'
date_created: 2018-12-11T12:05:33Z
date_published: 2010-09-20T00:00:00Z
date_updated: 2024-10-09T20:54:05Z
day: '20'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-15297-9
editor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
intvolume: ' 6246'
language:
- iso: eng
month: '09'
oa_version: None
publication_status: published
publisher: Springer
publist_id: '2322'
quality_controlled: '1'
related_material:
link:
- description: eBook available via IST BookList
relation: other
url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721
status: public
title: Formal modeling and analysis of timed systems
type: conference_editor
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6246
year: '2010'
...
---
_id: '3860'
abstract:
- lang: eng
text: 'In mean-payoff games, the objective of the protagonist is to ensure that
the limit average of an infinite sequence of numeric weights is nonnegative. In
energy games, the objective is to ensure that the running sum of weights is always
nonnegative. Generalized mean-payoff and energy games replace individual weights
by tuples, and the limit average (resp. running sum) of each coordinate must be
(resp. remain) nonnegative. These games have applications in the synthesis of
resource-bounded processes with multiple resources. We prove the finite-memory
determinacy of generalized energy games and show the inter- reducibility of generalized
mean-payoff and energy games for finite-memory strategies. We also improve the
computational complexity for solving both classes of games with finite-memory
strategies: while the previously best known upper bound was EXPSPACE, and no lower
bound was known, we give an optimal coNP-complete bound. For memoryless strategies,
we show that the problem of deciding the existence of a winning strategy for the
protagonist is NP-complete.'
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and
energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516.
doi:10.4230/LIPIcs.FSTTCS.2010.505'
apa: 'Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized
mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, Chennai, India: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin.
“Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505.
ieee: 'K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff
and energy games,” presented at the FSTTCS: Foundations of Software Technology
and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.'
ista: 'Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff
and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer
Science, LIPIcs, vol. 8, 505–516.'
mla: Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games.
Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2010, pp. 505–516.
conference:
end_date: 2010-12-18
location: Chennai, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2010-12-15
corr_author: '1'
date_created: 2018-12-11T12:05:34Z
date_published: 2010-12-13T00:00:00Z
date_updated: 2025-09-30T09:33:50Z
day: '13'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2010.505
external_id:
isi:
- '000310361000043'
file:
- access_level: open_access
checksum: 1caabd6319b979927208117a41192637
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:27Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5147'
file_name: IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf
file_size: 178278
relation: main_file
- access_level: open_access
checksum: 3a59759ceeacdb5b578f3803d5e6769b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:28Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5148'
file_name: IST-2016-59-v2+1_2_1_.pdf
file_size: 477976
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Submitted Version
page: 505 - 516
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2321'
pubrep_id: '59'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generalized mean-payoff and energy games
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8
year: '2010'
...
---
_id: '3861'
abstract:
- lang: eng
text: We introduce strategy logic, a logic that treats strategies in two-player
games as explicit first-order objects. The explicit treatment of strategies allows
us to specify properties of nonzero-sum games in a simple and natural way. We
show that the one-alternation fragment of strategy logic is strong enough to express
the existence of Nash equilibria and secure equilibria, and subsumes other logics
that were introduced to reason about games, such as ATL, ATL*, and game logic.
We show that strategy logic is decidable, by constructing tree automata that recognize
sets of strategies. While for the general logic, our decision procedure is nonelementary,
for the simple fragment that is used above we show that the complexity is polynomial
in the size of the game graph and optimal in the size of the formula (ranging
from polynomial to 2EXPTIME depending on the form of the formula).
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: Chatterjee K, Henzinger TA, Piterman N. Strategy logic. Information and
Computation. 2010;208(6):677-693. doi:10.1016/j.ic.2009.07.004
apa: Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic.
Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy
Logic.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.07.004.
ieee: K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information
and Computation, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.
ista: Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information
and Computation. 208(6), 677–693.
mla: Chatterjee, Krishnendu, et al. “Strategy Logic.” Information and Computation,
vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.
short: K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208
(2010) 677–693.
corr_author: '1'
date_created: 2018-12-11T12:05:34Z
date_published: 2010-06-01T00:00:00Z
date_updated: 2025-09-30T09:32:18Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2009.07.004
external_id:
isi:
- '000278070100006'
file:
- access_level: open_access
checksum: 13bff93f3c2a014e2908145a4517f177
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:54Z
date_updated: 2020-07-14T12:46:18Z
file_id: '4911'
file_name: IST-2012-56-v1+1_Strategy_logic.pdf
file_size: 189120
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 208'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 677 - 693
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '2317'
pubrep_id: '56'
quality_controlled: '1'
related_material:
record:
- id: '3884'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Strategy logic
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 208
year: '2010'
...
---
_id: '3863'
abstract:
- lang: eng
text: 'We consider two-player parity games with imperfect information in which strategies
rely on observations that provide imperfect information about the history of a
play. To solve such games, i.e., to determine the winning regions of players and
corresponding winning strategies, one can use the subset construction to build
an equivalent perfect-information game. Recently, an algorithm that avoids the
inefficient subset construction has been proposed. The algorithm performs a fixed-point
computation in a lattice of antichains, thus maintaining a succinct representation
of state sets. However, this representation does not allow to recover winning
strategies. In this paper, we build on the antichain approach to develop an algorithm
for constructing the winning strategies in parity games of imperfect information.
One major obstacle in adapting the classical procedure is that the complementation
of attractor sets would break the invariant of downward-closedness on which the
antichain representation relies. We overcome this difficulty by decomposing problem
instances recursively into games with a combination of reachability, safety, and
simpler parity conditions. We also report on an experimental implementation of
our algorithm: to our knowledge, this is the first implementation of a procedure
for solving imperfect-information parity games on graphs.'
article_processing_charge: No
author:
- first_name: Dietmar
full_name: Berwanger, Dietmar
last_name: Berwanger
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: De Wulf, Martin
last_name: De Wulf
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction
for parity games with imperfect information. Information and Computation.
2010;208(10):1206-1220. doi:10.1016/j.ic.2009.09.006
apa: Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T.
A. (2010). Strategy construction for parity games with imperfect information.
Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.09.006
chicago: Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen,
and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect
Information.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.09.006.
ieee: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy
construction for parity games with imperfect information,” Information and
Computation, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.
ista: Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy
construction for parity games with imperfect information. Information and Computation.
208(10), 1206–1220.
mla: Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect
Information.” Information and Computation, vol. 208, no. 10, Elsevier,
2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.
short: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information
and Computation 208 (2010) 1206–1220.
date_created: 2018-12-11T12:05:35Z
date_published: 2010-10-01T00:00:00Z
date_updated: 2025-09-30T09:33:19Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2009.09.006
ec_funded: 1
external_id:
isi:
- '000281830300007'
file:
- access_level: open_access
checksum: 29d146e4f8049dbb7f80bbf7ea3700ed
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:44Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5300'
file_name: IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf
file_size: 287496
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 208'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1206 - 1220
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '2319'
pubrep_id: '58'
quality_controlled: '1'
related_material:
record:
- id: '3880'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Strategy construction for parity games with imperfect information
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 208
year: '2010'
...
---
_id: '3864'
abstract:
- lang: eng
text: 'Often one has a preference order among the different systems that satisfy
a given specification. Under a probabilistic assumption about the possible inputs,
such a preference order is naturally expressed by a weighted automaton, which
assigns to each word a value, such that a system is preferred if it generates
a higher expected value. We solve the following optimal-synthesis problem: given
an omega-regular specification, a Markov chain that describes the distribution
of inputs, and a weighted automaton that measures how well a system satisfies
the given specification tinder the given input assumption, synthesize a system
that optimizes the measured value. For safety specifications and measures that
are defined by mean-payoff automata, the optimal-synthesis problem amounts to
finding a strategy in a Markov decision process (MDP) that is optimal for a long-run
average reward objective, which can be done in polynomial time. For general omega-regular
specifications, the solution rests on a new, polynomial-time algorithm for computing
optimal strategies in MDPs with mean-payoff parity objectives. We present some
experimental results showing optimal systems that were automatically generated
in this way.'
acknowledgement: This research was supported by the European Union project COMBEST
and the European Network of Excellence ArtistDesign.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing
systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:10.1007/978-3-642-14295-6_34'
apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring
and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395).
Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom:
Springer. https://doi.org/10.1007/978-3-642-14295-6_34'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit
Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95.
Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_34.
ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and
synthesizing systems in probabilistic environments,” presented at the CAV: Computer
Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing
systems in probabilistic environments. CAV: Computer Aided Verification, LNCS,
vol. 6174, 380–395.'
mla: Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic
Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010,
pp. 380–395.
conference:
end_date: 2010-07-19
location: Edinburgh, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 201-07-15
corr_author: '1'
date_created: 2018-12-11T12:05:35Z
date_published: 2010-07-09T00:00:00Z
date_updated: 2025-09-23T09:33:01Z
day: '09'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_34
external_id:
arxiv:
- '1004.0739'
intvolume: ' 6174'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1004.0739
month: '07'
oa: 1
oa_version: Preprint
page: 380 - 395
publication_status: published
publisher: Springer
publist_id: '2313'
quality_controlled: '1'
related_material:
record:
- id: '1856'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Measuring and synthesizing systems in probabilistic environments
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
OA_type: closed access
_id: '3865'
abstract:
- lang: eng
text: We introduce a technique for debugging multi-threaded C programs and analyzing
the impact of source code changes, and its implementation in the prototype tool
DIRECT. Our approach uses a combination of source code instrumentation and runtime
management. The source code along with a test harness is instrumented to monitor
Operating System (OS) and user defined function calls. DIRECT tracks all concurrency
control primitives and, optionally, data from the program. DIRECT maintains an
abstract global state that combines information from every thread, including the
sequence of function calls and concurrency primitives executed. The runtime manager
can insert delays, provoking thread inter-leavings that may exhibit bugs that
are difficult to reach otherwise. The runtime manager collects an approximation
of the reachable state space and uses this approximation to assess the impact
of change in a new version of the program.
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: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
- first_name: César
full_name: Sánchez, César
last_name: Sánchez
citation:
ama: 'Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change
in multi-threaded programs. In: 13th International Conference on Fundamental
Approaches to Software Engineering. Vol 6013. Springer; 2010:293-307. doi:10.1007/978-3-642-12029-9_21'
apa: 'Chatterjee, K., De Alfaro, L., Raman, V., & Sánchez, C. (2010). Analyzing
the impact of change in multi-threaded programs. In 13th International Conference
on Fundamental Approaches to Software Engineering (Vol. 6013, pp. 293–307).
Paphos, Cyprus: Springer. https://doi.org/10.1007/978-3-642-12029-9_21'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez.
“Analyzing the Impact of Change in Multi-Threaded Programs.” In 13th International
Conference on Fundamental Approaches to Software Engineering, 6013:293–307.
Springer, 2010. https://doi.org/10.1007/978-3-642-12029-9_21.
ieee: K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact
of change in multi-threaded programs,” in 13th International Conference on
Fundamental Approaches to Software Engineering, Paphos, Cyprus, 2010, vol.
6013, pp. 293–307.
ista: 'Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact
of change in multi-threaded programs. 13th International Conference on Fundamental
Approaches to Software Engineering. FASE: Fundamental Approaches To Software Engineering,
LNCS, vol. 6013, 293–307.'
mla: Chatterjee, Krishnendu, et al. “Analyzing the Impact of Change in Multi-Threaded
Programs.” 13th International Conference on Fundamental Approaches to Software
Engineering, vol. 6013, Springer, 2010, pp. 293–307, doi:10.1007/978-3-642-12029-9_21.
short: K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, 13th International
Conference on Fundamental Approaches to Software Engineering, Springer, 2010,
pp. 293–307.
conference:
end_date: 2010-03-28
location: Paphos, Cyprus
name: 'FASE: Fundamental Approaches To Software Engineering'
start_date: 2010-03-20
date_created: 2018-12-11T12:05:35Z
date_published: 2010-04-21T00:00:00Z
date_updated: 2025-05-20T06:36:30Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-642-12029-9_21
intvolume: ' 6013'
language:
- iso: eng
month: '04'
oa_version: None
page: 293 - 307
publication: 13th International Conference on Fundamental Approaches to Software Engineering
publication_identifier:
eisbn:
- '9783642120299'
eissn:
- 1611-3349
publication_status: published
publisher: Springer
publist_id: '2315'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analyzing the impact of change in multi-threaded programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6013
year: '2010'
...
---
_id: '3866'
abstract:
- lang: eng
text: Systems ought to behave reasonably even in circumstances that are not anticipated
in their specifications. We propose a definition of robustness for liveness specifications
which prescribes, for any number of environment assumptions that are violated,
a minimal number of system guarantees that must still be fulfilled. This notion
of robustness can be formulated and realized using a Generalized Reactivity formula.
We present an algorithm for synthesizing robust systems from such formulas. For
the important special case of Generalized Reactivity formulas of rank 1, our algorithm
improves the complexity of [PPS06] for large specifications with a small number
of assumptions and guarantees.
alternative_title:
- LNCS
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Karin
full_name: Greimel, Karin
last_name: Greimel
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
citation:
ama: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in
the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer;
2010:410-424. doi:10.1007/978-3-642-14295-6_36'
apa: 'Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann,
B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &
P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided
Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir
Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_36.
ieee: 'R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness
in the presence of liveness,” presented at the CAV: Computer Aided Verification,
Edinburgh, UK, 2010, vol. 6174, pp. 410–424.'
ista: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness
in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174,
410–424.'
mla: Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited
by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.
short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T.
Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.
conference:
end_date: 2010-07-19
location: Edinburgh, UK
name: 'CAV: Computer Aided Verification'
start_date: 2010-07-15
date_created: 2018-12-11T12:05:36Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2021-01-12T07:52:47Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_36
ec_funded: 1
editor:
- first_name: Tayssir
full_name: Touili, Tayssir
last_name: Touili
- first_name: Byron
full_name: Cook, Byron
last_name: Cook
- first_name: Paul
full_name: Jackson, Paul
last_name: Jackson
file:
- access_level: open_access
checksum: 9d204611c8d7855bed8134f8708a0010
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:52Z
date_updated: 2020-07-14T12:46:19Z
file_id: '5243'
file_name: IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf
file_size: 213083
relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: ' 6174'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 410 - 424
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '2310'
pubrep_id: '54'
quality_controlled: '1'
scopus_import: 1
status: public
title: Robustness in the presence of liveness
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
_id: '3867'
abstract:
- lang: eng
text: Weighted automata are nondeterministic automata with numerical weights on
transitions. They can define quantitative languages L that assign to each word
w a real number L(w). In the case of infinite words, the value of a run is naturally
computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the
transition weights. The value of a word w is the supremum of the values of the
runs over w. We study expressiveness and closure questions about these quantitative
languages. We first show that the set of words with value greater than a threshold
can be omega-regular for deterministic limit-average and discounted-sum automata,
while this set is always omega-regular when the threshold is isolated (i.e., some
neighborhood around the threshold contains no word). In the latter case, we prove
that the omega-regular language is robust against small perturbations of the transition
weights. We next consider automata with transition weights 0 or 1 and show that
they are as expressive as general weighted automata in the limit-average case,
but not in the discounted-sum case. Third, for quantitative languages L-1 and
L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which
generalize the boolean operations on languages, as well as the sum L-1 + L-2.
We establish the closure properties of all classes of quantitative languages with
respect to these four operations.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties
for quantitative languages. Logical Methods in Computer Science. 2010;6(3):1-23.
doi:10.2168/LMCS-6(3:10)2010
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and
closure properties for quantitative languages. Logical Methods in Computer
Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-6(3:10)2010
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness
and Closure Properties for Quantitative Languages.” Logical Methods in Computer
Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:10)2010.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure
properties for quantitative languages,” Logical Methods in Computer Science,
vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.
ista: Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties
for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
mla: Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative
Languages.” Logical Methods in Computer Science, vol. 6, no. 3, International
Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science
6 (2010) 1–23.
corr_author: '1'
date_created: 2018-12-11T12:05:36Z
date_published: 2010-08-30T00:00:00Z
date_updated: 2025-09-30T09:31:00Z
day: '30'
ddc:
- '000'
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-6(3:10)2010
ec_funded: 1
external_id:
isi:
- '000282653500010'
file:
- access_level: open_access
checksum: 0243da726476817f2ea33b48b78be696
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:54Z
date_updated: 2020-07-14T12:46:19Z
file_id: '5312'
file_name: IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf
file_size: 216598
relation: main_file
- access_level: open_access
checksum: 5e512b8503a9cb263de26331c4ee9cf2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:55Z
date_updated: 2020-07-14T12:46:19Z
file_id: '5313'
file_name: IST-2016-55-v2+1_1007.4018.pdf
file_size: 302416
relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 1 - 23
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '2311'
pubrep_id: '504'
quality_controlled: '1'
related_material:
record:
- id: '4540'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Expressiveness and closure properties for quantitative languages
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6
year: '2010'
...
---
_id: '3868'
abstract:
- lang: eng
text: Simulation and bisimulation metrics for stochastic systems provide a quantitative
generalization of the classical simulation and bisimulation relations. These metrics
capture the similarity of states with respect to quantitative specifications written
in the quantitative mu-calculus and related probabilistic logics. We first show
that the metrics provide a bound for the difference in long-run average and discounted
average behavior across states, indicating that the metrics can be used both in
system verification, and in performance evaluation. For turn-based games and MDPs,
we provide a polynomial-time algorithm for the computation of the one-step metric
distance between states. The algorithm is based on linear programming; it improves
on the previous known exponential-time algorithm based on a reduction to the theory
of reals. We then present PSPACE algorithms for both the decision problem and
the problem of approximating the metric distance between two states, matching
the best known algorithms for Markov chains. For the bisimulation kernel of the
metric our algorithm works in time O(n(4)) for both turn-based games and MDPs;
improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For
a concurrent game G, we show that computing the exact distance be tween states
is at least as hard as computing the value of concurrent reachability games and
the square-root-sum problem in computational geometry. We show that checking whether
the metric distance is bounded by a rational r, can be done via a reduction to
the theory of real closed fields, involving a formula with three quantifier alternations,
yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time
complexity, improving the previously known reduction, which yielded O(vertical
bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms
can be iterated to approximate the metrics using binary search
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: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics.
Logical Methods in Computer Science. 2010;6(3):1-27. doi:10.2168/LMCS-6(3:13)2010
apa: Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2010). Algorithms
for game metrics. Logical Methods in Computer Science. International Federation
of Computational Logic. https://doi.org/10.2168/LMCS-6(3:13)2010
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath
Raman. “Algorithms for Game Metrics.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:13)2010.
ieee: K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game
metrics,” Logical Methods in Computer Science, vol. 6, no. 3. International
Federation of Computational Logic, pp. 1–27, 2010.
ista: Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game
metrics. Logical Methods in Computer Science. 6(3), 1–27.
mla: Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.” Logical Methods
in Computer Science, vol. 6, no. 3, International Federation of Computational
Logic, 2010, pp. 1–27, doi:10.2168/LMCS-6(3:13)2010.
short: K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer
Science 6 (2010) 1–27.
corr_author: '1'
date_created: 2018-12-11T12:05:36Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2025-09-30T09:31:30Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.2168/LMCS-6(3:13)2010
external_id:
isi:
- '000282653500013'
file:
- access_level: open_access
checksum: a18988135fef3016c93808ecb15b55f5
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:11Z
date_updated: 2020-07-14T12:46:19Z
file_id: '4671'
file_name: IST-2015-370-v1+1_0809.4326.pdf
file_size: 346527
relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1 - 27
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '2312'
pubrep_id: '370'
quality_controlled: '1'
related_material:
record:
- id: '3504'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Algorithms for game metrics
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6
year: '2010'
...
---
_id: '4388'
abstract:
- lang: eng
text: GIST is a tool that (a) solves the qualitative analysis problem of turn-based
probabilistic games with ω-regular objectives; and (b) synthesizes reasonable
environment assumptions for synthesis of unrealizable specifications. Our tool
provides the first and efficient implementations of several reduction-based techniques
to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic
games for synthesizing environment assumptions for unrealizable specifications.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for
probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:10.1007/978-3-642-14295-6_57'
apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2010).
GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at
the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_57'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun
Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer,
2010. https://doi.org/10.1007/978-3-642-14295-6_57.'
ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST:
A solver for probabilistic games,” presented at the CAV: Computer Aided Verification,
Edinburgh, UK, 2010, vol. 6174, pp. 665–669.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver
for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.'
mla: 'Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games.
Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.'
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer,
2010, pp. 665–669.
conference:
end_date: 2010-07-17
location: Edinburgh, UK
name: 'CAV: Computer Aided Verification'
start_date: 2010-07-15
corr_author: '1'
date_created: 2018-12-11T12:08:36Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2024-10-09T20:54:00Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_57
ec_funded: 1
external_id:
arxiv:
- '1004.2367'
file:
- access_level: open_access
checksum: 0b2ef8c4037ffccc6902d93081af24f7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:33Z
date_updated: 2020-07-14T12:46:28Z
file_id: '5221'
file_name: IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf
file_size: 293605
relation: main_file
file_date_updated: 2020-07-14T12:46:28Z
has_accepted_license: '1'
intvolume: ' 6174'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 665 - 669
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '1068'
pubrep_id: '43'
quality_controlled: '1'
related_material:
record:
- id: '5393'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'GIST: A solver for probabilistic games'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
_id: '5392'
abstract:
- lang: eng
text: We consider probabilistic automata on infinite words with acceptance defined
by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider
quantitative and qualitative decision problems. We present extensions and adaptations
of proofs of [GO09] and present a precise characterization of the decidability
and undecidability frontier of the quantitative and qualitative decision problems.
alternative_title:
- IST Austria Technical Report
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. Probabilistic Automata on Infinite Words: Decidability and
Undecidability Results. IST Austria; 2009. doi:10.15479/AT:IST-2009-0004'
apa: 'Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability
and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004'
chicago: 'Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability
and Undecidability Results. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0004.'
ieee: 'K. Chatterjee, Probabilistic automata on infinite words: Decidability
and undecidability results. IST Austria, 2009.'
ista: 'Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability
and undecidability results, IST Austria, 17p.'
mla: 'Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability
and Undecidability Results. IST Austria, 2009, doi:10.15479/AT:IST-2009-0004.'
short: 'K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and
Undecidability Results, IST Austria, 2009.'
corr_author: '1'
date_created: 2018-12-12T11:39:04Z
date_published: 2009-11-02T00:00:00Z
date_updated: 2025-04-14T13:37:25Z
day: '02'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2009-0004
file:
- access_level: open_access
checksum: fb7563150231325b00b1718d956f687b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:08Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5530'
file_name: IST-2009-0004_IST-2009-0004.pdf
file_size: 311065
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '28'
related_material:
record:
- id: '3857'
relation: later_version
status: public
status: public
title: 'Probabilistic automata on infinite words: Decidability and undecidability
results'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '5393'
abstract:
- lang: eng
text: Gist is a tool that (a) solves the qualitative analysis problem of turn-based
probabilistic games with ω-regular objectives; and (b) synthesizes reasonable
environment assumptions for synthesis of unrealizable specifications. Our tool
provides efficient implementations of several reduction based techniques to solve
turn-based probabilistic games, and uses the analysis of turn-based probabilistic
games for synthesizing environment assumptions for unrealizable specifications.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. Gist: A Solver
for Probabilistic Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0003'
apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009).
Gist: A solver for probabilistic games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0003'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun
Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009.
https://doi.org/10.15479/AT:IST-2009-0003.'
ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist:
A solver for probabilistic games. IST Austria, 2009.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver
for probabilistic games, IST Austria, 12p.'
mla: 'Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games.
IST Austria, 2009, doi:10.15479/AT:IST-2009-0003.'
short: 'K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver
for Probabilistic Games, IST Austria, 2009.'
corr_author: '1'
date_created: 2018-12-12T11:39:05Z
date_published: 2009-10-09T00:00:00Z
date_updated: 2025-04-14T13:37:27Z
day: '09'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2009-0003
file:
- access_level: open_access
checksum: 49551ac552915b17593a14c993845274
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:58Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5459'
file_name: IST-2009-0003_IST-2009-0003.pdf
file_size: 386866
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '12'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '29'
related_material:
record:
- id: '4388'
relation: later_version
status: public
status: public
title: 'Gist: A solver for probabilistic games'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '5394'
abstract:
- lang: eng
text: We consider two-player games played on graphs with request-response and finitary
Streett objectives. We show these games are PSPACE-hard, improving the previous
known NP-hardness. We also improve the lower bounds on memory required by the
winning strategies for the players.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response
and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002
apa: Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower
bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved
Lower Bounds for Request-Response and Finitary Streett Games. IST Austria,
2009. https://doi.org/10.15479/AT:IST-2009-0002.
ieee: K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for
request-response and finitary Streett games. IST Austria, 2009.
ista: Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response
and finitary Streett games, IST Austria, 11p.
mla: Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response
and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.
short: K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response
and Finitary Streett Games, IST Austria, 2009.
corr_author: '1'
date_created: 2018-12-12T11:39:05Z
date_published: 2009-09-09T00:00:00Z
date_updated: 2024-10-09T21:08:23Z
day: '09'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2009-0002
file:
- access_level: open_access
checksum: 1c50a9723fbae1b2c46d18138968efb3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:50Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5511'
file_name: IST-2009-0002_IST-2009-0002.pdf
file_size: 238091
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '11'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '30'
status: public
title: Improved lower bounds for request-response and finitary Streett games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '5395'
abstract:
- lang: eng
text: 'We study observation-based strategies for partially-observable Markov decision
processes (POMDPs) with omega-regular objectives. An observation-based strategy
relies on partial information about the history of a play, namely, on the past
sequence of observa- tions. We consider the qualitative analysis problem: given
a POMDP with an omega-regular objective, whether there is an observation-based
strategy to achieve the objective with probability 1 (almost-sure winning), or
with positive probability (positive winning). Our main results are twofold. First,
we present a complete picture of the computational complexity of the qualitative
analysis of POMDPs with parity objectives (a canonical form to express omega-regular
objectives) and its subclasses. Our contribution consists in establishing several
upper and lower bounds that were not known in literature. Second, we present optimal
bounds (matching upper and lower bounds) on the memory required by pure and randomized
observation-based strategies for the qualitative analysis of POMDPs with parity
objectives and its subclasses.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: Chatterjee K, Doyen L, Henzinger TA. Qualitative Analysis of Partially-Observable
Markov Decision Processes. IST Austria; 2009. doi:10.15479/AT:IST-2009-0001
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis
of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative
Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009.
https://doi.org/10.15479/AT:IST-2009-0001.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable
Markov decision processes. IST Austria, 2009.
ista: Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable
Markov decision processes, IST Austria, 20p.
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable
Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable
Markov Decision Processes, IST Austria, 2009.
corr_author: '1'
date_created: 2018-12-12T11:39:05Z
date_published: 2009-09-09T00:00:00Z
date_updated: 2025-04-14T13:37:25Z
day: '09'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2009-0001
file:
- access_level: open_access
checksum: 04d9cc065cc19598a4e8631c47f1a562
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:25Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5486'
file_name: IST-2009-0001_IST-2009-0001.pdf
file_size: 342088
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '31'
related_material:
record:
- id: '3855'
relation: later_version
status: public
status: public
title: Qualitative analysis of partially-observable Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '3870'
abstract:
- lang: eng
text: Games on graphs with omega-regular objectives provide a model for the control
and synthesis of reactive systems. Every omega-regular objective can be decomposed
into a safety part and a liveness part. The liveness part ensures that something
good happens “eventually.” Two main strengths of the classical, infinite-limit
formulation of liveness are robustness (independence from the granularity of transitions)
and simplicity (abstraction of complicated time bounds). However, the classical
liveness formulation suffers from the drawback that the time until something good
happens may be unbounded. A stronger formulation of liveness, so-called finitary
liveness, overcomes this drawback, while still retaining robustness and simplicity.
Finitary liveness requires that there exists an unknown, fixed bound b such that
something good happens within b transitions. While for one-shot liveness (reachability)
objectives, classical and finitary liveness coincide, for repeated liveness (Buchi)
objectives, the finitary formulation is strictly stronger. In this work we study
games with finitary parity and Streett objectives. We prove the determinacy of
these games, present algorithms for solving these games, and characterize the
memory requirements of winning strategies. We show that finitary parity games
can be solved in polynomial time, which is not known for infinitary parity games.
For finitary Streett games, we give an EXPTIME algorithm and show that the problem
is NP-hard. Our algorithms can be used, for example, for synthesizing controllers
that do not let the response time of a system increase without bound.
acknowledgement: "This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
the NSF grants CCR-0132780, CNS-0720884, and CCR- 225610, by the Swiss National
Science Foundation, by the COMBEST project of the European Union, and EU-TMR network
Games.\r\nWe thank anonymous reviewers for useful comments."
article_number: '1'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: Chatterjee K, Henzinger TA, Horn F. Finitary winning in omega-regular games.
ACM Transactions on Computational Logic (TOCL). 2009;11(1). doi:10.1145/1614431.1614432
apa: Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in
omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM.
https://doi.org/10.1145/1614431.1614432
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary
Winning in Omega-Regular Games.” ACM Transactions on Computational Logic (TOCL).
ACM, 2009. https://doi.org/10.1145/1614431.1614432.
ieee: K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular
games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1.
ACM, 2009.
ista: Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular
games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
mla: Chatterjee, Krishnendu, et al. “Finitary Winning in Omega-Regular Games.” ACM
Transactions on Computational Logic (TOCL), vol. 11, no. 1, 1, ACM, 2009,
doi:10.1145/1614431.1614432.
short: K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational
Logic (TOCL) 11 (2009).
corr_author: '1'
date_created: 2018-12-11T12:05:37Z
date_published: 2009-10-01T00:00:00Z
date_updated: 2025-09-30T09:53:52Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/1614431.1614432
ec_funded: 1
external_id:
isi:
- '000272039900001'
file:
- access_level: open_access
checksum: 139c4586d24f11e5da31fb3a0cf96ef4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:08Z
date_updated: 2020-07-14T12:46:20Z
file_id: '5125'
file_name: IST-2012-53-v1+1_Finitary_winning_in_omega-regular_games.pdf
file_size: 180082
relation: main_file
file_date_updated: 2020-07-14T12:46:20Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '2309'
pubrep_id: '53'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finitary winning in omega-regular games
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2009'
...
---
_id: '3871'
abstract:
- lang: eng
text: 'Nondeterministic weighted automata are finite automata with numerical weights
oil transitions. They define quantitative languages 1, that assign to each word
v; a real number L(w). The value of ail infinite word w is computed as the maximal
value of all runs over w, and the value of a run as the supremum, limsup liminf,
limit average, or discounted sum of the transition weights. We introduce probabilistic
weighted antomata, in which the transitions are chosen in a randomized (rather
than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics),
the value of a word v) is the largest real v such that the runs over w have value
at least v with probability I (resp. positive probability). We study the classical
questions of automata theory for probabilistic weighted automata: emptiness and
universality, expressiveness, and closure under various operations oil languages.
For quantitative languages, emptiness university axe defined as whether the value
of some (resp. every) word exceeds a given threshold. We prove some, of these
questions to he decidable, and others undecidable. Regarding expressive power,
we show that probabilities allow its to define a wide variety of new classes of
quantitative languages except for discounted-sum automata, where probabilistic
choice is no more expressive than nondeterminism. Finally we live ail almost complete
picture of the closure of various classes of probabilistic weighted automata for
the following, provide, is operations oil quantitative languages: maximum, sum.
and numerical complement.'
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), by the European projects
Combest, Quasimodo, and Gasics, by the PAI program Moves funded by the Belgian Federal
Government, and by the CFV (Federated Center in Verification ) funded by the F.R.S.-FNRS.
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: 'Chatterjee K, Doyen L, Henzinger TA. Probabilistic weighted automata. In:
Vol 5710. Springer; 2009:244-258. doi:10.1007/978-3-642-04081-8_17'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Probabilistic weighted
automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory,
Bologna, Italy: Springer. https://doi.org/10.1007/978-3-642-04081-8_17'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic
Weighted Automata,” 5710:244–58. Springer, 2009. https://doi.org/10.1007/978-3-642-04081-8_17.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Probabilistic weighted automata,”
presented at the CONCUR: Concurrency Theory, Bologna, Italy, 2009, vol. 5710,
pp. 244–258.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata.
CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.'
mla: Chatterjee, Krishnendu, et al. Probabilistic Weighted Automata. Vol.
5710, Springer, 2009, pp. 244–58, doi:10.1007/978-3-642-04081-8_17.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.
conference:
end_date: 2009-09-04
location: Bologna, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2009-09-01
corr_author: '1'
date_created: 2018-12-11T12:05:37Z
date_published: 2009-09-01T00:00:00Z
date_updated: 2024-10-09T20:53:56Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.1007/978-3-642-04081-8_17
ec_funded: 1
file:
- access_level: open_access
checksum: af973ddbcf131b8810c6bff2c055ff56
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:46Z
date_updated: 2020-07-14T12:46:20Z
file_id: '4771'
file_name: IST-2012-52-v1+1_Probabilistic_Weighted_Automata.pdf
file_size: 200161
relation: main_file
file_date_updated: 2020-07-14T12:46:20Z
has_accepted_license: '1'
intvolume: ' 5710'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 244 - 258
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '2304'
pubrep_id: '52'
quality_controlled: '1'
scopus_import: 1
status: public
title: Probabilistic weighted automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5710
year: '2009'
...
---
_id: '4542'
abstract:
- lang: eng
text: "Weighted automata are finite automata with numerical weights on transitions.
Nondeterministic weighted automata define quantitative languages L that assign
to each word w a real number L(w) computed as the maximal value of all runs over
w, and the value of a run r is a function of the sequence of weights that appear
along r. There are several natural functions to consider such as Sup, LimSup,
LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce
alternating weighted automata in which the transitions of the runs are chosen
by two players in a turn-based fashion. Each word is assigned the maximal value
of a run that the first player can enforce regardless of the choices made by the
second player. We survey the results about closure properties, expressiveness,
and decision problems for nondeterministic weighted automata, and we extend these
results to alternating weighted automata.\r\nFor quantitative languages L 1 and
L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1,
and the sum L 1 + L 2. We establish the closure properties of all classes of alternating
weighted automata with respect to these four operations.\r\nWe next compare the
expressive power of the various classes of alternating and nondeterministic weighted
automata over infinite words. In particular, for limit average and discounted
sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally,
we present decidability results and open questions for the quantitative extension
of the classical decision problems in automata theory: emptiness, universality,
language inclusion, and language equivalence."
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest,
Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal
Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: 'Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol
5699. Springer; 2009:3-13. doi:10.1007/978-3-642-03409-1_2'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted
automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation
Theory, Wroclaw, Poland: Springer. https://doi.org/10.1007/978-3-642-03409-1_2'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating
Weighted Automata,” 5699:3–13. Springer, 2009. https://doi.org/10.1007/978-3-642-03409-1_2.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,”
presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009,
vol. 5699, pp. 3–13.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata.
FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.'
mla: Chatterjee, Krishnendu, et al. Alternating Weighted Automata. Vol. 5699,
Springer, 2009, pp. 3–13, doi:10.1007/978-3-642-03409-1_2.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.
conference:
end_date: 2009-09-04
location: Wroclaw, Poland
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2009-09-02
corr_author: '1'
date_created: 2018-12-11T12:09:23Z
date_published: 2009-09-10T00:00:00Z
date_updated: 2024-10-09T20:53:55Z
day: '10'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1007/978-3-642-03409-1_2
ec_funded: 1
file:
- access_level: open_access
checksum: e8f53abb63579de3f2bff58b2a1188e2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:09Z
date_updated: 2020-07-14T12:46:31Z
file_id: '5126'
file_name: IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf
file_size: 164428
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 5699'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 3 - 13
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '180'
pubrep_id: '39'
quality_controlled: '1'
scopus_import: 1
status: public
title: Alternating weighted automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5699
year: '2009'
...
---
_id: '4543'
abstract:
- lang: eng
text: The synthesis of a reactive system with respect to all omega-regular specification
requires the solution of a graph game. Such games have been extended in two natural
ways. First, a game graph can be equipped with probabilistic choices between alternative
transitions, thus allowing the, modeling of uncertain behaviour. These are called
stochastic games. Second, a liveness specification can he strengthened to require
satisfaction within all unknown but bounded amount of time. These are called finitary
objectives. We study. for the first time, the, combination of Stochastic games
and finitary objectives. We characterize the requirements on optimal strategies
and provide algorithms for Computing the maximal achievable probability of winning
stochastic games with finitary parity or Street, objectives. Most notably the
set of state's from which a player can win with probability . for a finitary parity
objective can he computed in polynomial time even though no polynomial-time algorithm
is known in the nonfinitary case.
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), and by the European project
Combest.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: 'Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives.
In: Vol 5734. Springer; 2009:34-54. doi:10.1007/978-3-642-03816-7_4'
apa: 'Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games
with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical
Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic
Games with Finitary Objectives,” 5734:34–54. Springer, 2009. https://doi.org/10.1007/978-3-642-03816-7_4.
ieee: 'K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary
objectives,” presented at the MFCS: Mathematical Foundations of Computer Science,
High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.'
ista: 'Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary
objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734,
34–54.'
mla: Chatterjee, Krishnendu, et al. Stochastic Games with Finitary Objectives.
Vol. 5734, Springer, 2009, pp. 34–54, doi:10.1007/978-3-642-03816-7_4.
short: K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.
conference:
end_date: 2009-08-28
location: High Tatras, Slovakia
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2009-08-24
corr_author: '1'
date_created: 2018-12-11T12:09:24Z
date_published: 2009-08-01T00:00:00Z
date_updated: 2024-10-09T20:53:54Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-03816-7_4
ec_funded: 1
intvolume: ' 5734'
language:
- iso: eng
month: '08'
oa_version: None
page: 34 - 54
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '178'
quality_controlled: '1'
scopus_import: 1
status: public
title: Stochastic games with finitary objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5734
year: '2009'
...