---
_id: '3314'
abstract:
- lang: eng
text: We introduce two-level discounted and mean-payoff games played by two players
on a perfect-information stochastic game graph. The upper level game is a discounted
or mean-payoff game and the lower level game is a (undiscounted) reachability
game. Two-level games model hierarchical and sequential decision making under
uncertainty across different time scales. For both discounted and mean-payoff
two-level games, we show the existence of pure memoryless optimal strategies for
both players and an ordered field property. We show that if there is only one
player (Markov decision processes), then the values can be computed in polynomial
time. It follows that whether the value of a player is equal to a given rational
constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP.
We also give an alternate strategy improvement algorithm to compute the value.
© 2012 World Scientific Publishing Company.
acknowledgement: This research was funded in part by the US National Science Foundation
grants CCF-0546170, CNS-0702881, DARPA grant HR0011-09-1-0037, Austrian Science
Fund (FWF) NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship.
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: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: Chatterjee K, Majumdar R. Discounting and averaging in games across time scales.
International Journal of Foundations of Computer Science. 2012;23(3):609-625.
doi:10.1142/S0129054112400308
apa: Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games
across time scales. International Journal of Foundations of Computer Science.
World Scientific Publishing. https://doi.org/10.1142/S0129054112400308
chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging
in Games across Time Scales.” International Journal of Foundations of Computer
Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308.
ieee: K. Chatterjee and R. Majumdar, “Discounting and averaging in games across
time scales,” International Journal of Foundations of Computer Science,
vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.
ista: Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across
time scales. International Journal of Foundations of Computer Science. 23(3),
609–625.
mla: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in
Games across Time Scales.” International Journal of Foundations of Computer
Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.
short: K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer
Science 23 (2012) 609–625.
date_created: 2018-12-11T12:02:37Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2025-09-30T07:38:00Z
day: '01'
department:
- _id: KrCh
doi: 10.1142/S0129054112400308
external_id:
isi:
- '000304003000004'
intvolume: ' 23'
isi: 1
issue: '3'
language:
- iso: eng
month: '04'
oa_version: None
page: 609 - 625
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: International Journal of Foundations of Computer Science
publication_status: published
publisher: World Scientific Publishing
publist_id: '3326'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discounting and averaging in games across time scales
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 23
year: '2012'
...
---
_id: '3341'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on a finite state space for
an infinite number of rounds. The games are concurrent: in each round, the two
players (player 1 and player 2) choose their moves independently and simultaneously;
the current state and the two moves determine a probability distribution over
the successor states. We also consider the important special case of turn-based
stochastic games where players make moves in turns, rather than concurrently.
We study concurrent games with \omega-regular winning conditions specified as
parity objectives. The value for player 1 for a parity objective is the maximal
probability with which the player can guarantee the satisfaction of the objective
against all strategies of the opponent. We study the problem of continuity and
robustness of the value function in concurrent and turn-based stochastic parity
gameswith respect to imprecision in the transition probabilities. We present quantitative
bounds on the difference of the value function (in terms of the imprecision of
the transition probabilities) and show the value continuity for structurally equivalent
concurrent games (two games are structurally equivalent if the support of the
transition function is same and the probabilities differ). We also show robustness
of optimal strategies for structurally equivalent turn-based stochastic parity
games. Finally we show that the value continuity property breaks without the structurally
equivalent assumption (even for Markov chains) and show that our quantitative
bound is asymptotically optimal. Hence our results are tight (the assumption is
both necessary and sufficient) and optimal (our quantitative bound is asymptotically
optimal).'
alternative_title:
- LNCS
arxiv: 1
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. Robustness of structurally equivalent concurrent parity games.
In: Vol 7213. Springer; 2012:270-285. doi:10.1007/978-3-642-28729-9_18'
apa: 'Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity
games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software
Science and Computation Structures, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-28729-9_18'
chicago: Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent
Parity Games,” 7213:270–85. Springer, 2012. https://doi.org/10.1007/978-3-642-28729-9_18.
ieee: 'K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,”
presented at the FoSSaCS: Foundations of Software Science and Computation Structures,
Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.'
ista: 'Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity
games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS,
vol. 7213, 270–285.'
mla: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.
short: K. Chatterjee, in:, Springer, 2012, pp. 270–285.
conference:
end_date: 2012-04-01
location: Tallinn, Estonia
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2012-03-24
corr_author: '1'
date_created: 2018-12-11T12:02:46Z
date_published: 2012-03-22T00:00:00Z
date_updated: 2024-10-09T20:54:38Z
day: '22'
department:
- _id: KrCh
doi: 10.1007/978-3-642-28729-9_18
ec_funded: 1
external_id:
arxiv:
- '1107.2009'
intvolume: ' 7213'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2009
month: '03'
oa: 1
oa_version: Preprint
page: 270 - 285
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: Springer
publist_id: '3284'
quality_controlled: '1'
related_material:
record:
- id: '5382'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Robustness of structurally equivalent concurrent parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7213
year: '2012'
...
---
_id: '3846'
abstract:
- lang: eng
text: We summarize classical and recent results about two-player games played on
graphs with ω-regular objectives. These games have applications in the verification
and synthesis of reactive systems. Important distinctions are whether a graph
game is turn-based or concurrent; deterministic or stochastic; zero-sum or not.
We cluster known results and open problems according to these classifications.
acknowledgement: This research was supported in part by the ONR grant N00014-02-1-0671,
by the AFOSR MURI grant F49620-00-1-0327, and by the NSF grants CCR-9988172, CCR-0085949,
and CCR-0225610.
article_processing_charge: No
article_type: original
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. A survey of stochastic ω regular games. Journal
of Computer and System Sciences. 2012;78(2):394-413. doi:10.1016/j.jcss.2011.05.002
apa: Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular
games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002
chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic
ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012.
https://doi.org/10.1016/j.jcss.2011.05.002.
ieee: K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,”
Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp.
394–413, 2012.
ista: Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games.
Journal of Computer and System Sciences. 78(2), 394–413.
mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω
Regular Games.” Journal of Computer and System Sciences, vol. 78, no. 2,
Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.
short: K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78
(2012) 394–413.
corr_author: '1'
date_created: 2018-12-11T12:05:29Z
date_published: 2012-03-02T00:00:00Z
date_updated: 2025-09-30T07:32:39Z
day: '02'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jcss.2011.05.002
external_id:
isi:
- '000299719100002'
file:
- access_level: open_access
checksum: 241b939deb4517cdd4426d49c67e3fa2
content_type: application/pdf
creator: kschuh
date_created: 2019-01-29T10:54:28Z
date_updated: 2020-07-14T12:46:17Z
file_id: '5897'
file_name: a_survey_of_stochastic_omega-regular_games.pdf
file_size: 336450
relation: main_file
file_date_updated: 2020-07-14T12:46:17Z
has_accepted_license: '1'
intvolume: ' 78'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jcss.2011.05.002
month: '03'
oa: 1
oa_version: Submitted Version
page: 394 - 413
publication: Journal of Computer and System Sciences
publication_status: published
publisher: Elsevier
publist_id: '2341'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A survey of stochastic ω regular games
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 78
year: '2012'
...
---
_id: '5379'
abstract:
- lang: eng
text: Computing the winning set for Büchi objectives in alternating games on graphs
is a central problem in computer aided verification with a large number of applications.
The long standing best known upper bound for solving the problem is ̃O(n·m), where
n is the number of vertices and m is the number of edges in the graph. We are
the first to break the ̃O(n·m) boundary by presenting a new technique that reduces
the running time to O(n2). This bound also leads to O(n2) time algorithms for
computing the set of almost-sure winning vertices for Büchi objectives (1) in
alternating games with probabilistic transitions (improving an earlier bound of
O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier
bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3
an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique
can be used to compute the maximal end-component decomposition of a graph in time
O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show
how to maintain the winning set for Büchi objectives in alternating games under
a sequence of edge insertions or a sequence of edge deletions in O(n) amortized
time per operation. This is the first dynamic algorithm for this problem.
alternative_title:
- IST Austria Technical Report
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 M. An O(N2) Time Algorithm for Alternating Büchi
Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0009
apa: Chatterjee, K., & Henzinger, M. (2011). An O(n2) time algorithm for
alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
chicago: Chatterjee, Krishnendu, and Monika Henzinger. An O(N2) Time Algorithm
for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
ieee: K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating
Büchi games. IST Austria, 2011.
ista: Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi
games, IST Austria, 20p.
mla: Chatterjee, Krishnendu, and Monika Henzinger. An O(N2) Time Algorithm for
Alternating Büchi Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0009.
short: K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi
Games, IST Austria, 2011.
date_created: 2018-12-12T11:38:59Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2025-07-10T11:52:28Z
day: '11'
ddc:
- '000'
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0009
file:
- access_level: open_access
checksum: 0b354264229045d982332fd2cb5b9a26
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:43Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5504'
file_name: IST-2011-0009_IST-2011-0009.pdf
file_size: 388665
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '15'
related_material:
record:
- id: '3165'
relation: later_version
status: public
status: public
title: An O(n2) time algorithm for alternating Büchi games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5380'
abstract:
- lang: eng
text: 'We consider 2-player games played on a finite state space for an infinite
number of rounds. The games are concurrent: in each round, the two players (player
1 and player 2) choose their moves independently and simultaneously; the current
state and the two moves determine the successor state. We study concurrent games
with ω-regular winning conditions specified as parity objectives. We consider
the qualitative analysis problems: the computation of the almost-sure and limit-sure
winning set of states, where player 1 can ensure to win with probability 1 and
with probability arbitrarily close to 1, respectively. In general the almost-sure
and limit-sure winning strategies require both infinite-memory as well as infinite-precision
(to describe probabilities). We study the bounded-rationality problem for qualitative
analysis of concurrent parity games, where the strategy set for player 1 is restricted
to bounded-resource strategies. In terms of precision, strategies can be deterministic,
uniform, finite-precision or infinite-precision; and in terms of memory, strategies
can be memoryless, finite-memory or infinite-memory. We present a precise and
complete characterization of the qualitative winning sets for all combinations
of classes of strategies. In particular, we show that uniform memoryless strategies
are as powerful as finite-precision infinite-memory strategies, and infinite-precision
memoryless strategies are as powerful as infinite-precision finite-memory strategies. We
show that the winning sets can be computed in O(n2d+3) time, where n is the size
of the game structure and 2d is the number of priorities (or colors), and our
algorithms are symbolic. The membership problem of whether a state belongs to
a winning set can be decided in NP ∩ coNP. While this complexity is the same as
for the simpler class of turn-based parity games, where in each state only one
of the two players has a choice of moves, our algorithms,that are obtained by
characterization of the winning sets as μ-calculus formulas, are considerably
more involved than those for turn-based games.'
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. Bounded Rationality in Concurrent Parity Games. IST Austria;
2011. doi:10.15479/AT:IST-2011-0008
apa: Chatterjee, K. (2011). Bounded rationality in concurrent parity games.
IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
chicago: Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games.
IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
ieee: K. Chatterjee, Bounded rationality in concurrent parity games. IST
Austria, 2011.
ista: Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria,
53p.
mla: Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games.
IST Austria, 2011, doi:10.15479/AT:IST-2011-0008.
short: K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria,
2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2025-06-26T09:28:52Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0008
file:
- access_level: open_access
checksum: 0fd38186409be819a911c4990fa79d1f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:22Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5544'
file_name: IST-2011-0008_IST-2011-0008.pdf
file_size: 500399
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '53'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '16'
related_material:
record:
- id: '3338'
relation: later_version
status: public
status: public
title: Bounded rationality in concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distri- bution over the successor
states. The game is played for infinitely many rounds and thus the players construct
an infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or pos- itively (i.e., with positive probability), no matter the
strategy of the second player.\r\n\r\nWe classify such games according to the
information and to the power of randomization available to the players. On the
basis of information, the game can be one-sided with either (a) player 1, or (b)
player 2 having partial observation (and the other player has perfect observation),
or two- sided with (c) both players having partial observation. On the basis of
randomization, (a) the players may not be allowed to use randomization (pure strategies),
or (b) they may choose a probability distribution over actions but the actual
random choice is external and not visible to the player (actions invisible), or
(c) they may use full randomization.\r\n\r\nOur main results for pure strategies
are as follows: (1) For one-sided games with player 2 perfect observation we show
that (in contrast to full randomized strategies) belief-based (subset-construction
based) strate- gies are not sufficient, and present an exponential upper bound
on mem- ory both for almost-sure and positive winning strategies; we show that
the problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
the explicit exponential construction. (2) For one-sided games with player 1 perfect
observation we show that non-elementary memory is both necessary and sufficient
for both almost-sure and posi- tive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least non-elementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence re- sult exhibit
serious flaws in previous results in the literature: we show a non-elementary
memory lower bound for almost-sure winning whereas an exponential upper bound
was previously claimed."
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
citation:
ama: 'Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win
When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007'
apa: 'Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic
games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.'
ieee: 'K. Chatterjee and L. Doyen, Partial-observation stochastic games: How
to win when belief fails. IST Austria, 2011.'
ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
win when belief fails, IST Austria, 43p.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.'
short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2025-09-30T08:08:45Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:27Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5488'
file_name: IST-2011-0007_IST-2011-0007.pdf
file_size: 574055
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
record:
- id: '1903'
relation: later_version
status: public
- id: '2211'
relation: later_version
status: public
- id: '2955'
relation: later_version
status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5382'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on a finite state space for
an infinite num- ber of rounds. The games are concurrent: in each round, the two
players (player 1 and player 2) choose their moves independently and simultaneously;
the current state and the two moves determine a probability distribution over
the successor states. We also consider the important special case of turn-based
stochastic games where players make moves in turns, rather than concurrently.
We study concurrent games with ω-regular winning conditions specified as parity
objectives. The value for player 1 for a parity objective is the maximal probability
with which the player can guarantee the satisfaction of the objective against
all strategies of the opponent. We study the problem of continuity and robustness
of the value function in concurrent and turn-based stochastic parity games with
respect to imprecision in the transition probabilities. We present quantitative
bounds on the difference of the value function (in terms of the imprecision of
the transition probabilities) and show the value continuity for structurally equivalent
concurrent games (two games are structurally equivalent if the support of the
transition func- tion is same and the probabilities differ). We also show robustness
of optimal strategies for structurally equivalent turn-based stochastic parity
games. Finally we show that the value continuity property breaks without the structurally
equivalent assumption (even for Markov chains) and show that our quantitative
bound is asymptotically optimal. Hence our results are tight (the assumption is
both necessary and sufficient) and optimal (our quantitative bound is asymptotically
optimal).'
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. Robustness of Structurally Equivalent Concurrent Parity Games.
IST Austria; 2011. doi:10.15479/AT:IST-2011-0006
apa: Chatterjee, K. (2011). Robustness of structurally equivalent concurrent
parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
chicago: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.
ieee: K. Chatterjee, Robustness of structurally equivalent concurrent parity
games. IST Austria, 2011.
ista: Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity
games, IST Austria, 18p.
mla: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0006.
short: K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games,
IST Austria, 2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-06-27T00:00:00Z
date_updated: 2025-04-15T08:12:24Z
day: '27'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0006
file:
- access_level: open_access
checksum: 1322b652d6ab07eb5248298a3f91c1cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:24Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5546'
file_name: IST-2011-0006_IST-2011-0006.pdf
file_size: 335997
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '18'
related_material:
record:
- id: '3341'
relation: later_version
status: public
status: public
title: Robustness of structurally equivalent concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5384'
abstract:
- lang: eng
text: 'We consider probabilistic automata on infinite words with acceptance defined
by parity conditions. We consider three qualitative decision problems: (i) the
positive decision problem asks whether there is a word that is accepted with positive
probability; (ii) the almost decision problem asks whether there is a word that
is accepted with probability 1; and (iii) the limit decision problem asks whether
for every ε > 0 there is a word that is accepted with probability at least 1 −
ε. We unify and generalize several decidability results for probabilistic automata
over infinite words, and identify a robust (closed under union and intersection)
subclass of probabilistic automata for which all the qualitative decision problems
are decidable for parity conditions. We also show that if the input words are
restricted to lasso shape words, then the positive and almost problems are decidable
for all probabilistic automata with parity conditions.'
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: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Tracol M. Decidable Problems for Probabilistic Automata on
Infinite Words. IST Austria; 2011. doi:10.15479/AT:IST-2011-0004
apa: Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic
automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
chicago: Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic
Automata on Infinite Words. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0004.
ieee: K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata
on infinite words. IST Austria, 2011.
ista: Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata
on infinite words, IST Austria, 30p.
mla: Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic
Automata on Infinite Words. IST Austria, 2011, doi:10.15479/AT:IST-2011-0004.
short: K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on
Infinite Words, IST Austria, 2011.
corr_author: '1'
date_created: 2018-12-12T11:39:01Z
date_published: 2011-04-11T00:00:00Z
date_updated: 2025-09-30T08:07:38Z
day: '11'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0004
file:
- access_level: open_access
checksum: f5a0f664fadc335990f5fcf138df19f1
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:23Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5545'
file_name: IST-2011-004_IST-2011-0004.pdf
file_size: 570827
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '30'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '20'
related_material:
record:
- id: '2957'
relation: later_version
status: public
status: public
title: Decidable problems for probabilistic automata on infinite words
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5385'
abstract:
- lang: eng
text: There is recently a significant effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions, aiming for a general and flexible
framework for quantitative-oriented specifications. In the heart of quantitative
objectives lies the accumulation of values along a computation. It is either the
accumulated summation, as with the energy objectives, or the accumulated average,
as with the mean-payoff objectives. We investigate the extension of temporal logics
with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
a numeric variable of the system, c is a constant rational number, and Sum(v)
and Avg(v) denote the accumulated sum and average of the values of v from the
beginning of the computation up to the current point of time. We also allow the
path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
to the average value along an entire computation. We study the border of decidability
for extensions of various temporal logics. In particular, we show that extending
the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
prefix-accumulation assertions and extending LTL with path-accumulation assertions,
result in temporal logics whose model-checking problem is decidable. The extended
logics allow to significantly extend the currently known energy and mean-payoff
objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”,
allowing, for example, to specify constraints on the average waiting time between
a request and a grant. On the negative side, we show that the fragment we point
to is, in a sense, the maximal logic whose extension with prefix-accumulation
assertions permits a decidable model-checking procedure. Extending a temporal
logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
problem undecidable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications
with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003
apa: Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal
specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.
ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications
with accumulative values. IST Austria, 2011.
ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
with accumulative values, IST Austria, 14p.
mla: Boker, Udi, et al. Temporal Specifications with Accumulative Values.
IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications
with Accumulative Values, IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-04-04T00:00:00Z
date_updated: 2025-09-30T09:27:29Z
day: '04'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.15479/AT:IST-2011-0003
ec_funded: 1
file:
- access_level: open_access
checksum: 8491d0d48c4911620ecd5350b413c11e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:00Z
date_updated: 2020-07-14T12:46:41Z
file_id: '5461'
file_name: IST-2011-0003_IST-2011-0003.pdf
file_size: 366281
relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '14'
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
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '21'
related_material:
record:
- id: '2038'
relation: later_version
status: public
- id: '3356'
relation: later_version
status: public
status: public
title: Temporal specifications with accumulative values
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5387'
abstract:
- lang: eng
text: We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy
parity objectives. In system design, the parity objective is used to encode ω-regular
specifications, and the mean-payoff and energy objectives can be used to model
quantitative resource constraints. The energy condition re- quires that the resource
level never drops below 0, and the mean-payoff condi- tion requires that the limit-average
value of the resource consumption is within a threshold. While these two (energy
and mean-payoff) classical conditions are equivalent for two-player games, we
show that they differ for MDPs. We show that the problem of deciding whether a
state is almost-sure winning (i.e., winning with probability 1) in energy parity
MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable
in polynomial time, improving a recent PSPACE bound.
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
citation:
ama: Chatterjee K, Doyen L. Energy and Mean-Payoff Parity Markov Decision Processes.
IST Austria; 2011. doi:10.15479/AT:IST-2011-0001
apa: Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov
decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001
chicago: Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity
Markov Decision Processes. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0001.
ieee: K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision
processes. IST Austria, 2011.
ista: Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision
processes, IST Austria, 20p.
mla: Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity
Markov Decision Processes. IST Austria, 2011, doi:10.15479/AT:IST-2011-0001.
short: K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes,
IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-02-16T00:00:00Z
date_updated: 2025-04-15T08:12:14Z
day: '16'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0001
file:
- access_level: open_access
checksum: 824d6c70e6d3feb3e836b009e0b3cf73
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:57Z
date_updated: 2020-07-14T12:46:41Z
file_id: '5458'
file_name: IST-2011-0001_IST-2011-0001.pdf
file_size: 329976
relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '23'
related_material:
record:
- id: '3345'
relation: later_version
status: public
status: public
title: Energy and mean-payoff parity Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3315'
abstract:
- lang: eng
text: We consider two-player games played in real time on game structures with clocks
where the objectives of players are described using parity conditions. The games
are concurrent in that at each turn, both players independently propose a time
delay and an action, and the action with the shorter delay is chosen. To prevent
a player from winning by blocking time, we restrict each player to play strategies
that ensure that the player cannot be responsible for causing a zeno run. First,
we present an efficient reduction of these games to turn-based (i.e., not concurrent)
finite-state (i.e., untimed) parity games. Our reduction improves the best known
complexity for solving timed parity games. Moreover, the rich class of algorithms
for classical parity games can now be applied to timed parity games. The states
of the resulting game are based on clock regions of the original game, and the
state space of the finite game is linear in the size of the region graph. Second,
we consider two restricted classes of strategies for the player that represents
the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust
winning strategies. Using a limit-robust winning strategy, the controller cannot
choose an exact real-valued time delay but must allow for some nonzero jitter
in each of its actions. If there is a given lower bound on the jitter, then the
strategy is bounded-robust winning. We show that exact strategies are more powerful
than limit-robust strategies, which are more powerful than bounded-robust winning
strategies for any bound. For both kinds of robust strategies, we present efficient
reductions to standard timed automaton games. These reductions provide algorithms
for the synthesis of robust real-time controllers.
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: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness.
Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games:
Complexity and robustness. Logical Methods in Computer Science. International
Federation of Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
Parity Games: Complexity and Robustness.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.'
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity
and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International
Federation of Computational Logic, 2011.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity
and robustness. Logical Methods in Computer Science. 7(4).'
mla: 'Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”
Logical Methods in Computer Science, vol. 7, no. 4, International Federation
of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.'
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science
7 (2011).
corr_author: '1'
date_created: 2018-12-11T12:02:37Z
date_published: 2011-12-14T00:00:00Z
date_updated: 2026-05-29T10:16:19Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-7(4:8)2011
ec_funded: 1
file:
- access_level: open_access
checksum: 3480e1594bbef25ff7462fa93a8a814e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:42Z
date_updated: 2020-07-14T12:46:07Z
file_id: '5231'
file_name: IST-2016-86-v2+1_1011.0688_3_.pdf
file_size: 588863
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _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: '3324'
pubrep_id: '506'
quality_controlled: '1'
related_material:
record:
- id: '3876'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Timed parity games: Complexity and robustness'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2011'
...
---
_id: '3316'
abstract:
- lang: eng
text: In addition to being correct, a system should be robust, that is, it should
behave reasonably even after receiving unexpected inputs. In this paper, we summarize
two formal notions of robustness that we have introduced previously for reactive
systems. One of the notions is based on assigning costs for failures on a user-provided
notion of incorrect transitions in a specification. Here, we define a system to
be robust if a finite number of incorrect inputs does not lead to an infinite
number of incorrect outputs. We also give a more refined notion of robustness
that aims to minimize the ratio of output failures to input failures. The second
notion is aimed at liveness. In contrast to the previous notion, it has no concept
of recovery from an error. Instead, it compares the ratio of the number of liveness
constraints that the system violates to the number of liveness constraints that
the environment violates.
article_processing_charge: No
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. Specification-centered
robustness. In: 6th IEEE International Symposium on Industrial and Embedded
Systems. IEEE; 2011:176-185. doi:10.1109/SIES.2011.5953660'
apa: 'Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann,
B. (2011). Specification-centered robustness. In 6th IEEE International Symposium
on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE.
https://doi.org/10.1109/SIES.2011.5953660'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International
Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
ieee: R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered
robustness,” in 6th IEEE International Symposium on Industrial and Embedded
Systems, Vasteras, Sweden, 2011, pp. 176–185.
ista: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered
robustness. 6th IEEE International Symposium on Industrial and Embedded Systems.
SIES: International Symposium on Industrial Embedded Systems, 176–185.'
mla: Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International
Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.
short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th
IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp.
176–185.
conference:
end_date: 2011-06-17
location: Vasteras, Sweden
name: 'SIES: International Symposium on Industrial Embedded Systems'
start_date: 2011-06-15
date_created: 2018-12-11T12:02:38Z
date_published: 2011-07-14T00:00:00Z
date_updated: 2026-06-18T18:43:15Z
day: '14'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/SIES.2011.5953660
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openlib.tugraz.at/download.php?id=5cb57c8a49344&location=browse
month: '07'
oa: 1
oa_version: Published Version
page: 176 - 185
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 6th IEEE International Symposium on Industrial and Embedded Systems
publication_status: published
publisher: IEEE
publist_id: '3323'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Specification-centered robustness
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3338'
abstract:
- lang: eng
text: 'We consider 2-player games played on a finite state space for an infinite
number of rounds. The games are concurrent: in each round, the two players (player
1 and player 2) choose their moves inde- pendently and simultaneously; the current
state and the two moves determine the successor state. We study concurrent games
with ω-regular winning conditions specified as parity objectives. We consider
the qualitative analysis problems: the computation of the almost-sure and limit-sure
winning set of states, where player 1 can ensure to win with probability 1 and
with probability arbitrarily close to 1, respec- tively. In general the almost-sure
and limit-sure winning strategies require both infinite-memory as well as infinite-precision
(to describe probabilities). We study the bounded-rationality problem for qualitative
analysis of concurrent parity games, where the strategy set for player 1 is restricted
to bounded-resource strategies. In terms of precision, strategies can be deterministic,
uniform, finite-precision or infinite- precision; and in terms of memory, strategies
can be memoryless, finite-memory or infinite-memory. We present a precise and
complete characterization of the qualitative winning sets for all combinations
of classes of strategies. In particular, we show that uniform memoryless strategies
are as powerful as finite-precision infinite-memory strategies, and infinite-precision
memoryless strategies are as power- ful as infinite-precision finite-memory strategies.
We show that the winning sets can be computed in O(n2d+3) time, where n is the
size of the game structure and 2d is the number of priorities (or colors), and
our algorithms are symbolic. The membership problem of whether a state belongs
to a winning set can be decided in NP ∩ coNP. While this complexity is the same
as for the simpler class of turn-based parity games, where in each state only
one of the two players has a choice of moves, our algorithms, that are obtained
by characterization of the winning sets as μ-calculus formulas, are considerably
more involved than those for turn-based games.'
article_number: '1107.2146'
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
citation:
ama: Chatterjee K. Bounded rationality in concurrent parity games. arXiv.:1-51.
doi:10.48550/arXiv.1107.2146
apa: Chatterjee, K. (n.d.). Bounded rationality in concurrent parity games. arXiv.
https://doi.org/10.48550/arXiv.1107.2146
chicago: Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.1107.2146.
ieee: K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv.
pp. 1–51.
ista: Chatterjee K. Bounded rationality in concurrent parity games. arXiv, 1–51,
1107.2146.
mla: Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv,
1107.2146, pp. 1–51, doi:10.48550/arXiv.1107.2146.
short: K. Chatterjee, ArXiv (n.d.) 1–51.
corr_author: '1'
date_created: 2018-12-11T12:02:45Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2025-06-26T09:28:52Z
day: '11'
department:
- _id: KrCh
doi: 10.48550/arXiv.1107.2146
external_id:
arxiv:
- '1107.2146'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2146
month: '07'
oa: 1
oa_version: Preprint
page: 1 - 51
publication: arXiv
publication_status: submitted
publist_id: '3287'
related_material:
record:
- id: '5380'
relation: earlier_version
status: public
status: public
title: Bounded rationality in concurrent parity games
type: preprint
user_id: 2DF688A6-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. '
article_number: '1107.2132'
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: 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. doi:10.48550/arXiv.1107.2132
apa: Chatterjee, K., De Alfaro, L., & Pritam, R. (n.d.). Magnifying lens abstraction
for stochastic games with discounted and long-run average objectives. arXiv.
https://doi.org/10.48550/arXiv.1107.2132
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens
Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.1107.2132.
ieee: K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for
stochastic games with discounted and long-run average objectives,” arXiv.
.
ista: Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic
games with discounted and long-run average objectives. arXiv, 1107.2132.
mla: Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic
Games with Discounted and Long-Run Average Objectives.” ArXiv, 1107.2132,
doi:10.48550/arXiv.1107.2132.
short: K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (n.d.).
date_created: 2018-12-11T12:02:46Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2025-06-26T09:24:35Z
day: '11'
department:
- _id: KrCh
doi: 10.48550/arXiv.1107.2132
external_id:
arxiv:
- '1107.2132'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1107.2132
month: '07'
oa: 1
oa_version: Preprint
page: '17'
publication: arXiv
publication_status: submitted
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
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: 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 M, 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., 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 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. 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 M, 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. 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: 2025-09-29T13:50:32Z
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
scopus_import: '1'
status: public
title: Symbolic algorithms for qualitative analysis of Markov decision processes with
Büchi objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6806
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 M. 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. (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 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. 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 M. 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 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. 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: 2024-11-06T12:28:50Z
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'
...
---
OA_type: closed access
_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
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
citation:
ama: 'Chatterjee K. Graph games with reachability objectives. In: 5th International
Workshop on Reachability Problems. 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 5th
International Workshop on Reachability Problems (Vol. 6945, pp. 1–1). Genoa,
Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1'
chicago: Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” In
5th International Workshop on Reachability Problems, 6945:1–1. Springer,
2011. https://doi.org/10.1007/978-3-642-24288-5_1.
ieee: K. Chatterjee, “Graph games with reachability objectives,” in 5th International
Workshop on Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
ista: 'Chatterjee K. 2011. Graph games with reachability objectives. 5th International
Workshop on Reachability Problems. RP: Reachability Problems, LNCS, vol. 6945,
1–1.'
mla: Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” 5th
International Workshop on Reachability Problems, vol. 6945, Springer, 2011,
pp. 1–1, doi:10.1007/978-3-642-24288-5_1.
short: K. Chatterjee, in:, 5th International Workshop on Reachability Problems,
Springer, 2011, pp. 1–1.
conference:
end_date: 2011-09-30
location: Genoa, Italy
name: 'RP: Reachability Problems'
start_date: 2011-09-28
corr_author: '1'
date_created: 2018-12-11T12:02:47Z
date_published: 2011-10-15T00:00:00Z
date_updated: 2025-05-20T06:00:59Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-24288-5_1
intvolume: ' 6945'
language:
- iso: eng
month: '10'
oa_version: None
page: 1 - 1
publication: 5th International Workshop on Reachability Problems
publication_identifier:
eisbn:
- '9783642242885'
eissn:
- 1611-3349
publication_status: published
publisher: Springer
publist_id: '3277'
quality_controlled: '1'
status: public
title: Graph games with reachability objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6945
year: '2011'
...
---
_id: '3345'
abstract:
- lang: eng
text: We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy
parity objectives. In system design, the parity objective is used to encode ω-regular
specifications, and the mean-payoff and energy objectives can be used to model
quantitative resource constraints. The energy condition re- quires that the resource
level never drops below 0, and the mean-payoff condi- tion requires that the limit-average
value of the resource consumption is within a threshold. While these two (energy
and mean-payoff) classical conditions are equivalent for two-player games, we
show that they differ for MDPs. We show that the problem of deciding whether a
state is almost-sure winning (i.e., winning with probability 1) in energy parity
MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable
in polynomial time, improving a recent PSPACE bound.
alternative_title:
- LNCS
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes.
In: Vol 6907. Springer; 2011:206-218. doi:10.1007/978-3-642-22993-0_21'
apa: 'Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov
Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical
Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity
Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
ieee: 'K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision
Processes,” presented at the MFCS: Mathematical Foundations of Computer Science,
Warsaw, Poland, 2011, vol. 6907, pp. 206–218.'
ista: 'Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision
Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907,
206–218.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity
Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.
short: K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
conference:
end_date: 2011-08-26
location: Warsaw, Poland
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2011-08-22
date_created: 2018-12-11T12:02:48Z
date_published: 2011-09-28T00:00:00Z
date_updated: 2023-02-23T12:23:59Z
day: '28'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22993-0_21
external_id:
arxiv:
- '1104.2909'
intvolume: ' 6907'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2909
month: '09'
oa: 1
oa_version: Preprint
page: 206 - 218
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3276'
quality_controlled: '1'
related_material:
record:
- id: '5387'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Energy and mean-payoff parity Markov Decision Processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6907
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'
article_processing_charge: No
arxiv: 1
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: 2025-09-30T09:07:47Z
day: '21'
department:
- _id: KrCh
doi: 10.1109/LICS.2011.10
ec_funded: 1
external_id:
arxiv:
- '1104.3489'
isi:
- '000297350400006'
isi: 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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
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: 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
corr_author: '1'
date_created: 2018-12-11T12:02:48Z
date_published: 2011-06-16T00:00:00Z
date_updated: 2024-10-09T20:54:28Z
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'
...