---
_id: '5404'
abstract:
- lang: eng
text: 'We study finite-state two-player (zero-sum) concurrent mean-payoff games
played on a graph. We focus on the important sub-class of ergodic games where
all states are visited infinitely often with probability 1. The algorithmic study
of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966,
but all basic complexity questions have remained unresolved. Our main results
for ergodic games are as follows: We establish (1) an optimal exponential bound
on the patience of stationary strategies (where patience of a distribution is
the inverse of the smallest positive probability and represents a complexity measure
of a stationary strategy); (2) the approximation problem lie in FNP; (3) the approximation
problem is at least as hard as the decision problem for simple stochastic games
(for which NP and coNP is the long-standing best known bound). We show that the
exact value can be expressed in the existential theory of the reals, and also
establish square-root sum hardness for a related class of 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
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: Chatterjee K, Ibsen-Jensen R. The Complexity of Ergodic Games. IST Austria;
2013. doi:10.15479/AT:IST-2013-127-v1-1
apa: Chatterjee, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic
games. IST Austria. https://doi.org/10.15479/AT:IST-2013-127-v1-1
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic
Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
ieee: K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games.
IST Austria, 2013.
ista: Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria,
29p.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic
Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-127-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria,
2013.
date_created: 2018-12-12T11:39:08Z
date_published: 2013-07-03T00:00:00Z
date_updated: 2023-02-23T10:30:55Z
day: '03'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-127-v1-1
file:
- access_level: open_access
checksum: 79ee5e677a82611ce06e0360c69d494a
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:35Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5496'
file_name: IST-2013-127-v1+1_ergodic.pdf
file_size: 517275
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '127'
related_material:
record:
- id: '2162'
relation: later_version
status: public
status: public
title: The complexity of ergodic games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5405'
abstract:
- lang: eng
text: "The theory of graph games is the foundation for modeling and synthesizing
reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player
games where some transitions of the game graph are controlled by two adversarial
players, the System and the Environment, and the other transitions are determined
probabilistically. We consider 2-1/2-player games where the objective of the System
is the conjunction of a qualitative objective (specified as a parity condition)
and a quantitative objective (specified as a mean-payoff condition). We establish
that the problem of deciding whether the System can ensure that the probability
to satisfy the mean-payoff parity objective is at least a given threshold is in
NP ∩ coNP, matching the best known bound in the special case of 2-player games
(where all transitions are deterministic) with only parity objectives, or with
only mean-payoff objectives. We present an algorithm running\r\nin time O(d ·
n^{2d}·MeanGame) to compute the set of almost-sure winning states from which the
objective\r\ncan be ensured with probability 1, where n is the number of states
of the game, d the number of priorities\r\nof the parity objective, and MeanGame
is the complexity to compute the set of almost-sure winning states\r\nin 2-1/2-player
mean-payoff games. Our results are useful in the synthesis of stochastic reactive
systems\r\nwith both functional requirement (given as a qualitative objective)
and performance requirement (given\r\nas a quantitative objective)."
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: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- first_name: Youssouf
full_name: Oualhadj, Youssouf
last_name: Oualhadj
citation:
ama: Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-Information Stochastic
Mean-Payoff Parity Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-128-v1-1
apa: Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information
stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj.
Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013.
https://doi.org/10.15479/AT:IST-2013-128-v1-1.
ieee: K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information
stochastic mean-payoff parity games. IST Austria, 2013.
ista: Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic
mean-payoff parity games, IST Austria, 22p.
mla: Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff
Parity Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-128-v1-1.
short: K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic
Mean-Payoff Parity Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-08T00:00:00Z
date_updated: 2023-02-23T10:33:08Z
day: '08'
ddc:
- '000'
- '005'
- '510'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-128-v1-1
file:
- access_level: open_access
checksum: ede787a10e74e4f7db302fab8f12f3ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:54Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5516'
file_name: IST-2013-128-v1+1_full_stoch_mpp.pdf
file_size: 387467
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '128'
related_material:
record:
- id: '2212'
relation: later_version
status: public
status: public
title: Perfect-information stochastic mean-payoff parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5409'
abstract:
- lang: eng
text: "The edit distance between two (untimed) traces is the minimum cost of a sequence
of edit operations (insertion, deletion, or substitution) needed to transform
one trace to the other. Edit distances have been extensively studied in the untimed
setting, and form the basis for approximate matching of sequences in different
domains such as coding theory, parsing, and speech recognition. \r\nIn this paper,
we lift the study of edit distances from untimed languages to the timed setting.
We define an edit distance between timed words which incorporates both the edit
distance between the untimed words and the absolute difference in timestamps.
Our edit distance between two timed words is computable in polynomial time. Further,
we show that the edit distance between a timed word and a timed language generated
by a timed automaton, defined as the edit distance between the word and the closest
word in the language, is PSPACE-complete. While computing the edit distance between
two timed automata is undecidable, we show that the approximate version, where
we decide if the edit distance between two timed automata is either less than
a given parameter or more than delta away from the parameter, for delta>0, can
be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques
can be generalized to the setting of hybrid systems, and we show analogous decidability
results for rectangular automata."
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
citation:
ama: Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit Distance for Timed Automata.
IST Austria; 2013. doi:10.15479/AT:IST-2013-144-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance
for timed automata. IST Austria. https://doi.org/10.15479/AT:IST-2013-144-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit
Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed
automata. IST Austria, 2013.
ista: Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata,
IST Austria, 12p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. IST
Austria, 2013, doi:10.15479/AT:IST-2013-144-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata,
IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-10-30T00:00:00Z
date_updated: 2023-02-23T10:33:18Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-144-v1-1
file:
- access_level: open_access
checksum: 0f7633081ba8299c543322f0ad08571f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:08Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5469'
file_name: IST-2013-144-v1+1_main.pdf
file_size: 336377
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
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: '144'
related_material:
record:
- id: '2216'
relation: later_version
status: public
status: public
title: Edit distance for timed automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1376'
abstract:
- lang: eng
text: 'We consider the distributed synthesis problem for temporal logic specifications.
Traditionally, the problem has been studied for LTL, and the previous results
show that the problem is decidable iff there is no information fork in the architecture.
We consider the problem for fragments of LTL and our main results are as follows:
(1) We show that the problem is undecidable for architectures with information
forks even for the fragment of LTL with temporal operators restricted to next
and eventually. (2) For specifications restricted to globally along with non-nested
next operators, we establish decidability (in EXPSPACE) for star architectures
where the processes receive disjoint inputs, whereas we establish undecidability
for architectures containing an information fork-meet structure. (3) Finally,
we consider LTL without the next operator, and establish decidability (NEXPTIME-complete)
for all architectures for a fragment that consists of a set of safety assumptions,
and a set of guarantees where each guarantee is a safety, reachability, or liveness
condition.'
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis
for LTL fragments. In: 13th International Conference on Formal Methods in Computer-Aided
Design. IEEE; 2013:18-25. doi:10.1109/FMCAD.2013.6679386'
apa: 'Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013).
Distributed synthesis for LTL fragments. In 13th International Conference on
Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United
States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis.
“Distributed Synthesis for LTL Fragments.” In 13th International Conference
on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679386.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed
synthesis for LTL fragments,” in 13th International Conference on Formal Methods
in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
ista: 'Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis
for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided
Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.'
mla: Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” 13th
International Conference on Formal Methods in Computer-Aided Design, IEEE,
2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.
short: K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International
Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
conference:
end_date: 2013-10-23
location: Portland, OR, United States
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2013-10-20
date_created: 2018-12-11T11:51:40Z
date_published: 2013-12-11T00:00:00Z
date_updated: 2023-02-23T12:24:53Z
day: '11'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/FMCAD.2013.6679386
ec_funded: 1
language:
- iso: eng
month: '12'
oa_version: None
page: 18 - 25
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: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 13th International Conference on Formal Methods in Computer-Aided Design
publication_status: published
publisher: IEEE
publist_id: '5835'
quality_controlled: '1'
related_material:
record:
- id: '5406'
relation: earlier_version
status: public
status: public
title: Distributed synthesis for LTL fragments
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5406'
abstract:
- lang: eng
text: 'We consider the distributed synthesis problem fortemporal logic specifications.
Traditionally, the problem has been studied for LTL, and the previous results
show that the problem is decidable iff there is no information fork in the architecture.
We consider the problem for fragments of LTLand our main results are as follows:
(1) We show that the problem is undecidable for architectures with information
forks even for the fragment of LTL with temporal operators restricted to next
and eventually. (2) For specifications restricted to globally along with non-nested
next operators, we establish decidability (in EXPSPACE) for star architectures
where the processes receive disjoint inputs, whereas we establish undecidability
for architectures containing an information fork-meet structure. (3)Finally, we
consider LTL without the next operator, and establish decidability (NEXPTIME-complete)
for all architectures for a fragment that consists of a set of safety assumptions,
and a set of guarantees where each guarantee is a safety, reachability, or liveness
condition.'
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed Synthesis
for LTL Fragments. IST Austria; 2013. doi:10.15479/AT:IST-2013-130-v1-1
apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013).
Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis.
Distributed Synthesis for LTL Fragments. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-130-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed
synthesis for LTL Fragments. IST Austria, 2013.
ista: Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis
for LTL Fragments, IST Austria, 11p.
mla: Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments.
IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.
short: K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis
for LTL Fragments, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-08T00:00:00Z
date_updated: 2023-02-21T17:01:26Z
day: '08'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2013-130-v1-1
file:
- access_level: open_access
checksum: 855513ebaf6f72228800c5fdb522f93c
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:18Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5540'
file_name: IST-2013-130-v1+1_Distributed_Synthesis.pdf
file_size: 467895
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '11'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '130'
related_material:
record:
- id: '1376'
relation: later_version
status: public
status: public
title: Distributed synthesis for LTL Fragments
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5408'
abstract:
- lang: eng
text: "We consider two-player partial-observation stochastic games where player
1 has partial observation and player 2 has perfect observation. The winning condition
we study are omega-regular conditions specified as parity objectives. The qualitative
analysis problem given a partial-observation stochastic game and a parity objective
asks whether there is a strategy to ensure that the objective is satisfied with
probability 1 (resp. positive probability). While the qualitative analysis problems
are known to be undecidable even for very special cases of parity objectives,
they were shown to be decidable in 2EXPTIME under finite-memory strategies. We
improve the complexity and show that the qualitative analysis problems for partial-observation
stochastic parity games under finite-memory strategies are \r\nEXPTIME-complete;
and also establish optimal (exponential) memory bounds for finite-memory strategies
required for qualitative analysis. "
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: Sumit
full_name: Nain, Sumit
last_name: Nain
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: Chatterjee K, Doyen L, Nain S, Vardi M. The Complexity of Partial-Observation
Stochastic Parity Games with Finite-Memory Strategies. IST Austria; 2013.
doi:10.15479/AT:IST-2013-141-v1-1
apa: Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity
of partial-observation stochastic parity games with finite-memory strategies.
IST Austria. https://doi.org/10.15479/AT:IST-2013-141-v1-1
chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The
Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.
IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-141-v1-1.
ieee: K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation
stochastic parity games with finite-memory strategies. IST Austria, 2013.
ista: Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation
stochastic parity games with finite-memory strategies, IST Austria, 17p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic
Parity Games with Finite-Memory Strategies. IST Austria, 2013, doi:10.15479/AT:IST-2013-141-v1-1.
short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation
Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-09-12T00:00:00Z
date_updated: 2023-02-23T10:33:11Z
day: '12'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-141-v1-1
file:
- access_level: open_access
checksum: 226bc791124f8d3138379778ce834e86
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:16Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5477'
file_name: IST-2013-141-v1+1_main-tech-rpt.pdf
file_size: 300481
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '141'
related_material:
record:
- id: '2213'
relation: later_version
status: public
status: public
title: The complexity of partial-observation stochastic parity games with finite-memory
strategies
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5410'
abstract:
- lang: eng
text: "Board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only
in development of mathematical and logical skills, but also in emotional and social
development. In this paper, we address the problem of generating targeted starting
positions for such games. This can facilitate new approaches for bringing novice
players to mastery, and also leads to discovery of interesting game variants.
\r\nOur approach generates starting states of varying hardness levels for player
1 in a two-player board game, given rules of the board game, the desired number
of steps required for player 1 to win, and the expertise levels of the two players.
Our approach leverages symbolic methods and iterative simulation to efficiently
search the extremely large state space. We present experimental results that include
discovery of states of varying hardness levels for several simple grid-based board
games. Also, the presence of such states for standard game variants like Tic-Tac-Toe
on board size 4x4 opens up new games to be played that have not been played for
ages since the default start state is heavily biased. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: Ahmed U, Chatterjee K, Gulwani S. Automatic Generation of Alternative Starting
Positions for Traditional Board Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-146-v1-1
apa: Ahmed, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation
of alternative starting positions for traditional board games. IST Austria.
https://doi.org/10.15479/AT:IST-2013-146-v1-1
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation
of Alternative Starting Positions for Traditional Board Games. IST Austria,
2013. https://doi.org/10.15479/AT:IST-2013-146-v1-1.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative
starting positions for traditional board games. IST Austria, 2013.
ista: Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative
starting positions for traditional board games, IST Austria, 13p.
mla: Ahmed, Umair, et al. Automatic Generation of Alternative Starting Positions
for Traditional Board Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-146-v1-1.
short: U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative
Starting Positions for Traditional Board Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-12-03T00:00:00Z
date_updated: 2023-02-23T10:00:50Z
day: '03'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-146-v1-1
file:
- access_level: open_access
checksum: 409f3aaaf1184e4057b89cbb449dac80
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:06Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5528'
file_name: IST-2013-146-v1+1_main.pdf
file_size: 818189
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '13'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '146'
related_material:
record:
- id: '1481'
relation: later_version
status: public
status: public
title: Automatic generation of alternative starting positions for traditional board
games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2329'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis such as synthesis and verification of open systems. In this
work, we consider both finite-state game graphs, and recursive game graphs (or
pushdown game graphs) that model the control flow of sequential programs with
recursion. The objectives we study are multidimensional mean-payoff objectives,
where the goal of player 1 is to ensure that the mean-payoff is non-negative in
all dimensions. In pushdown games two types of strategies are relevant: (1) global
strategies, that depend on the entire global history; and (2) modular strategies,
that have only local memory and thus do not depend on the context of invocation.
Our main contributions are as follows: (1) We show that finite-state multidimensional
mean-payoff games can be solved in polynomial time if the number of dimensions
and the maximal absolute value of the weights are fixed; whereas if the number
of dimensions is arbitrary, then the problem is known to be coNP-complete. (2)
We show that pushdown graphs with multidimensional mean-payoff objectives can
be solved in polynomial time. For both (1) and (2) our algorithms are based on
hyperplane separation technique. (3) For pushdown games under global strategies
both one and multidimensional mean-payoff objectives problems are known to be
undecidable, and we show that under modular strategies the multidimensional problem
is also undecidable; under modular strategies the one-dimensional problem is NP-complete.
We show that if the number of modules, the number of exits, and the maximal absolute
value of the weights are fixed, then pushdown games under modular strategies with
one-dimensional mean-payoff objectives can be solved in polynomial time, and if
either the number of exits or the number of modules is unbounded, then the problem
is NP-hard. (4) Finally we show that a fixed parameter tractable algorithm for
finite-state multidimensional mean-payoff games or pushdown games under modular
strategies with one-dimensional mean-payoff objectives would imply the fixed parameter
tractability of parity games.'
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: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional
mean-payoff games. 2013;8052:500-515. doi:10.1007/978-3-642-40184-8_35
apa: 'Chatterjee, K., & Velner, Y. (2013). Hyperplane separation technique for
multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory,
Buenos Aires, Argentinia: Springer. https://doi.org/10.1007/978-3-642-40184-8_35'
chicago: Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique
for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-40184-8_35.
ieee: K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional
mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
ista: Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional
mean-payoff games. 8052, 500–515.
mla: Chatterjee, Krishnendu, and Yaron Velner. Hyperplane Separation Technique
for Multidimensional Mean-Payoff Games. Vol. 8052, Springer, 2013, pp. 500–15,
doi:10.1007/978-3-642-40184-8_35.
short: K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
conference:
end_date: 2013-08-30
location: Buenos Aires, Argentinia
name: 'CONCUR: Concurrency Theory'
start_date: 2013-08-27
date_created: 2018-12-11T11:57:01Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2023-02-23T13:00:42Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-40184-8_35
ec_funded: 1
external_id:
arxiv:
- '1210.3141'
intvolume: ' 8052'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.3141
month: '08'
oa: 1
oa_version: Preprint
page: 500 - 515
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: '4597'
quality_controlled: '1'
related_material:
record:
- id: '717'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Hyperplane separation technique for multidimensional mean-payoff games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8052
year: '2013'
...
---
_id: '9749'
abstract:
- lang: eng
text: Cooperative behavior, where one individual incurs a cost to help another,
is a wide spread phenomenon. Here we study direct reciprocity in the context of
the alternating Prisoner's Dilemma. We consider all strategies that can be implemented
by one and two-state automata. We calculate the payoff matrix of all pairwise
encounters in the presence of noise. We explore deterministic selection dynamics
with and without mutation. Using different error rates and payoff values, we observe
convergence to a small number of distinct equilibria. Two of them are uncooperative
strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium
is mixed and represents a cooperative alliance of several strategies, dominated
by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent
has cooperated; it defects once when the opponent has defected, but subsequently
Forgiver attempts to re-establish cooperation even if the opponent has defected
again. Forgiver is not an evolutionarily stable strategy, but the alliance, which
it rules, is asymptotically stable. For a wide range of parameter values the most
commonly observed outcome is convergence to the mixed equilibrium, dominated by
Forgiver. Our results show that although forgiving might incur a short-term loss
it can lead to a long-term gain. Forgiveness facilitates stable cooperation in
the presence of exploitation and noise.
article_processing_charge: No
author:
- first_name: Benjamin
full_name: Zagorsky, Benjamin
last_name: Zagorsky
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating
prisoner’s dilemma . 2013. doi:10.1371/journal.pone.0080814.s001
apa: Zagorsky, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver
triumphs in alternating prisoner’s dilemma . Public Library of Science. https://doi.org/10.1371/journal.pone.0080814.s001
chicago: Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin
Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” Public Library
of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.s001.
ieee: B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in
alternating prisoner’s dilemma .” Public Library of Science, 2013.
ista: Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating
prisoner’s dilemma , Public Library of Science, 10.1371/journal.pone.0080814.s001.
mla: Zagorsky, Benjamin, et al. Forgiver Triumphs in Alternating Prisoner’s Dilemma
. Public Library of Science, 2013, doi:10.1371/journal.pone.0080814.s001.
short: B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, (2013).
date_created: 2021-07-28T15:45:07Z
date_published: 2013-12-12T00:00:00Z
date_updated: 2023-02-23T10:34:39Z
day: '12'
department:
- _id: KrCh
doi: 10.1371/journal.pone.0080814.s001
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '2247'
relation: used_in_publication
status: public
status: public
title: 'Forgiver triumphs in alternating prisoner''s dilemma '
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2013'
...
---
_id: '10902'
abstract:
- lang: eng
text: We consider how to edit strings from a source language so that the edited
strings belong to a target language, where the languages are given as deterministic
finite automata. Non-streaming (or offline) transducers perform edits given the
whole source string. We show that the class of deterministic one-pass transducers
with registers along with increment and min operation suffices for computing optimal
edit distance, whereas the same class of transducers without the min operation
is not sufficient. Streaming (or online) transducers perform edits as the letters
of the source string are received. We present a polynomial time algorithm for
the partial-repair problem that given a bound α asks for the construction of a
deterministic streaming transducer (if one exists) that ensures that the ‘maximum
fraction’ η of the strings of the source language are edited, within cost α, to
the target language.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting
the problem of identifying a deterministic transducer to compute the optimal cost,
and to Martin Chmelik for his comments on the introduction.'
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: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th
International Conference on Language and Automata Theory and Applications.
Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20'
apa: 'Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between
languages. In 7th International Conference on Language and Automata Theory
and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.
https://doi.org/10.1007/978-3-642-37064-9_20'
chicago: 'Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel
between Languages.” In 7th International Conference on Language and Automata
Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature,
2013. https://doi.org/10.1007/978-3-642-37064-9_20.'
ieee: K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,”
in 7th International Conference on Language and Automata Theory and Applications,
Bilbao, Spain, 2013, vol. 7810, pp. 214–225.
ista: 'Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages.
7th International Conference on Language and Automata Theory and Applications.
LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol.
7810, 214–225.'
mla: Chatterjee, Krishnendu, et al. “How to Travel between Languages.” 7th International
Conference on Language and Automata Theory and Applications, vol. 7810, Springer
Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.
short: K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on
Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg,
2013, pp. 214–225.
conference:
end_date: 2013-04-05
location: Bilbao, Spain
name: 'LATA: Conference on Language and Automata Theory and Applications'
start_date: 2013-04-02
date_created: 2022-03-21T07:56:21Z
date_published: 2013-04-15T00:00:00Z
date_updated: 2023-09-05T15:10:38Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-37064-9_20
ec_funded: 1
intvolume: ' 7810'
language:
- iso: eng
month: '04'
oa_version: None
page: 214-225
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: 7th International Conference on Language and Automata Theory and Applications
publication_identifier:
eisbn:
- '9783642370649'
eissn:
- 1611-3349
isbn:
- '9783642370632'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: How to travel between languages
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7810
year: '2013'
...
---
_id: '2247'
abstract:
- lang: eng
text: Cooperative behavior, where one individual incurs a cost to help another,
is a wide spread phenomenon. Here we study direct reciprocity in the context of
the alternating Prisoner's Dilemma. We consider all strategies that can be implemented
by one and two-state automata. We calculate the payoff matrix of all pairwise
encounters in the presence of noise. We explore deterministic selection dynamics
with and without mutation. Using different error rates and payoff values, we observe
convergence to a small number of distinct equilibria. Two of them are uncooperative
strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium
is mixed and represents a cooperative alliance of several strategies, dominated
by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent
has cooperated; it defects once when the opponent has defected, but subsequently
Forgiver attempts to re-establish cooperation even if the opponent has defected
again. Forgiver is not an evolutionarily stable strategy, but the alliance, which
it rules, is asymptotically stable. For a wide range of parameter values the most
commonly observed outcome is convergence to the mixed equilibrium, dominated by
Forgiver. Our results show that although forgiving might incur a short-term loss
it can lead to a long-term gain. Forgiveness facilitates stable cooperation in
the presence of exploitation and noise.
article_number: e80814
author:
- first_name: Benjamin
full_name: Zagorsky, Benjamin
last_name: Zagorsky
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating
prisoner’s dilemma . PLoS One. 2013;8(12). doi:10.1371/journal.pone.0080814
apa: Zagorsky, B., Reiter, J., Chatterjee, K., & Nowak, M. (2013). Forgiver
triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of
Science. https://doi.org/10.1371/journal.pone.0080814
chicago: Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin
Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” PLoS One.
Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0080814.
ieee: B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in
alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12. Public Library
of Science, 2013.
ista: Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating
prisoner’s dilemma . PLoS One. 8(12), e80814.
mla: Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma
.” PLoS One, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:10.1371/journal.pone.0080814.
short: B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
date_created: 2018-12-11T11:56:33Z
date_published: 2013-12-12T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1371/journal.pone.0080814
ec_funded: 1
file:
- access_level: open_access
checksum: 808e8b9e6e89658bee4ffbbfac1bd19d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:15Z
date_updated: 2020-07-14T12:45:34Z
file_id: '4868'
file_name: IST-2016-409-v1+1_journal.pone.0080814.pdf
file_size: 1050042
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4702'
pubrep_id: '409'
quality_controlled: '1'
related_material:
record:
- id: '9749'
relation: research_data
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'Forgiver triumphs in alternating prisoner''s dilemma '
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...
---
_id: '2858'
abstract:
- lang: eng
text: Tumor growth is caused by the acquisition of driver mutations, which enhance
the net reproductive rate of cells. Driver mutations may increase cell division,
reduce cell death, or allow cells to overcome density-limiting effects. We study
the dynamics of tumor growth as one additional driver mutation is acquired. Our
models are based on two-type branching processes that terminate in either tumor
disappearance or tumor detection. In our first model, both cell types grow exponentially,
with a faster rate for cells carrying the additional driver. We find that the
additional driver mutation does not affect the survival probability of the lesion,
but can substantially reduce the time to reach the detectable size if the lesion
is slow growing. In our second model, cells lacking the additional driver cannot
exceed a fixed carrying capacity, due to density limitations. In this case, the
time to detection depends strongly on this carrying capacity. Our model provides
a quantitative framework for studying tumor dynamics during different stages of
progression. We observe that early, small lesions need additional drivers, while
late stage metastases are only marginally affected by them. These results help
to explain why additional driver mutations are typically not detected in fast-growing
metastases.
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Benjamin
full_name: Allen, Benjamin
id: 135B5B70-E9D2-11E9-BD74-BB415DA2B523
last_name: Allen
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Božić I, Allen B, Chatterjee K, Nowak M. The effect of one additional
driver mutation on tumor progression. Evolutionary Applications. 2013;6(1):34-45.
doi:10.1111/eva.12020
apa: Reiter, J., Božić, I., Allen, B., Chatterjee, K., & Nowak, M. (2013). The
effect of one additional driver mutation on tumor progression. Evolutionary
Applications. Wiley-Blackwell. https://doi.org/10.1111/eva.12020
chicago: Reiter, Johannes, Ivana Božić, Benjamin Allen, Krishnendu Chatterjee, and
Martin Nowak. “The Effect of One Additional Driver Mutation on Tumor Progression.”
Evolutionary Applications. Wiley-Blackwell, 2013. https://doi.org/10.1111/eva.12020.
ieee: J. Reiter, I. Božić, B. Allen, K. Chatterjee, and M. Nowak, “The effect of
one additional driver mutation on tumor progression,” Evolutionary Applications,
vol. 6, no. 1. Wiley-Blackwell, pp. 34–45, 2013.
ista: Reiter J, Božić I, Allen B, Chatterjee K, Nowak M. 2013. The effect of one
additional driver mutation on tumor progression. Evolutionary Applications. 6(1),
34–45.
mla: Reiter, Johannes, et al. “The Effect of One Additional Driver Mutation on Tumor
Progression.” Evolutionary Applications, vol. 6, no. 1, Wiley-Blackwell,
2013, pp. 34–45, doi:10.1111/eva.12020.
short: J. Reiter, I. Božić, B. Allen, K. Chatterjee, M. Nowak, Evolutionary Applications
6 (2013) 34–45.
date_created: 2018-12-11T11:59:58Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
ddc:
- '570'
department:
- _id: KrCh
doi: 10.1111/eva.12020
ec_funded: 1
file:
- access_level: open_access
checksum: e2955b3889f8a823c3d5a72cb16f8957
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:50Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5173'
file_name: IST-2016-415-v1+1_Reiter_et_al-2013-Evolutionary_Applications.pdf
file_size: 1172037
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 34 - 45
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Evolutionary Applications
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3931'
pubrep_id: '415'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The effect of one additional driver mutation on tumor progression
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2013'
...
---
_id: '2816'
abstract:
- lang: eng
text: In solid tumors, targeted treatments can lead to dramatic regressions, but
responses are often short-lived because resistant cancer cells arise. The major
strategy proposed for overcoming resistance is combination therapy. We present
a mathematical model describing the evolutionary dynamics of lesions in response
to treatment. We first studied 20 melanoma patients receiving vemurafenib. We
then applied our model to an independent set of pancreatic, colorectal, and melanoma
cancer patients with metastatic disease. We find that dual therapy results in
long-term disease control for most patients, if there are no single mutations
that cause cross-resistance to both drugs; in patients with large disease burden,
triple therapy is needed. We also find that simultaneous therapy with two drugs
is much more effective than sequential therapy. Our results provide realistic
expectations for the efficacy of new drug combinations and inform the design of
trials for new cancer therapeutics.
article_number: e00747
author:
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Benjamin
full_name: Allen, Benjamin
last_name: Allen
- first_name: Tibor
full_name: Antal, Tibor
last_name: Antal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Preya
full_name: Shah, Preya
last_name: Shah
- first_name: Yo
full_name: Moon, Yo
last_name: Moon
- first_name: Amin
full_name: Yaqubie, Amin
last_name: Yaqubie
- first_name: Nicole
full_name: Kelly, Nicole
last_name: Kelly
- first_name: Dung
full_name: Le, Dung
last_name: Le
- first_name: Evan
full_name: Lipson, Evan
last_name: Lipson
- first_name: Paul
full_name: Chapman, Paul
last_name: Chapman
- first_name: Luis
full_name: Diaz, Luis
last_name: Diaz
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Božić I, Reiter J, Allen B, et al. Evolutionary dynamics of cancer in response
to targeted combination therapy. eLife. 2013;2. doi:10.7554/eLife.00747
apa: Božić, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P., … Nowak,
M. (2013). Evolutionary dynamics of cancer in response to targeted combination
therapy. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.00747
chicago: Božić, Ivana, Johannes Reiter, Benjamin Allen, Tibor Antal, Krishnendu
Chatterjee, Preya Shah, Yo Moon, et al. “Evolutionary Dynamics of Cancer in Response
to Targeted Combination Therapy.” ELife. eLife Sciences Publications, 2013.
https://doi.org/10.7554/eLife.00747.
ieee: I. Božić et al., “Evolutionary dynamics of cancer in response to targeted
combination therapy,” eLife, vol. 2. eLife Sciences Publications, 2013.
ista: Božić I, Reiter J, Allen B, Antal T, Chatterjee K, Shah P, Moon Y, Yaqubie
A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary
dynamics of cancer in response to targeted combination therapy. eLife. 2, e00747.
mla: Božić, Ivana, et al. “Evolutionary Dynamics of Cancer in Response to Targeted
Combination Therapy.” ELife, vol. 2, e00747, eLife Sciences Publications,
2013, doi:10.7554/eLife.00747.
short: I. Božić, J. Reiter, B. Allen, T. Antal, K. Chatterjee, P. Shah, Y. Moon,
A. Yaqubie, N. Kelly, D. Le, E. Lipson, P. Chapman, L. Diaz, B. Vogelstein, M.
Nowak, ELife 2 (2013).
date_created: 2018-12-11T11:59:45Z
date_published: 2013-06-25T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '25'
ddc:
- '570'
- '610'
department:
- _id: KrCh
doi: 10.7554/eLife.00747
file:
- access_level: open_access
checksum: 2c38c47815eacd8fa66cb8b404cf7c61
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:48Z
date_updated: 2020-07-14T12:45:49Z
file_id: '4967'
file_name: IST-2013-134-v1+1_e00747.full.pdf
file_size: 3358321
relation: main_file
file_date_updated: 2020-07-14T12:45:49Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '3985'
pubrep_id: '134'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Evolutionary dynamics of cancer in response to targeted combination therapy
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2013'
...
---
_id: '2000'
abstract:
- lang: eng
text: In this work we present a flexible tool for tumor progression, which simulates
the evolutionary dynamics of cancer. Tumor progression implements a multi-type
branching process where the key parameters are the fitness landscape, the mutation
rate, and the average time of cell division. The fitness of a cancer cell depends
on the mutations it has accumulated. The input to our tool could be any fitness
landscape, mutation rate, and cell division time, and the tool produces the growth
dynamics and all relevant statistics.
alternative_title:
- LNCS
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: 'Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression.
In: Proceedings of 25th Int. Conf. on Computer Aided Verification. Vol
8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:10.1007/978-3-642-39799-8_6'
apa: 'Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for
tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification
(Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6'
chicago: 'Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak.
“TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer
Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-39799-8_6.'
ieee: 'J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,”
in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg,
Russia, 2013, vol. 8044, pp. 101–106.'
ista: 'Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression.
Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided
VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.'
mla: 'Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” Proceedings
of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013,
pp. 101–06, doi:10.1007/978-3-642-39799-8_6.'
short: J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int.
Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
conference:
end_date: 2013-07-19
location: St. Petersburg, Russia
name: 'CAV: Computer Aided Verification'
start_date: 2013-07-13
date_created: 2018-12-11T11:55:08Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-39799-8_6
ec_funded: 1
external_id:
arxiv:
- '1303.5251'
intvolume: ' 8044'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1303.5251
month: '01'
oa: 1
oa_version: Preprint
page: 101 - 106
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of 25th Int. Conf. on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '5077'
quality_controlled: '1'
related_material:
record:
- id: '5399'
relation: earlier_version
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'TTP: Tool for tumor progression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '2305'
abstract:
- lang: eng
text: We study the complexity of central controller synthesis problems for finite-state
Markov decision processes, where the objective is to optimize both the expected
mean-payoff performance of the system and its stability. e argue that the basic
theoretical notion of expressing the stability in terms of the variance of the
mean-payoff (called global variance in our paper) is not always sufficient, since
it ignores possible instabilities on respective runs. For this reason we propose
alernative definitions of stability, which we call local and hybrid variance,
and which express how rewards on each run deviate from the run's own mean-payoff
and from the expected mean-payoff, respectively. We show that a strategy ensuring
both the expected mean-payoff and the variance below given bounds requires randomization
and memory, under all the above semantics of variance. We then look at the problem
of determining whether there is a such a strategy. For the global variance, we
show that the problem is in PSPACE, and that the answer can be approximated in
pseudo-polynomial time. For the hybrid variance, the analogous decision problem
is in NP, and a polynomial-time approximating algorithm also exists. For local
variance, we show that the decision problem is in NP. Since the overall performance
can be traded for stability (and vice versa), we also present algorithms for approximating
the associated Pareto curve in all the three cases. Finally, we study a special
case of the decision problems, where we require a given expected mean-payoff together
with zero variance. Here we show that the problems can be all solved in polynomial
time.
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- 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, Chatterjee K, Forejt V, Kučera A. Trading performance for stability
in Markov decision processes. In: 28th Annual ACM/IEEE Symposium. IEEE;
2013:331-340. doi:10.1109/LICS.2013.39'
apa: 'Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2013). Trading
performance for stability in Markov decision processes. In 28th Annual ACM/IEEE
Symposium (pp. 331–340). New Orleans, LA, United States: IEEE. https://doi.org/10.1109/LICS.2013.39'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera.
“Trading Performance for Stability in Markov Decision Processes.” In 28th Annual
ACM/IEEE Symposium, 331–40. IEEE, 2013. https://doi.org/10.1109/LICS.2013.39.
ieee: T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance
for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium,
New Orleans, LA, United States, 2013, pp. 331–340.
ista: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for
stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS:
Logic in Computer Science, 331–340.'
mla: Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision
Processes.” 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–40, doi:10.1109/LICS.2013.39.
short: T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE
Symposium, IEEE, 2013, pp. 331–340.
conference:
end_date: 2013-06-28
location: New Orleans, LA, United States
name: 'LICS: Logic in Computer Science'
start_date: 2013-06-25
date_created: 2018-12-11T11:56:53Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2023-09-20T11:15:30Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2013.39
ec_funded: 1
external_id:
arxiv:
- '1305.4103'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1305.4103
month: '08'
oa: 1
oa_version: Preprint
page: 331 - 340
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: 28th Annual ACM/IEEE Symposium
publication_status: published
publisher: IEEE
publist_id: '4622'
quality_controlled: '1'
related_material:
record:
- id: '1294'
relation: later_version
status: public
scopus_import: 1
status: public
title: Trading performance for stability in Markov decision processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2820'
abstract:
- lang: eng
text: 'In this paper, we introduce the powerful framework of graph games for the
analysis of real-time scheduling with firm deadlines. We introduce a novel instance
of a partial-observation game that is suitable for this purpose, and prove decidability
of all the involved decision problems. We derive a graph game that allows the
automated computation of the competitive ratio (along with an optimal witness
algorithm for the competitive ratio) and establish an NP-completeness proof for
the graph game problem. For a given on-line algorithm, we present polynomial time
solution for computing (i) the worst-case utility; (ii) the worst-case utility
ratio w.r.t. a clairvoyant off-line algorithm; and (iii) the competitive ratio.
A major strength of the proposed approach lies in its flexibility w.r.t. incorporating
additional constraints on the adversary and/or the algorithm, including limited
maximum or average load, finiteness of periods of overload, etc., which are easily
added by means of additional instances of standard objective functions for graph
games. '
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Alexander
full_name: Kößler, Alexander
last_name: Kößler
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: 'Chatterjee K, Kößler A, Schmid U. Automated analysis of real-time scheduling
using graph games. In: Proceedings of the 16th International Conference on
Hybrid Systems: Computation and Control. ACM; 2013:163-172. doi:10.1145/2461328.2461356'
apa: 'Chatterjee, K., Kößler, A., & Schmid, U. (2013). Automated analysis of
real-time scheduling using graph games. In Proceedings of the 16th International
conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia,
PA, United States: ACM. https://doi.org/10.1145/2461328.2461356'
chicago: 'Chatterjee, Krishnendu, Alexander Kößler, and Ulrich Schmid. “Automated
Analysis of Real-Time Scheduling Using Graph Games.” In Proceedings of the
16th International Conference on Hybrid Systems: Computation and Control,
163–72. ACM, 2013. https://doi.org/10.1145/2461328.2461356.'
ieee: 'K. Chatterjee, A. Kößler, and U. Schmid, “Automated analysis of real-time
scheduling using graph games,” in Proceedings of the 16th International conference
on Hybrid systems: Computation and control, Philadelphia, PA, United States,
2013, pp. 163–172.'
ista: 'Chatterjee K, Kößler A, Schmid U. 2013. Automated analysis of real-time scheduling
using graph games. Proceedings of the 16th International conference on Hybrid
systems: Computation and control. HSCC: Hybrid Systems - Computation and Control,
163–172.'
mla: 'Chatterjee, Krishnendu, et al. “Automated Analysis of Real-Time Scheduling
Using Graph Games.” Proceedings of the 16th International Conference on Hybrid
Systems: Computation and Control, ACM, 2013, pp. 163–72, doi:10.1145/2461328.2461356.'
short: 'K. Chatterjee, A. Kößler, U. Schmid, in:, Proceedings of the 16th International
Conference on Hybrid Systems: Computation and Control, ACM, 2013, pp. 163–172.'
conference:
end_date: 2013-04-11
location: Philadelphia, PA, United States
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2013-04-08
date_created: 2018-12-11T11:59:46Z
date_published: 2013-04-01T00:00:00Z
date_updated: 2023-09-27T12:52:38Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2461328.2461356
ec_funded: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 163 - 172
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: 'Proceedings of the 16th International conference on Hybrid systems:
Computation and control'
publication_identifier:
isbn:
- '978-1-4503-1567-8 '
publication_status: published
publisher: ACM
publist_id: '3981'
quality_controlled: '1'
related_material:
record:
- id: '738'
relation: later_version
status: public
scopus_import: 1
status: public
title: Automated analysis of real-time scheduling using graph games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2715'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with specifications given as
Büchi (liveness) objectives. We consider the problem of computing the set of almost-sure
winning vertices from where the objective can be ensured with probability 1. We
study for the first time the average case complexity of the classical algorithm
for computing the set of almost-sure winning vertices for MDPs with Büchi objectives.
Our contributions are as follows: First, we show that for MDPs with constant out-degree
the expected number of iterations is at most logarithmic and the average case
running time is linear (as compared to the worst case linear number of iterations
and quadratic time complexity). Second, for the average case analysis over all
MDPs we show that the expected number of iterations is constant and the average
case running time is linear (again as compared to the worst case linear number
of iterations and quadratic time complexity). Finally we also show that given
that all MDPs are equally likely, the probability that the classical algorithm
requires more than constant number of iterations is exponentially small.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Manas
full_name: Joglekar, Manas
last_name: Joglekar
- first_name: Nisarg
full_name: Shah, Nisarg
last_name: Shah
citation:
ama: 'Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm
for Markov decision processes with Büchi objectives. In: Vol 18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2012:461-473. doi:10.4230/LIPIcs.FSTTCS.2012.461'
apa: 'Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis
of the classical algorithm for Markov decision processes with Büchi objectives
(Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology
and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461'
chicago: Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case
Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,”
18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461.
ieee: 'K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives,” presented at the
FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad,
India, 2012, vol. 18, pp. 461–473.'
ista: 'Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.'
mla: Chatterjee, Krishnendu, et al. Average Case Analysis of the Classical Algorithm
for Markov Decision Processes with Büchi Objectives. Vol. 18, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2012, pp. 461–73, doi:10.4230/LIPIcs.FSTTCS.2012.461.
short: K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012, pp. 461–473.
conference:
end_date: 2012-12-17
location: Hyderabad, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2012-12-15
date_created: 2018-12-11T11:59:13Z
date_published: 2012-12-10T00:00:00Z
date_updated: 2023-02-23T10:06:04Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2012.461
ec_funded: 1
file:
- access_level: open_access
checksum: d4d644ed1a885dbfc4fa1ef4c5724dab
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:53Z
date_updated: 2020-07-14T12:45:45Z
file_id: '5040'
file_name: IST-2016-525-v1+1_42_1_.pdf
file_size: 519040
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 461 - 473
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4180'
pubrep_id: '525'
quality_controlled: '1'
related_material:
record:
- id: '1598'
relation: later_version
status: public
scopus_import: 1
status: public
title: Average case analysis of the classical algorithm for Markov decision processes
with Büchi objectives
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2012'
...
---
_id: '10904'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω-regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on VASS (vector addition systems
with states). Second, we present an optimal symbolic and incremental algorithm
to compute a finite-memory winning strategy (if one exists) in such games. Finally,
we give a complete characterization of when finite memory of strategies can be
traded off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: 'Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23,
FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft
faculty fellowship.'
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: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
citation:
ama: 'Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional
quantitative objectives. In: Koutny M, Ulidowski I, eds. CONCUR 2012 - Concurrency
Theory. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:10.1007/978-3-642-32940-1_10'
apa: 'Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy synthesis
for multi-dimensional quantitative objectives. In M. Koutny & I. Ulidowski
(Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin,
Heidelberg: Springer. https://doi.org/10.1007/978-3-642-32940-1_10'
chicago: 'Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy
Synthesis for Multi-Dimensional Quantitative Objectives.” In CONCUR 2012 -
Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31.
Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-32940-1_10.'
ieee: K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle
upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
ista: 'Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional
quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference
on Concurrency Theory, LNCS, vol. 7454, 115–131.'
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny
and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.
short: K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.),
CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
conference:
end_date: 2012-09-07
location: Newcastle upon Tyne, United Kingdom
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2012-09-04
date_created: 2022-03-21T08:00:21Z
date_published: 2012-09-15T00:00:00Z
date_updated: 2023-02-23T10:55:06Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-32940-1_10
ec_funded: 1
editor:
- first_name: Maciej
full_name: Koutny, Maciej
last_name: Koutny
- first_name: Irek
full_name: Ulidowski, Irek
last_name: Ulidowski
external_id:
arxiv:
- '1201.5073'
intvolume: ' 7454'
language:
- iso: eng
month: '09'
oa_version: Preprint
page: 115-131
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: CONCUR 2012 - Concurrency Theory
publication_identifier:
eisbn:
- '9783642329401'
isbn:
- '9783642329395'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '2716'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7454
year: '2012'
...
---
_id: '2848'
abstract:
- lang: eng
text: We study evolutionary game theory in a setting where individuals learn from
each other. We extend the traditional approach by assuming that a population contains
individuals with different learning abilities. In particular, we explore the situation
where individuals have different search spaces, when attempting to learn the strategies
of others. The search space of an individual specifies the set of strategies learnable
by that individual. The search space is genetically given and does not change
under social evolutionary dynamics. We introduce a general framework and study
a specific example in the context of direct reciprocity. For this example, we
obtain the counter intuitive result that cooperation can only evolve for intermediate
benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection.
Our paper is a step toward making a connection between computational learning
theory and evolutionary game dynamics.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 2012;301:161-173.
doi:10.1016/j.jtbi.2012.02.021
apa: Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics
in populations with different learners. Journal of Theoretical Biology.
Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021
chicago: Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary
Game Dynamics in Populations with Different Learners.” Journal of Theoretical
Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.
ieee: K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations
with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier,
pp. 161–173, 2012.
ista: Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 301, 161–173.
mla: Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with
Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier,
2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.
short: K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301
(2012) 161–173.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2021-01-12T07:00:12Z
day: '21'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jtbi.2012.02.021
ec_funded: 1
external_id:
pmid:
- '22394652'
intvolume: ' 301'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/
month: '05'
oa: 1
oa_version: Submitted Version
page: 161 - 173
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '3946'
quality_controlled: '1'
scopus_import: 1
status: public
title: Evolutionary game dynamics in populations with different learners
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 301
year: '2012'
...
---
_id: '2916'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a quantitative measure for interfaces, called interface simulation distance. It
makes the alternating refinement preorder quantitative by, intu- itively, tolerating
errors (while counting them) in the alternating simulation game. We show that
the interface simulation distance satisfies the triangle inequality, that the
distance between two interfaces does not increase under parallel composition with
a third interface, and that the distance between two interfaces can be bounded
from above and below by distances between abstractions of the two interfaces.
We illustrate the framework, and the properties of the distances under composition
of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances.
In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS;
2012:29-42. doi:10.4204/EPTCS.96.3'
apa: 'Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface
Simulation Distances. In Electronic Proceedings in Theoretical Computer Science
(Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3'
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” In Electronic Proceedings in Theoretical
Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation
Distances,” in Electronic Proceedings in Theoretical Computer Science,
Napoli, Italy, 2012, vol. 96, pp. 29–42.
ista: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation
Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games,
Automata, Logic, and Formal Verification vol. 96, 29–42.'
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings
in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings
in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2012-09-06
date_created: 2018-12-11T12:00:19Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2023-02-23T10:12:05Z
day: '07'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4204/EPTCS.96.3
ec_funded: 1
external_id:
arxiv:
- '1210.2450'
intvolume: ' 96'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '10'
oa: 1
oa_version: Submitted Version
page: 29 - 42
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: Electronic Proceedings in Theoretical Computer Science
publication_status: published
publisher: EPTCS
publist_id: '3827'
quality_controlled: '1'
related_material:
record:
- id: '1733'
relation: later_version
status: public
scopus_import: 1
status: public
title: Interface Simulation Distances
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_id: '2936'
abstract:
- lang: eng
text: The notion of delays arises naturally in many computational models, such as,
in the design of circuits, control systems, and dataflow languages. In this work,
we introduce automata with delay blocks (ADBs), extending finite state automata
with variable time delay blocks, for deferring individual transition output symbols,
in a discrete-time setting. We show that the ADB languages strictly subsume the
regular languages, and are incomparable in expressive power to the context-free
languages. We show that ADBs are closed under union, concatenation and Kleene
star, and under intersection with regular languages, but not closed under complementation
and intersection with other ADB languages. We show that the emptiness and the
membership problems are decidable in polynomial time for ADBs, whereas the universality
problem is undecidable. Finally we consider the linear-time model checking problem,
i.e., whether the language of an ADB is contained in a regular language, and show
that the model checking problem is PSPACE-complete. Copyright 2012 ACM.
acknowledgement: 'This work has been financially supported in part by the European
Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract
# 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008
(Modeling and control of Networked vehicle systems in persistent autonomous operations);
by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic
Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start
grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant
QUAREM; and FWF Grant No S11403-N23 (RiSE).'
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. Finite automata with time delay blocks.
In: Roceedings of the Tenth ACM International Conference on Embedded Software.
ACM; 2012:43-52. doi:10.1145/2380356.2380370'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata
with time delay blocks. In roceedings of the tenth ACM international conference
on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite
Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International
Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.
ieee: K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time
delay blocks,” in roceedings of the tenth ACM international conference on Embedded
software, Tampere, Finland, 2012, pp. 43–52.
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay
blocks. roceedings of the tenth ACM international conference on Embedded software.
EMSOFT: Embedded Software , 43–52.'
mla: Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012,
pp. 43–52, doi:10.1145/2380356.2380370.
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM
International Conference on Embedded Software, ACM, 2012, pp. 43–52.
conference:
end_date: 2012-10-12
location: Tampere, Finland
name: 'EMSOFT: Embedded Software '
start_date: 2012-10-07
date_created: 2018-12-11T12:00:26Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2380356.2380370
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.7019
month: '10'
oa: 1
oa_version: Preprint
page: 43 - 52
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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'
publication: roceedings of the tenth ACM international conference on Embedded software
publication_status: published
publisher: ACM
publist_id: '3799'
quality_controlled: '1'
scopus_import: 1
status: public
title: Finite automata with time delay blocks
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2947'
abstract:
- lang: eng
text: We introduce games with probabilistic uncertainty, a model for controller
synthesis in which the controller observes the state through imprecise sensors
that provide correct information about the current state with a fixed probability.
That is, in each step, the sensors return an observed state, and given the observed
state, there is a probability distribution (due to the estimation error) over
the actual current state. The controller must base its decision on the observed
state (rather than the actual current state, which it does not know). On the other
hand, we assume that the environment can perfectly observe the current state.
We show that controller synthesis for qualitative ω-regular objectives in our
model can be reduced in polynomial time to standard partial-observation stochastic
games, and vice-versa. As a consequence we establish the precise decidability
frontier for the new class of games, and establish optimal complexity results
for all the decidable problems.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Chmelik M, Majumdar R. Equivalence of games with probabilistic
uncertainty and partial observation games. In: Vol 7561. Springer; 2012:385-399.
doi:10.1007/978-3-642-33386-6_30'
apa: 'Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games
with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399).
Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram,
India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30'
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence
of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99.
Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
ieee: 'K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic
uncertainty and partial observation games,” presented at the ATVA: Automated
Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol.
7561, pp. 385–399.'
ista: 'Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic
uncertainty and partial observation games. ATVA: Automated Technology for Verification
and Analysis, LNCS, vol. 7561, 385–399.'
mla: Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty
and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.
short: K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, India
name: ' ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
date_created: 2018-12-11T12:00:29Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:39:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-33386-6_30
ec_funded: 1
intvolume: ' 7561'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.4140
month: '06'
oa: 1
oa_version: Preprint
page: 385 - 399
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: '3785'
quality_controlled: '1'
scopus_import: 1
status: public
title: Equivalence of games with probabilistic uncertainty and partial observation
games
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7561
year: '2012'
...
---
_id: '3135'
abstract:
- lang: eng
text: 'We introduce consumption games, a model for discrete interactive system with
multiple resources that are consumed or reloaded independently. More precisely,
a consumption game is a finite-state graph where each transition is labeled by
a vector of resource updates, where every update is a non-positive number or ω.
The ω updates model the reloading of a given resource. Each vertex belongs either
to player □ or player ◇, where the aim of player □ is to play so that the resources
are never exhausted. We consider several natural algorithmic problems about consumption
games, and show that although these problems are computationally hard in general,
they are solvable in polynomial time for every fixed number of resource types
(i.e., the dimension of the update vectors) and bounded resource updates. '
acknowledgement: 'Tomas Brazdil, Antonin Kucera, and Petr Novotny are supported by
the Czech Science Foundation, grant No. P202/10/1469. Krishnendu Chatterjee is supported
by the FWF (Austrian Science Fund) NFN Grant No S11407-N23 (RiSE) and ERC Start
grant (279307: Graph Games).'
alternative_title:
- LNCS
author:
- first_name: Brázdil
full_name: Brázdil, Brázdil
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
citation:
ama: 'Brázdil B, Chatterjee K, Kučera A, Novotný P. Efficient controller synthesis
for consumption games with multiple resource types. In: Vol 7358. Springer; 2012:23-38.
doi:10.1007/978-3-642-31424-7_8'
apa: 'Brázdil, B., Chatterjee, K., Kučera, A., & Novotný, P. (2012). Efficient
controller synthesis for consumption games with multiple resource types (Vol.
7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley,
CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_8'
chicago: Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kučera, and Petr Novotný.
“Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,”
7358:23–38. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_8.
ieee: 'B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller
synthesis for consumption games with multiple resource types,” presented at the
CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.'
ista: 'Brázdil B, Chatterjee K, Kučera A, Novotný P. 2012. Efficient controller
synthesis for consumption games with multiple resource types. CAV: Computer Aided
Verification, LNCS, vol. 7358, 23–38.'
mla: Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption
Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38,
doi:10.1007/978-3-642-31424-7_8.
short: B. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, in:, Springer, 2012, pp.
23–38.
conference:
end_date: 2012-07-13
location: Berkeley, CA, USA
name: 'CAV: Computer Aided Verification'
start_date: 2012-07-07
date_created: 2018-12-11T12:01:35Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:41:18Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-31424-7_8
ec_funded: 1
intvolume: ' 7358'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.0796
month: '07'
oa: 1
oa_version: Preprint
page: 23 - 38
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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: '3562'
quality_controlled: '1'
scopus_import: 1
status: public
title: Efficient controller synthesis for consumption games with multiple resource
types
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7358
year: '2012'
...
---
_id: '3252'
abstract:
- lang: eng
text: 'We study the automatic synthesis of fair non-repudiation protocols, a class
of fair exchange protocols, used for digital contract signing. First, we show
how to specify the objectives of the participating agents, the trusted third party
(TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove
that the satisfaction of the objectives of the agents and the TTP imply satisfaction
of the protocol objectives. We then show that weak (co-operative) co-synthesis
and classical (strictly competitive) co-synthesis fail in synthesizing these protocols,
whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success
of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee
synthesis is attack-free; no subset of participants can violate the objectives
of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner
(ASW) certified mail protocol that has known vulnerabilities is not a solution
of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution
of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation
protocols, and our results show how synthesis can generate correct protocols and
automatically discover vulnerabilities. The solution to assume-guarantee synthesis
can be computed efficiently as the secure equilibrium solution of three-player
graph games. © 2012 Springer-Verlag.'
acknowledgement: "The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his
invaluable help and feedback."
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: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: 'Chatterjee K, Raman V. Synthesizing protocols for digital contract signing.
In: Vol 7148. Springer; 2012:152-168. doi:10.1007/978-3-642-27940-9_11'
apa: 'Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital
contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification,
Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11'
chicago: Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for
Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11.
ieee: 'K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract
signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.'
ista: 'Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract
signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS,
vol. 7148, 152–168.'
mla: Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for
Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, doi:10.1007/978-3-642-27940-9_11.
short: K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
conference:
end_date: 2012-01-24
location: Philadelphia, PA, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2012-01-22
date_created: 2018-12-11T12:02:16Z
date_published: 2012-01-20T00:00:00Z
date_updated: 2021-01-12T07:42:08Z
day: '20'
department:
- _id: KrCh
doi: 10.1007/978-3-642-27940-9_11
ec_funded: 1
intvolume: ' 7148'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1004.2697
month: '01'
oa: 1
oa_version: Preprint
page: 152 - 168
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: '3405'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesizing protocols for digital contract signing
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7148
year: '2012'
...
---
_id: '3255'
abstract:
- lang: eng
text: In this paper we survey results of two-player games on graphs and Markov decision
processes with parity, mean-payoff and energy objectives, and the combination
of mean-payoff and energy objectives with parity objectives. These problems have
applications in verification and synthesis of reactive systems in resource-constrained
environments.
acknowledgement: This work was partially supported by FWF NFN Grant S11407-N23 (RiSE)
and a Microsoft faculty fellowship.
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. Games and Markov decision processes with mean payoff
parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:10.1007/978-3-642-25929-6_3'
apa: 'Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes
with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented
at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice,
Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes
with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012.
https://doi.org/10.1007/978-3-642-25929-6_3.
ieee: 'K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean
payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical
and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol.
7119, pp. 37–46.'
ista: 'Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean
payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering
Methods in Computer Science, LNCS, vol. 7119, 37–46.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Games and Markov Decision Processes
with Mean Payoff Parity and Energy Parity Objectives. Vol. 7119, Springer,
2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3.
short: K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
conference:
end_date: 2011-10-16
location: Lednice, Czech Republic
name: 'MEMICS: Mathematical and Engineering Methods in Computer Science'
start_date: 2011-10-14
date_created: 2018-12-11T12:02:17Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:10Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-642-25929-6_3
file:
- access_level: open_access
checksum: eed2cc1e76b160418c977e76e8899a60
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T12:53:12Z
date_updated: 2020-07-14T12:46:05Z
file_id: '7863'
file_name: 2012_MEMICS_Chatterjee.pdf
file_size: 114060
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 7119'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 37 - 46
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: '3400'
quality_controlled: '1'
scopus_import: 1
status: public
title: Games and Markov decision processes with mean payoff parity and energy parity
objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7119
year: '2012'
...
---
_id: '3254'
abstract:
- lang: eng
text: 'The theory of graph games with ω-regular winning conditions is the foundation
for modeling and synthesizing reactive processes. In the case of stochastic reactive
processes, the corresponding stochastic graph games have three players, two of
them (System and Environment) behaving adversarially, and the third (Uncertainty)
behaving probabilistically. We consider two problems for stochastic graph games:
the qualitative problem asks for the set of states from which a player can win
with probability 1 (almost-sure winning); and the quantitative problem asks for
the maximal probability of winning (optimal winning) from each state. We consider
ω-regular winning conditions formalized as Müller winning conditions. We present
optimal memory bounds for pure (deterministic) almost-sure winning and optimal
winning strategies in stochastic graph games with Müller winning conditions. We
also study the complexity of stochastic Müller games and show that both the qualitative
and quantitative analysis problems are PSPACE-complete. Our results are relevant
in synthesis of stochastic reactive processes.'
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award.'
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. The complexity of stochastic Müller games. Information and
Computation. 2012;211:29-48. doi:10.1016/j.ic.2011.11.004
apa: Chatterjee, K. (2012). The complexity of stochastic Müller games. Information
and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004
chicago: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information
and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004.
ieee: K. Chatterjee, “The complexity of stochastic Müller games,” Information
and Computation, vol. 211. Elsevier, pp. 29–48, 2012.
ista: Chatterjee K. 2012. The complexity of stochastic Müller games. Information
and Computation. 211, 29–48.
mla: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information
and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.
short: K. Chatterjee, Information and Computation 211 (2012) 29–48.
date_created: 2018-12-11T12:02:17Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2021-01-12T07:42:09Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ic.2011.11.004
ec_funded: 1
intvolume: ' 211'
language:
- iso: eng
main_file_link:
- url: http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf
month: '02'
oa_version: None
page: 29 - 48
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: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '3403'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of stochastic Müller games
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 211
year: '2012'
...
---
_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.
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: 2021-01-12T07:42:35Z
day: '01'
department:
- _id: KrCh
doi: 10.1142/S0129054112400308
intvolume: ' 23'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 23
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.
date_created: 2018-12-11T12:05:29Z
date_published: 2012-03-02T00:00:00Z
date_updated: 2022-05-24T08:00:54Z
day: '02'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jcss.2011.05.002
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'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 78
year: '2012'
...
---
_id: '3128'
abstract:
- lang: eng
text: 'We consider two-player zero-sum stochastic games on graphs with ω-regular
winning conditions specified as parity objectives. These games have applications
in the design and control of reactive systems. We survey the complexity results
for the problem of deciding the winner in such games, and in classes of interest
obtained as special cases, based on the information and the power of randomization
available to the players, on the class of objectives and on the winning mode.
On the basis of information, 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 complete view of the game). The
one-sided partial-observation games have two important subclasses: the one-player
games, known as partial-observation Markov decision processes (POMDPs), and the
blind one-player games, known as probabilistic automata. 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. Finally, various classes of games are obtained by
restricting the parity objective to a reachability, safety, Büchi, or coBüchi
condition. We also consider several winning modes, such as sure-winning (i.e.,
all outcomes of a strategy have to satisfy the winning condition), almost-sure
winning (i.e., winning with probability 1), limit-sure winning (i.e., winning
with probability arbitrarily close to 1), and value-threshold winning (i.e., winning
with probability at least ν, where ν is a given rational). '
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No. P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF
NFN Grant No. S11407-N23(RiSE), ERC Start grant (279307: Graph Games), Microsoft
faculty fellows award, ERC Advanced grant QUAREM, and FWF Grant No. S11403-N23 (RiSE).'
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. A survey of partial-observation stochastic
parity games. Formal Methods in System Design. 2012;43(2):268-284. doi:10.1007/s10703-012-0164-2
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation
stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey
of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design.
Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation
stochastic parity games,” Formal Methods in System Design, vol. 43, no.
2. Springer, pp. 268–284, 2012.
ista: Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation
stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
mla: Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic
Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer,
2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design
43 (2012) 268–284.
date_created: 2018-12-11T12:01:33Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:41:15Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-012-0164-2
ec_funded: 1
file:
- access_level: open_access
checksum: dd3d590f383bb2ac6cfda1489ac1c42a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:27Z
date_updated: 2020-07-14T12:46:00Z
file_id: '4882'
file_name: IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf
file_size: 163983
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 43'
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 268 - 284
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '3570'
pubrep_id: '303'
quality_controlled: '1'
scopus_import: 1
status: public
title: A survey of partial-observation stochastic parity games
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2012'
...
---
_id: '2972'
abstract:
- lang: eng
text: 'Energy parity games are infinite two-player turn-based games played on weighted
graphs. The objective of the game combines a (qualitative) parity condition with
the (quantitative) requirement that the sum of the weights (i.e., the level of
energy in the game) must remain positive. Beside their own interest in the design
and synthesis of resource-constrained omega-regular specifications, energy parity
games provide one of the simplest model of games with combined qualitative and
quantitative objectives. Our main results are as follows: (a) exponential memory
is sufficient and may be necessary for winning strategies in energy parity games;
(b) the problem of deciding the winner in energy parity games can be solved in
NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to
energy games. We also show that the problem of deciding the winner in energy parity
games is logspace-equivalent to the problem of deciding the winner in mean-payoff
parity games, which can thus be solved in NP ∩ coNP. As a consequence we also
obtain a conceptually simple algorithm to solve mean-payoff parity games.'
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 parity games. Theoretical Computer Science.
2012;458:49-60. doi:10.1016/j.tcs.2012.07.038
apa: Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical
Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2012.07.038
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical
Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2012.07.038.
ieee: K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer
Science, vol. 458. Elsevier, pp. 49–60, 2012.
ista: Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science.
458, 49–60.
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical
Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.
short: K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.
date_created: 2018-12-11T12:00:37Z
date_published: 2012-11-02T00:00:00Z
date_updated: 2023-02-23T11:45:29Z
day: '02'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2012.07.038
ec_funded: 1
external_id:
arxiv:
- '1001.5183'
file:
- access_level: open_access
checksum: 719e4a5af5a01ad3f2f7f7f05b3c2b09
content_type: application/pdf
creator: kschuh
date_created: 2019-02-06T11:56:22Z
date_updated: 2020-07-14T12:45:57Z
file_id: '5935'
file_name: 2012_Elsevier_Chatterjee.pdf
file_size: 351271
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 458'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 49 - 60
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: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '3736'
pubrep_id: '935'
quality_controlled: '1'
related_material:
record:
- id: '3851'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Energy parity 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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 458
year: '2012'
...
---
_id: '495'
abstract:
- lang: eng
text: An automaton with advice is a finite state automaton which has access to an
additional fixed infinite string called an advice tape. We refine the Myhill-Nerode
theorem to characterize the languages of finite strings that are accepted by automata
with advice. We do the same for tree automata with advice.
alternative_title:
- EPTCS
author:
- first_name: Alex
full_name: Kruckman, Alex
last_name: Kruckman
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
- first_name: John
full_name: Sheridan, John
last_name: Sheridan
- first_name: Ben
full_name: Zax, Ben
last_name: Zax
citation:
ama: 'Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata
with advice. In: Proceedings GandALF 2012. Vol 96. Open Publishing Association;
2012:238-246. doi:10.4204/EPTCS.96.18'
apa: 'Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode
theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96,
pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18'
chicago: Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode
Theorem for Automata with Advice.” In Proceedings GandALF 2012, 96:238–46.
Open Publishing Association, 2012. https://doi.org/10.4204/EPTCS.96.18.
ieee: A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for
automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012,
vol. 96, pp. 238–246.
ista: 'Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for
automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics
and Formal Verification, EPTCS, vol. 96, 238–246.'
mla: Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”
Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp.
238–46, doi:10.4204/EPTCS.96.18.
short: A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012,
Open Publishing Association, 2012, pp. 238–246.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logics and Formal Verification'
start_date: 2012-09-06
date_created: 2018-12-11T11:46:47Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2021-01-12T08:01:04Z
day: '07'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.96.18
ec_funded: 1
file:
- access_level: open_access
checksum: 56277f95edc9d531fa3bdc5f9579fda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:31Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5152'
file_name: IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf
file_size: 97736
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 96'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 238 - 246
project:
- _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'
publication: Proceedings GandALF 2012
publication_status: published
publisher: Open Publishing Association
publist_id: '7325'
pubrep_id: '944'
quality_controlled: '1'
scopus_import: 1
status: public
title: A Myhill Nerode theorem for automata with advice
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_id: '496'
abstract:
- lang: eng
text: 'We study the expressive power of logical interpretations on the class of
scattered trees, namely those with countably many infinite branches. Scattered
trees can be thought of as the tree analogue of scattered linear orders. Every
scattered tree has an ordinal rank that reflects the structure of its infinite
branches. We prove, roughly, that trees and orders of large rank cannot be interpreted
in scattered trees of small rank. We consider a quite general notion of interpretation:
each element of the interpreted structure is represented by a set of tuples of
subsets of the interpreting tree. Our trees are countable, not necessarily finitely
branching, and may have finitely many unary predicates as labellings. We also
show how to replace injective set-interpretations in (not necessarily scattered)
trees by ''finitary'' set-interpretations.'
alternative_title:
- LICS
article_number: '6280474'
author:
- first_name: Alexander
full_name: Rabinovich, Alexander
last_name: Rabinovich
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Rabinovich A, Rubin S. Interpretations in trees with countably many branches.
In: IEEE; 2012. doi:10.1109/LICS.2012.65'
apa: 'Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably
many branches. Presented at the LICS: Symposium on Logic in Computer Science,
Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.65'
chicago: Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with
Countably Many Branches.” IEEE, 2012. https://doi.org/10.1109/LICS.2012.65.
ieee: 'A. Rabinovich and S. Rubin, “Interpretations in trees with countably many
branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik,
Croatia, 2012.'
ista: 'Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many
branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.'
mla: Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably
Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.
short: A. Rabinovich, S. Rubin, in:, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Symposium on Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T11:46:47Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T08:01:05Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.65
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: IEEE
publist_id: '7324'
quality_controlled: '1'
scopus_import: 1
status: public
title: Interpretations in trees with countably many branches
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '497'
abstract:
- lang: eng
text: 'One central issue in the formal design and analysis of reactive systems is
the notion of refinement that asks whether all behaviors of the implementation
is allowed by the specification. The local interpretation of behavior leads to
the notion of simulation. Alternating transition systems (ATSs) provide a general
model for composite reactive systems, and the simulation relation for ATSs is
known as alternating simulation. The simulation relation for fair transition systems
is called fair simulation. In this work our main contributions are as follows:
(1) We present an improved algorithm for fair simulation with Büchi fairness constraints;
our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time
algorithm, where n is the number of states and m is the number of transitions.
(2) We present a game based algorithm for alternating simulation that requires
O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n
is the number of states and m is the size of transition relation. (3) We present
an iterative algorithm for alternating simulation that matches the time complexity
of the game based algorithm, but is more space efficient than the game based algorithm.
© Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Pritish
full_name: Kamath, Pritish
last_name: Kamath
citation:
ama: 'Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement
relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182.
doi:10.4230/LIPIcs.CSL.2012.167'
apa: 'Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for
alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL:
European Association for Computer Science Logic, Fontainebleau, France: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167'
chicago: Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms
for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012. https://doi.org/10.4230/LIPIcs.CSL.2012.167.
ieee: 'K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating
refinement relations,” presented at the EACSL: European Association for Computer
Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.'
ista: 'Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating
refinement relations. EACSL: European Association for Computer Science Logic,
LIPIcs, vol. 16, 167–182.'
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement
Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012,
pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.
short: K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012, pp. 167–182.
conference:
end_date: 2012-09-06
location: Fontainebleau, France
name: 'EACSL: European Association for Computer Science Logic'
start_date: 2012-09-03
date_created: 2018-12-11T11:46:48Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2023-02-23T12:23:32Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2012.167
ec_funded: 1
file:
- access_level: open_access
checksum: f1b0dd99240800db2d7dbf9b5131fe5e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:50Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4712'
file_name: IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf
file_size: 471236
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 16'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 167 - 182
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: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7323'
pubrep_id: '943'
quality_controlled: '1'
related_material:
record:
- id: '5378'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Faster algorithms for alternating refinement relations
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2012'
...
---
_id: '3165'
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 Õ(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 Õ(n·m) boundary by presenting a new technique that reduces
the running time to O(n 2). This bound also leads to O(n 2) 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
Õ(n·m)), (2) in concurrent graph games with constant actions (improving an earlier
bound of O(n 3)), and (3) in Markov decision processes (improving for m > n
4/3 an earlier bound of O(min(m 1.5, m·n 2/3)). We also show that the same technique
can be used to compute the maximal end-component decomposition of a graph in time
O(n 2), which is an improvement over earlier bounds for m > n 4/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.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, Vienna
Science and Technology Fund (WWTF) Grant ICT10-002, FWF NFN Grant No S11407-N23
(RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Chatterjee K, Henzinger MH. An O(n2) time algorithm for alternating Büchi
games. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
SIAM; 2012:1386-1399. doi:10.1137/1.9781611973099.109'
apa: 'Chatterjee, K., & Henzinger, M. H. (2012). An O(n2) time algorithm for
alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on
Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109'
chicago: Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm
for Alternating Büchi Games.” In Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, 1386–99. SIAM, 2012. https://doi.org/10.1137/1.9781611973099.109.
ieee: K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating
Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,
Kyoto, Japan, 2012, pp. 1386–1399.
ista: 'Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating
Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
SODA: Symposium on Discrete Algorithms, 1386–1399.'
mla: Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for
Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.
short: K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
conference:
end_date: 2012-01-19
location: Kyoto, Japan
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2012-01-17
date_created: 2018-12-11T12:01:46Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2023-02-23T12:23:35Z
day: '01'
department:
- _id: KrCh
doi: 10.1137/1.9781611973099.109
ec_funded: 1
external_id:
arxiv:
- '1109.5018'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1109.5018
month: '01'
oa: 1
oa_version: None
page: 1386 - 1399
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
publication_status: published
publisher: SIAM
publist_id: '3519'
pubrep_id: '15'
quality_controlled: '1'
related_material:
record:
- id: '2141'
relation: later_version
status: public
- id: '5379'
relation: earlier_version
status: public
status: public
title: An O(n2) time algorithm for alternating Büchi games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2956'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis such as synthesis and verification of open systems. In this
work we consider solving recursive game graphs (or pushdown game graphs) that
can model the control flow of sequential programs with recursion. While pushdown
games have been studied before with qualitative objectives, such as reachability
and parity objectives, in this work we study for the first time such games with
the most well-studied quantitative objective, namely, mean payoff objectives.
In pushdown games two types of strategies are relevant: (1) global strategies,
that depend on the entire global history; and (2) modular strategies, that have
only local memory and thus do not depend on the context of invocation, but only
on the history of the current invocation of the module. Our main results are as
follows: (1) One-player pushdown games with mean-payoff objectives under global
strategies are decidable in polynomial time. (2) Two-player pushdown games with
mean-payoff objectives under global strategies are undecidable. (3) One-player
pushdown games with mean-payoff objectives under modular strategies are NP-hard.
(4) Two-player pushdown games with mean-payoff objectives under modular strategies
can be solved in NP (i.e., both one-player and two-player pushdown games with
mean-payoff objectives under modular strategies are NP-complete). We also establish
the optimal strategy complexity showing that global strategies for mean-payoff
objectives require infinite memory even in one-player pushdown games; and memoryless
modular strategies are sufficient in two-player pushdown games. Finally we also
show that all the problems have the same computational complexity if the stack
boundedness condition is added, where along with the mean-payoff objective the
player must also ensure that the stack height is bounded.'
acknowledgement: "The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), Microsoft faculty fellows award, the Israeli Centers of Research Excellence
(ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901),
and was carried out in partial fulfillment of the requirements for the Ph.D. degree
of the second author.\r\nA Technical Report of this paper is available via internal
link."
article_number: '6280438'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: 'Chatterjee K, Velner Y. Mean payoff pushdown games. In: Proceedings of
the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE;
2012. doi:10.1109/LICS.2012.30'
apa: 'Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings
of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik,
Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30'
chicago: Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”
In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.30.
ieee: K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings
of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik,
Croatia , 2012.
ista: 'Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of
the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic
in Computer Science, 6280438.'
mla: Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” Proceedings
of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438,
IEEE, 2012, doi:10.1109/LICS.2012.30.
short: K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: 'Dubrovnik, Croatia '
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:32Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:30Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.30
ec_funded: 1
language:
- iso: eng
month: '08'
oa_version: None
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: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3770'
quality_controlled: '1'
related_material:
record:
- id: '5377'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Mean payoff pushdown games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5377'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis such as synthesis and verification of open systems. In this
work we consider solving recursive game graphs (or pushdown game graphs) that
can model the control flow of sequential programs with recursion. While pushdown
games have been studied before with qualitative objectives, such as reachability
and ω-regular objectives, in this work we study for the first time such games
with the most well-studied quantitative objective, namely, mean-payoff objectives.
In pushdown games two types of strategies are relevant: (1) global strategies,
that depend on the entire global history; and (2) modular strategies, that have
only local memory and thus do not depend on the context of invocation, but only
on the history of the current invocation of the module. Our main results are as
follows: (1) One-player pushdown games with mean-payoff objectives under global
strategies are decidable in polynomial time. (2) Two- player pushdown games with
mean-payoff objectives under global strategies are undecidable. (3) One-player
pushdown games with mean-payoff objectives under modular strategies are NP- hard.
(4) Two-player pushdown games with mean-payoff objectives under modular strategies
can be solved in NP (i.e., both one-player and two-player pushdown games with
mean-payoff objectives under modular strategies are NP-complete). We also establish
the optimal strategy complexity showing that global strategies for mean-payoff
objectives require infinite memory even in one-player pushdown games; and memoryless
modular strategies are sufficient in two- player pushdown games. Finally we also
show that all the problems have the same complexity if the stack boundedness condition
is added, where along with the mean-payoff objective the player must also ensure
that the stack height is bounded.'
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: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Velner Y. Mean-Payoff Pushdown Games. IST Austria; 2012.
doi:10.15479/AT:IST-2012-0002
apa: Chatterjee, K., & Velner, Y. (2012). Mean-payoff pushdown games.
IST Austria. https://doi.org/10.15479/AT:IST-2012-0002
chicago: Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games.
IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0002.
ieee: K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria,
2012.
ista: Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
mla: Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games.
IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.
short: K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
date_created: 2018-12-12T11:38:59Z
date_published: 2012-07-02T00:00:00Z
date_updated: 2023-02-23T11:05:50Z
day: '02'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2012-0002
file:
- access_level: open_access
checksum: a03c08c1589dbb0c96183a8bcf3ab240
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:00Z
date_updated: 2020-07-14T12:46:38Z
file_id: '5522'
file_name: IST-2012-002_IST-2012-0002.pdf
file_size: 592098
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '10'
related_material:
record:
- id: '2956'
relation: later_version
status: public
status: public
title: Mean-payoff pushdown games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '5378'
abstract:
- lang: eng
text: 'One central issue in the formal design and analysis of reactive systems is
the notion of refinement that asks whether all behaviors of the implementation
is allowed by the specification. The local interpretation of behavior leads to
the notion of simulation. Alternating transition systems (ATSs) provide a general
model for composite reactive systems, and the simulation relation for ATSs is
known as alternating simulation. The simulation relation for fair transition systems
is called fair simulation. In this work our main contributions are as follows:
(1) We present an improved algorithm for fair simulation with Büchi fairness constraints;
our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time
algorithm, where n is the number of states and m is the number of transitions.
(2) We present a game based algorithm for alternating simulation that requires
O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where
n is the number of states and m is the size of transition relation. (3) We present
an iterative algorithm for alternating simulation that matches the time complexity
of the game based algorithm, but is more space efficient than the game based algorithm.'
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: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Pritish
full_name: Kamath, Pritish
last_name: Kamath
citation:
ama: Chatterjee K, Chaubal S, Kamath P. Faster Algorithms for Alternating Refinement
Relations. IST Austria; 2012. doi:10.15479/AT:IST-2012-0001
apa: Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms
for alternating refinement relations. IST Austria. https://doi.org/10.15479/AT:IST-2012-0001
chicago: Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster
Algorithms for Alternating Refinement Relations. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0001.
ieee: K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating
refinement relations. IST Austria, 2012.
ista: Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating
refinement relations, IST Austria, 21p.
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement
Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.
short: K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement
Relations, IST Austria, 2012.
date_created: 2018-12-12T11:38:59Z
date_published: 2012-07-04T00:00:00Z
date_updated: 2023-02-23T12:21:38Z
day: '04'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2012-0001
file:
- access_level: open_access
checksum: ec8d1857cc7095d3de5107a0162ced37
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:28Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5489'
file_name: IST-2012-0001_IST-2012-0001.pdf
file_size: 394256
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: '21'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '14'
related_material:
record:
- id: '497'
relation: later_version
status: public
status: public
title: Faster algorithms for alternating refinement relations
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2955'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on finite graphs with reachability
objectives where the first player tries to ensure a target state to be visited
almost-surely (i.e., with probability 1), or positively (i.e., with positive probability),
no matter the strategy of the second player. We classify such games according
to the information and 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, the players (a) may not be allowed to use randomization (pure strategies),
or (b) may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) may
use full randomization. Our main results for pure strategies are as follows. (1)
For one-sided games with player 1 having partial observation we show that (in
contrast to full randomized strategies) belief-based (subset-construction based)
strategies are not sufficient, and we present an exponential upper bound on memory
both for almostsure 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. (2) For one-sided games with player 2 having partial observation
we show that non-elementary memory is both necessary and sufficient for both almost-sure
and positive 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 result exhibits serious flaws in previous
results of the literature: we show a non-elementary memory lower bound for almost-sure
winning whereas an exponential upper bound was previously claimed.'
acknowledgement: 'This work was partially supported by FWF Grant No P 23499-N23, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
article_number: '6280436'
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. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on
Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.28'
apa: 'Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games:
How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual
ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28.'
ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to
win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, Dubrovnik, Croatia, 2012.'
ista: 'Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to
win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.'
short: K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:32Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.28
ec_funded: 1
external_id:
arxiv:
- '1107.2141'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2141
month: '08'
oa: 1
oa_version: Preprint
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: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3771'
quality_controlled: '1'
related_material:
record:
- id: '2211'
relation: later_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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
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
date_created: 2018-12-11T12:02:46Z
date_published: 2012-03-22T00:00:00Z
date_updated: 2023-02-23T12:23:46Z
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: '2957'
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
words are accepted with probability arbitrarily close to 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
(regular) words, then the positive and almost problems are decidable for all probabilistic
automata with parity conditions. For most decidable problems we show an optimal
PSPACE-complete complexity bound.'
article_number: '6280437'
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. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic
in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.29'
apa: 'Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic
automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29'
chicago: Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic
Automata on Infinite Words.” In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.29.
ieee: K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata
on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, Dubrovnik, Croatia , 2012.
ista: 'Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata
on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic
in Computer Science. LICS: Logic in Computer Science, 6280437.'
mla: Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic
Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.
short: K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: 'Dubrovnik, Croatia '
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:33Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:51Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.29
ec_funded: 1
external_id:
arxiv:
- '1107.2091'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1107.2091
month: '08'
oa: 1
oa_version: Preprint
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: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3769'
quality_controlled: '1'
related_material:
record:
- id: '5384'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Decidable problems for probabilistic automata on infinite words
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '10905'
abstract:
- lang: eng
text: "Energy games belong to a class of turn-based two-player infinite-duration
games played on a weighted directed graph. It is one of the rare and intriguing
combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While
the existence of polynomial-time algorithms has been a major open problem for
decades, there is no algorithm that solves any non-trivial subclass in polynomial
time.\r\nIn this paper, we give several results based on the weight structures
of the graph. First, we identify a notion of penalty and present a polynomial-time
algorithm when the penalty is large. Our algorithm is the first polynomial-time
algorithm on a large class of weighted graphs. It includes several counter examples
that show that many previous algorithms, such as value iteration and random facet
algorithms, require at least sub-exponential time. Our main technique is developing
the first non-trivial approximation algorithm and showing how to convert it to
an exact algorithm. Moreover, we show that in a practical case in verification
where weights are clustered around a constant number of values, the energy game
problem can be solved in polynomial time. We also show that the problem is still
as hard as in general when the clique-width is bounded or the graph is strongly
ergodic, suggesting that restricting graph structures need not help."
acknowledgement: 'Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian
Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games),
and a Microsoft Faculty Fellows Award'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms
for energy games with special weight structures. In: Algorithms – ESA 2012.
Vol 7501. Springer; 2012:301-312. doi:10.1007/978-3-642-33090-2_27'
apa: 'Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2012).
Polynomial-time algorithms for energy games with special weight structures. In
Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer.
https://doi.org/10.1007/978-3-642-33090-2_27'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon
Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”
In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.
ieee: K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time
algorithms for energy games with special weight structures,” in Algorithms
– ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
ista: 'Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time
algorithms for energy games with special weight structures. Algorithms – ESA 2012.
ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.'
mla: Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games
with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer,
2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
short: K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms
– ESA 2012, Springer, 2012, pp. 301–312.
conference:
end_date: 2012-09-12
location: Ljubljana, Slovenia
name: 'ESA: European Symposium on Algorithms'
start_date: 2012-09-10
date_created: 2022-03-21T08:01:45Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2023-09-05T14:09:30Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-33090-2_27
ec_funded: 1
external_id:
arxiv:
- '1604.08234'
intvolume: ' 7501'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08234
month: '10'
oa: 1
oa_version: Preprint
page: 301-312
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: Algorithms – ESA 2012
publication_identifier:
eisbn:
- '9783642330902'
eissn:
- 1611-3349
isbn:
- '9783642330896'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '535'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Polynomial-time algorithms for energy games with special weight structures
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7501
year: '2012'
...
---
_id: '3157'
abstract:
- lang: eng
text: Colorectal tumours that are wild type for KRAS are often sensitive to EGFR
blockade, but almost always develop resistance within several months of initiating
therapy. The mechanisms underlying this acquired resistance to anti-EGFR antibodies
are largely unknown. This situation is in marked contrast to that of small-molecule
targeted agents, such as inhibitors of ABL, EGFR, BRAF and MEK, in which mutations
in the genes encoding the protein targets render the tumours resistant to the
effects of the drugs. The simplest hypothesis to account for the development of
resistance to EGFR blockade is that rare cells with KRAS mutations pre-exist at
low levels in tumours with ostensibly wild-type KRAS genes. Although this hypothesis
would seem readily testable, there is no evidence in pre-clinical models to support
it, nor is there data from patients. To test this hypothesis, we determined whether
mutant KRAS DNA could be detected in the circulation of 28 patients receiving
monotherapy with panitumumab, a therapeutic anti-EGFR antibody. We found that
9 out of 24 (38%) patients whose tumours were initially KRAS wild type developed
detectable mutations in KRAS in their sera, three of which developed multiple
different KRAS mutations. The appearance of these mutations was very consistent,
generally occurring between 5 and 6months following treatment. Mathematical modelling
indicated that the mutations were present in expanded subclones before the initiation
of panitumumab treatment. These results suggest that the emergence of KRAS mutations
is a mediator of acquired resistance to EGFR blockade and that these mutations
can be detected in a non-invasive manner. They explain why solid tumours develop
resistance to targeted therapies in a highly reproducible fashion.
author:
- first_name: Luis
full_name: Diaz Jr, Luis
last_name: Diaz Jr
- first_name: Richard
full_name: Williams, Richard
last_name: Williams
- first_name: Jian
full_name: Wu, Jian
last_name: Wu
- first_name: Isaac
full_name: Kinde, Isaac
last_name: Kinde
- first_name: Joel
full_name: Hecht, Joel
last_name: Hecht
- first_name: Jordan
full_name: Berlin, Jordan
last_name: Berlin
- first_name: Benjamin
full_name: Allen, Benjamin
last_name: Allen
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Kenneth
full_name: Kinzler, Kenneth
last_name: Kinzler
- first_name: Kelly
full_name: Oliner, Kelly
last_name: Oliner
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
citation:
ama: Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance
to targeted EGFR blockade in colorectal cancers. Nature. 2012;486(7404):537-540.
doi:10.1038/nature11219
apa: Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein,
B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade
in colorectal cancers. Nature. Nature Publishing Group. https://doi.org/10.1038/nature11219
chicago: Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan
Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance
to Targeted EGFR Blockade in Colorectal Cancers.” Nature. Nature Publishing
Group, 2012. https://doi.org/10.1038/nature11219.
ieee: L. Diaz Jr et al., “The molecular evolution of acquired resistance
to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no.
7404. Nature Publishing Group, pp. 537–540, 2012.
ista: Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I,
Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution
of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature.
486(7404), 537–540.
mla: Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted
EGFR Blockade in Colorectal Cancers.” Nature, vol. 486, no. 7404, Nature
Publishing Group, 2012, pp. 537–40, doi:10.1038/nature11219.
short: L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen,
I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486
(2012) 537–540.
date_created: 2018-12-11T12:01:43Z
date_published: 2012-06-28T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '28'
department:
- _id: KrCh
doi: 10.1038/nature11219
ec_funded: 1
external_id:
pmid:
- '22722843'
intvolume: ' 486'
issue: '7404'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/
month: '06'
oa: 1
oa_version: Submitted Version
page: 537 - 540
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '3537'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The molecular evolution of acquired resistance to targeted EGFR blockade in
colorectal cancers
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 486
year: '2012'
...
---
_id: '3260'
abstract:
- lang: eng
text: "Many scenarios in the living world, where individual organisms compete for
winning positions (or resources), have properties of auctions. Here we study the
evolution of bids in biological auctions. For each auction, n individuals are
drawn at random from a population of size N. Each individual makes a bid which
entails a cost. The winner obtains a benefit of a certain value. Costs and benefits
are translated into reproductive success (fitness). Therefore, successful bidding
strategies spread in the population. We compare two types of auctions. In “biological
all-pay auctions”, the costs are the bid for every participating individual. In
“biological second price all-pay auctions”, the cost for everyone other than the
winner is the bid, but the cost for the winner is the second highest bid. Second
price all-pay auctions are generalizations of the “war of attrition” introduced
by Maynard Smith. We study evolutionary dynamics in both types of auctions. We
calculate pairwise invasion plots and evolutionarily stable distributions over
the continuous strategy space. We find that the average bid in second price all-pay
auctions is higher than in all-pay auctions, but the average cost for the winner
is similar in both auctions. In both cases, the average bid is a declining function
of the number of participants, n. The more individuals participate in an auction
the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n"
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions.
Theoretical Population Biology. 2012;81(1):69-80. doi:10.1016/j.tpb.2011.11.003
apa: Chatterjee, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of
biological auctions. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2011.11.003
chicago: Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary
Dynamics of Biological Auctions.” Theoretical Population Biology. Academic
Press, 2012. https://doi.org/10.1016/j.tpb.2011.11.003.
ieee: K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological
auctions,” Theoretical Population Biology, vol. 81, no. 1. Academic Press,
pp. 69–80, 2012.
ista: Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological
auctions. Theoretical Population Biology. 81(1), 69–80.
mla: Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.”
Theoretical Population Biology, vol. 81, no. 1, Academic Press, 2012, pp.
69–80, doi:10.1016/j.tpb.2011.11.003.
short: K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012)
69–80.
date_created: 2018-12-11T12:02:19Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.tpb.2011.11.003
ec_funded: 1
external_id:
pmid:
- '22120126'
intvolume: ' 81'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ '
month: '02'
oa: 1
oa_version: Submitted Version
page: 69 - 80
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '3388'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Evolutionary dynamics of biological auctions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 81
year: '2012'
...
---
_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: 2021-01-12T07:42:36Z
day: '14'
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: '3350'
abstract:
- lang: eng
text: A controller for a discrete game with ω-regular objectives requires attention
if, intuitively, it requires measuring the state and switching from the current
control action. Minimum attention controllers are preferable in modern shared
implementations of cyber-physical systems because they produce the least burden
on system resources such as processor time or communication bandwidth. We give
algorithms to compute minimum attention controllers for ω-regular objectives in
imperfect information discrete two-player games. We show a polynomial-time reduction
from minimum attention controller synthesis to synthesis of controllers for mean-payoff
parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete
synthesis algorithm. We show that the minimum attention controller problem is
decidable for infinite state systems with finite bisimulation quotients. In particular,
the problem is decidable for timed and rectangular automata.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega
regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159.
doi:10.1007/978-3-642-24310-3_11'
apa: 'Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis
for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol.
6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of
Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11'
chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller
Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros
Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11.
ieee: 'K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for
omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis
of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.'
ista: 'Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for
omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems,
LNCS, vol. 6919, 145–159.'
mla: Chatterjee, Krishnendu, and Ritankar Majumdar. Minimum Attention Controller
Synthesis for Omega Regular Objectives. Edited by Uli Fahrenberg and Stavros
Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11.
short: K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer,
2011, pp. 145–159.
conference:
end_date: 2011-09-23
location: Aalborg, Denmark
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2011-09-21
date_created: 2018-12-11T12:02:49Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:51Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-24310-3_11
editor:
- first_name: Uli
full_name: Fahrenberg, Uli
last_name: Fahrenberg
- first_name: Stavros
full_name: Tripakis, Stavros
last_name: Tripakis
intvolume: ' 6919'
language:
- iso: eng
month: '01'
oa_version: None
page: 145 - 159
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: '3271'
quality_controlled: '1'
scopus_import: 1
status: public
title: Minimum attention controller synthesis for omega regular objectives
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6919
year: '2011'
...
---
_id: '3351'
abstract:
- lang: eng
text: In two-player games on graph, the players construct an infinite path through
the game graph and get a reward computed by a payoff function over infinite paths.
Over weighted graphs, the typical and most studied payoff functions compute the
limit-average or the discounted sum of the rewards along the path. Besides their
simple definition, these two payoff functions enjoy the property that memoryless
optimal strategies always exist. In an attempt to construct other simple payoff
functions, we define a class of payoff functions which compute an (infinite) weighted
average of the rewards. This new class contains both the limit-average and the
discounted sum functions, and we show that they are the only members of this class
which induce memoryless optimal strategies, showing that there is essentially
no other simple payoff functions.
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: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: 'Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In:
Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:10.1007/978-3-642-22953-4_13'
apa: 'Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative
objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159).
Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer.
https://doi.org/10.1007/978-3-642-22953-4_13'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless
Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle,
6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
ieee: 'K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,”
presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011,
vol. 6914, pp. 148–159.'
ista: 'Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives.
FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.'
mla: Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives.
Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.
short: K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.),
Springer, 2011, pp. 148–159.
conference:
end_date: 2011-08-25
location: Oslo, Norway
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2011-08-22
date_created: 2018-12-11T12:02:50Z
date_published: 2011-04-16T00:00:00Z
date_updated: 2021-01-12T07:42:52Z
day: '16'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22953-4_13
editor:
- first_name: Olaf
full_name: Owe, Olaf
last_name: Owe
- first_name: Martin
full_name: Steffen, Martin
last_name: Steffen
- first_name: Jan Arne
full_name: Telle, Jan Arne
last_name: Telle
intvolume: ' 6914'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.3211
month: '04'
oa: 1
oa_version: Submitted Version
page: 148 - 159
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: '3270'
quality_controlled: '1'
scopus_import: 1
status: public
title: On memoryless quantitative objectives
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6914
year: '2011'
...
---
_id: '3354'
abstract:
- lang: eng
text: 'We consider two-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 consider ω-regular winning
conditions specified as parity objectives. Both players are allowed to use randomization
when choosing their moves. We study the computation of the limit-winning set of
states, consisting of the states where the sup-inf value of the game for player
1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability
of winning arbitrarily close to 1. We show that the limit-winning set can be computed
in O(n2d+2) time, where n is the size of the game structure and 2d is the number
of priorities (or colors). The membership problem of whether a state belongs to
the limit-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 are considerably
more involved than those for turn-based games. This is because concurrent games
do not satisfy two of the most fundamental properties of turn-based parity games.
First, in concurrent games limit-winning strategies require randomization; and
second, they require infinite memory.'
article_number: '28'
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: 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, De Alfaro L, Henzinger TA. Qualitative concurrent parity games.
ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404
apa: Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent
parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative
Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL).
ACM, 2011. https://doi.org/10.1145/1970398.1970404.
ieee: K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent
parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12,
no. 4. ACM, 2011.
ista: Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity
games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
mla: Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM
Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011,
doi:10.1145/1970398.1970404.
short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational
Logic (TOCL) 12 (2011).
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-04T00:00:00Z
date_updated: 2023-02-23T10:26:18Z
day: '04'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/1970398.1970404
intvolume: ' 12'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
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: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '3262'
quality_controlled: '1'
related_material:
record:
- id: '2054'
relation: later_version
status: public
scopus_import: 1
status: public
title: Qualitative concurrent parity games
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2011'
...
---
_id: '3349'
abstract:
- lang: eng
text: 'Games on graphs provide a natural model for reactive non-terminating systems.
In such games, the interaction of two players on an arena results in an infinite
path that describes a run of the system. Different settings are used to model
various open systems in computer science, as for instance turn-based or concurrent
moves, and deterministic or stochastic transitions. In this paper, we are interested
in turn-based games, and specifically in deterministic parity games and stochastic
reachability games (also known as simple stochastic games). We present a simple,
direct and efficient reduction from deterministic parity games to simple stochastic
games: it yields an arena whose size is linear up to a logarithmic factor in size
of the original arena.'
alternative_title:
- EPTCS
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
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic
games. In: Vol 54. EPTCS; 2011:74-86. doi:10.4204/EPTCS.54.6'
apa: 'Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to
simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games,
Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity
Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
ieee: 'K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic
games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification,
Minori, Italy, 2011, vol. 54, pp. 74–86.'
ista: 'Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic
games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54,
74–86.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity
Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6.
short: K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.
conference:
end_date: 2011-06-17
location: Minori, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2011-06-15
date_created: 2018-12-11T12:02:49Z
date_published: 2011-06-04T00:00:00Z
date_updated: 2021-01-12T07:42:51Z
day: '04'
department:
- _id: KrCh
doi: 10.4204/EPTCS.54.6
intvolume: ' 54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1106.1232
month: '06'
oa: 1
oa_version: Submitted Version
page: 74 - 86
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: EPTCS
publist_id: '3272'
scopus_import: 1
status: public
title: A reduction from parity games to simple stochastic games
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2011'
...
---
_id: '3365'
abstract:
- lang: eng
text: We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative
and quantitative specifications and automatically constructs a system that satisfies
the qualitative specification and optimizes the quantitative specification, if
such a system exists. The user can choose between a system that satisfies and
optimizes the specifications (a) under all possible environment behaviors or (b)
under the most-likely environment behaviors given as a probability distribution
on the possible input sequences. Quasy solves these two quantitative synthesis
problems by reduction to instances of 2-player games and Markov Decision Processes
(MDPs) with quantitative winning objectives. Quasy can also be seen as a game
solver for quantitative games. Most notable, it can solve lexicographic mean-payoff
games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with
mean-payoff parity objectives.
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: 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. QUASY: quantitative synthesis
tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24'
apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY:
quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS:
Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken,
Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit
Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.'
ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative
synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative
synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis
of Systems, LNCS, vol. 6605, 267–271.'
mla: 'Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool.
Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.'
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011,
pp. 267–271.
conference:
end_date: 2011-04-03
location: Saarbrucken, Germany
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2011-03-26
date_created: 2018-12-11T12:02:55Z
date_published: 2011-09-29T00:00:00Z
date_updated: 2021-01-12T07:42:58Z
day: '29'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-19835-9_24
file:
- access_level: open_access
checksum: 762e52eb296f6dbfbf2a75d98b8ebaee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:37Z
date_updated: 2020-07-14T12:46:10Z
file_id: '5022'
file_name: IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf
file_size: 475661
relation: main_file
file_date_updated: 2020-07-14T12:46:10Z
has_accepted_license: '1'
intvolume: ' 6605'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 267 - 271
publication_status: published
publisher: Springer
publist_id: '3248'
pubrep_id: '77'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'QUASY: quantitative synthesis tool'
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6605
year: '2011'
...
---
_id: '3363'
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 a complete characterization
of the decidability and undecidability frontier of the quantitative and qualitative
decision problems for probabilistic automata on infinite words.
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: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic
automata on infinite words.
apa: Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability
frontier for probabilistic automata on infinite words. ArXiv.
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability
Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
ieee: K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier
for probabilistic automata on infinite words.” ArXiv.
ista: Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic
automata on infinite words.
mla: Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic
Automata on Infinite Words. ArXiv.
short: K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
date_created: 2018-12-11T12:02:54Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2020-01-21T13:20:24Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '1104.0127'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1104.0127
month: '04'
oa: 1
oa_version: Preprint
page: '19'
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _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
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: submitted
publisher: ArXiv
publist_id: '3251'
status: public
title: The decidability frontier for probabilistic automata on infinite words
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...