---
_id: '523'
abstract:
- lang: eng
text: We consider two-player games played on weighted directed graphs with mean-payoff
and total-payoff objectives, two classical quantitative objectives. While for
single-dimensional games the complexity and memory bounds for both objectives
coincide, we show that in contrast to multi-dimensional mean-payoff games that
are known to be coNP-complete, multi-dimensional total-payoff games are undecidable.
We introduce conservative approximations of these objectives, where the payoff
is considered over a local finite window sliding along a play, instead of the
whole play. For single dimension, we show that (i) if the window size is polynomial,
deciding the winner takes polynomial time, and (ii) the existence of a bounded
window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff
games. For multiple dimensions, we show that (i) the problem with fixed window
size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to
decide the existence of a bounded window.
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: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff
through windows. Information and Computation. 2015;242(6):25-52. doi:10.1016/j.ic.2015.03.010
apa: Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2015). Looking at
mean-payoff and total-payoff through windows. Information and Computation.
Elsevier. https://doi.org/10.1016/j.ic.2015.03.010
chicago: Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin.
“Looking at Mean-Payoff and Total-Payoff through Windows.” Information and
Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.010.
ieee: K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff
and total-payoff through windows,” Information and Computation, vol. 242,
no. 6. Elsevier, pp. 25–52, 2015.
ista: Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and
total-payoff through windows. Information and Computation. 242(6), 25–52.
mla: Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through
Windows.” Information and Computation, vol. 242, no. 6, Elsevier, 2015,
pp. 25–52, doi:10.1016/j.ic.2015.03.010.
short: K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation
242 (2015) 25–52.
date_created: 2018-12-11T11:46:57Z
date_published: 2015-03-24T00:00:00Z
date_updated: 2023-02-23T10:36:02Z
day: '24'
department:
- _id: KrCh
doi: 10.1016/j.ic.2015.03.010
ec_funded: 1
intvolume: ' 242'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1302.4248
month: '03'
oa: 1
oa_version: Preprint
page: 25 - 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: 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: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '7296'
quality_controlled: '1'
related_material:
record:
- id: '2279'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Looking at mean-payoff and total-payoff through windows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 242
year: '2015'
...
---
_id: '524'
abstract:
- lang: eng
text: 'We consider concurrent games played by two players on a finite-state graph,
where in every round the players simultaneously choose a move, and the current
state along with the joint moves determine the successor state. We study the most
fundamental objective for concurrent games, namely, mean-payoff or limit-average
objective, where a reward is associated to each transition, and the goal of player
1 is to maximize the long-run average of the rewards, and the objective of player
2 is strictly the opposite (i.e., the games are zero-sum). The path constraint
for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward,
or arbitrarily close to it; or quantitative, i.e., a given threshold between the
minimal and maximal reward. We consider the computation of the almost-sure (resp.
positive) winning sets, where player 1 can ensure that the path constraint is
satisfied with probability 1 (resp. positive probability). Almost-sure winning
with qualitative constraint exactly corresponds to the question of whether there
exists a strategy to ensure that the payoff is the maximal reward of the game.
Our main results for qualitative path constraints are as follows: (1) we establish
qualitative determinacy results that show that for every state either player 1
has a strategy to ensure almost-sure (resp. positive) winning against all player-2
strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp.
positive) winning against all player-1 strategies; (2) we present optimal strategy
complexity results that precisely characterize the classes of strategies required
for almost-sure and positive winning for both players; and (3) we present quadratic
time algorithms to compute the almost-sure and the positive winning sets, matching
the best known bound of the algorithms for much simpler problems (such as reachability
objectives). For quantitative constraints we show that a polynomial time solution
for the almost-sure or the positive winning set would imply a solution to a long-standing
open problem (of solving the value problem of turn-based deterministic mean-payoff
games) that is not known to be solvable in polynomial time.'
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: 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. Qualitative analysis of concurrent mean payoff
games. Information and Computation. 2015;242(6):2-24. doi:10.1016/j.ic.2015.03.009
apa: Chatterjee, K., & Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent
mean payoff games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.009
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis
of Concurrent Mean Payoff Games.” Information and Computation. Elsevier,
2015. https://doi.org/10.1016/j.ic.2015.03.009.
ieee: K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean
payoff games,” Information and Computation, vol. 242, no. 6. Elsevier,
pp. 2–24, 2015.
ista: Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean
payoff games. Information and Computation. 242(6), 2–24.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent
Mean Payoff Games.” Information and Computation, vol. 242, no. 6, Elsevier,
2015, pp. 2–24, doi:10.1016/j.ic.2015.03.009.
short: K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
date_created: 2018-12-11T11:46:57Z
date_published: 2015-10-11T00:00:00Z
date_updated: 2023-02-23T12:24:45Z
day: '11'
department:
- _id: KrCh
doi: 10.1016/j.ic.2015.03.009
external_id:
arxiv:
- '1409.5306'
intvolume: ' 242'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.5306
month: '10'
oa: 1
oa_version: Preprint
page: 2 - 24
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '7295'
quality_controlled: '1'
related_material:
record:
- id: '5403'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Qualitative analysis of concurrent mean payoff games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 242
year: '2015'
...
---
_id: '5429'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. \r\nThere have been two different views: (i) the
expectation semantics, where the goal is to optimize the expected mean-payoff
objective, and (ii) the satisfaction semantics, where the goal is to maximize
the probability of runs such that the mean-payoff value stays above a given vector.
\ \r\nWe consider the problem where the goal is to optimize the expectation under
the constraint that the satisfaction semantics is ensured, and thus consider a
generalization that unifies the existing semantics.\r\nOur problem captures the
notion of optimization with respect to strategies that are risk-averse (i.e.,
ensures certain probabilistic guarantee).\r\nOur main results are algorithms for
the decision problem which are always polynomial in the size of the MDP. We also
show that an approximation of the Pareto-curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions.\r\nFinally, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem."
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: Zuzana
full_name: Komarkova, Zuzana
last_name: Komarkova
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1
apa: Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two
views on multiple mean-payoff objectives in Markov decision processes. IST
Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1
chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.
ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple
mean-payoff objectives in Markov decision processes. IST Austria, 2015.
ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes, IST Austria, 41p.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.
short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-01-12T00:00:00Z
date_updated: 2023-02-23T12:26:16Z
day: '12'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v1-1
file:
- access_level: open_access
checksum: e4869a584567c506349abda9c8ec7db3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:11Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5533'
file_name: IST-2015-318-v1+1_main.pdf
file_size: 689863
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '41'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '318'
related_material:
record:
- id: '1657'
relation: later_version
status: public
- id: '466'
relation: later_version
status: public
- id: '5435'
relation: later_version
status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5430'
abstract:
- lang: eng
text: We consider the core algorithmic problems related to verification of systems
with respect to three classical quantitative properties, namely, the mean- payoff
property, the ratio property, and the minimum initial credit for energy property.
The algorithmic problem given a graph and a quantitative property asks to compute
the optimal value (the infimum value over all traces) from every node of the graph.
We consider graphs with constant treewidth, and it is well-known that the control-flow
graphs of most programs have constant treewidth. Let n denote the number of nodes
of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) )
and W the largest absolute value of the weights. Our main theoretical results
are as follows. First, for constant treewidth graphs we present an algorithm that
approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time
O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms
that require quadratic time. Second, for the ratio property we present an algorithm
that for constant treewidth graphs works in time O ( n · log( | a · b · n | ))
= O ( n · log( n · W )) , when the output is a b , as compared to the previously
best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the
minimum initial credit problem we show that (i) for general graphs the problem
can be solved in O ( n 2 · m ) time and the associated decision problem can be
solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n
· W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth
graphs we present an algorithm that requires O ( n · log n ) time, improving the
previous known O ( n 4 · log( n · W )) bound. We have implemented some of our
algorithms and show that they present a significant speedup on standard benchmarks.
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-319-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster
algorithms for quantitative verification in constant treewidth graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-319-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms
for quantitative verification in constant treewidth graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for
quantitative verification in constant treewidth graphs, IST Austria, 31p.
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification
in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-319-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-10T00:00:00Z
date_updated: 2023-02-23T12:26:22Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-319-v1-1
file:
- access_level: open_access
checksum: 62c6ea01e342553dcafb88a070fb1ad5
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:21Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5482'
file_name: IST-2015-319-v1+1_long.pdf
file_size: 1089651
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '319'
related_material:
record:
- id: '1607'
relation: later_version
status: public
- id: '5437'
relation: later_version
status: public
status: public
title: Faster algorithms for quantitative verification in constant treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5431'
abstract:
- lang: eng
text: "We consider finite-state concurrent stochastic games, played by k>=2 players
for an infinite number of rounds, where in every round, each player simultaneously
and independently of the other players chooses an action, whereafter the successor
state is determined by a probability distribution given by the current state and
the chosen actions. We consider reachability objectives that given a target set
of states require that some state in the target set is visited, and the dual safety
objectives that given a target set require that only states in the target set
are visited. We are interested in the complexity of stationary strategies measured
by their patience, which is defined as the inverse of the smallest non-zero probability
employed.\r\n\r\n Our main results are as follows: We show that in two-player
zero-sum concurrent stochastic games (with reachability objective for one player
and the complementary safety objective for the other player): (i) the optimal
bound on the patience of optimal and epsilon-optimal strategies, for both players
is doubly exponential; and (ii) even in games with a single non-absorbing state
exponential (in the number of actions) patience is necessary. In general we study
the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that
if there is at least one player with reachability objective, then doubly-exponential
patience is needed in general for epsilon-Nash equilibrium strategies, whereas
in contrast if all players have safety objectives, then the optimal bound on patience
for epsilon-Nash equilibrium strategies is only exponential."
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: Kristoffer
full_name: Hansen, Kristoffer
last_name: Hansen
citation:
ama: Chatterjee K, Ibsen-Jensen R, Hansen K. The Patience of Concurrent Stochastic
Games with Safety and Reachability Objectives. IST Austria; 2015. doi:10.15479/AT:IST-2015-322-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Hansen, K. (2015). The patience
of concurrent stochastic games with safety and reachability objectives. IST
Austria. https://doi.org/10.15479/AT:IST-2015-322-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The
Patience of Concurrent Stochastic Games with Safety and Reachability Objectives.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent
stochastic games with safety and reachability objectives. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic
games with safety and reachability objectives, IST Austria, 25p.
mla: Chatterjee, Krishnendu, et al. The Patience of Concurrent Stochastic Games
with Safety and Reachability Objectives. IST Austria, 2015, doi:10.15479/AT:IST-2015-322-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic
Games with Safety and Reachability Objectives, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2021-01-12T08:02:13Z
day: '19'
ddc:
- '005'
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-322-v1-1
file:
- access_level: open_access
checksum: bfb858262c30445b8e472c40069178a2
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:31Z
date_updated: 2020-07-14T12:46:53Z
file_id: '5491'
file_name: IST-2015-322-v1+1_safetygames.pdf
file_size: 661015
relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '322'
status: public
title: The patience of concurrent stochastic games with safety and reachability objectives
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5432'
abstract:
- lang: eng
text: "Evolution occurs in populations of reproducing individuals. The structure
of the population affects the outcome of the evolutionary process. Evolutionary
graph theory is a powerful approach to study this phenomenon. There are two graphs.
The interaction graph specifies who interacts with whom in the context of evolution.The
replacement graph specifies who competes with whom for reproduction. \r\nThe vertices
of the two graphs are the same, and each vertex corresponds to an individual of
the population. A key quantity is the fixation probability of a new mutant. It
is defined as the probability that a newly introduced mutant (on a single vertex)
generates a lineage of offspring which eventually takes over the entire population
of resident individuals. The basic computational questions are as follows: (i)
the qualitative question asks whether the fixation probability is positive; and
(ii) the quantitative approximation question asks for an approximation of the
fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative
question is NP-complete and the quantitative approximation question is #P-hard
in the special case when the interaction and the replacement graphs coincide and
even with the restriction that the resident individuals do not reproduce (which
corresponds to an invading population taking over an empty structure).\r\n(2)
We show that in general the qualitative question is PSPACE-complete and the quantitative
approximation question is PSPACE-hard and can be solved in exponential time.\r\n"
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: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games
on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity
of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity
of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary
games on graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary
games on graphs, IST Austria, 29p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs.
IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary
Games on Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:18Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2023-02-23T12:26:33Z
day: '19'
ddc:
- '005'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-323-v1-1
file:
- access_level: open_access
checksum: 546c1b291d545e7b24aaaf4199dac671
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:57Z
date_updated: 2020-07-14T12:46:53Z
file_id: '5519'
file_name: IST-2015-323-v1+1_main.pdf
file_size: 576347
relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '323'
related_material:
record:
- id: '5421'
relation: earlier_version
status: public
- id: '5440'
relation: later_version
status: public
status: public
title: The complexity of evolutionary games on graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5435'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. \r\nThere have been two different views: (i) the
expectation semantics, where the goal is to optimize the expected mean-payoff
objective, and (ii) the satisfaction semantics, where the goal is to maximize
the probability of runs such that the mean-payoff value stays above a given vector.
\ \r\nWe consider the problem where the goal is to optimize the expectation under
the constraint that the satisfaction semantics is ensured, and thus consider a
generalization that unifies the existing semantics. Our problem captures the notion
of optimization with respect to strategies that are risk-averse (i.e., ensures
certain probabilistic guarantee).\r\nOur main results are algorithms for the decision
problem which are always polynomial in the size of the MDP.\r\nWe also show that
an approximation of the Pareto-curve can be computed in time polynomial in the
size of the MDP, and the approximation factor, but exponential in the number of
dimensions. Finally, we present a complete characterization of the strategy complexity
(in terms of memory bounds and randomization) required to solve our problem."
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: Zuzana
full_name: Komarkova, Zuzana
last_name: Komarkova
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v2-1
apa: Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two
views on multiple mean-payoff objectives in Markov decision processes. IST
Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1
chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.
ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple
mean-payoff objectives in Markov decision processes. IST Austria, 2015.
ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes, IST Austria, 51p.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.
short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:19Z
date_published: 2015-02-23T00:00:00Z
date_updated: 2023-02-23T12:26:00Z
day: '23'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v2-1
file:
- access_level: open_access
checksum: 75284adec80baabdfe71ff9ebbc27445
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:03Z
date_updated: 2020-07-14T12:46:53Z
file_id: '5525'
file_name: IST-2015-318-v2+1_main.pdf
file_size: 717630
relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '51'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '327'
related_material:
record:
- id: '1657'
relation: later_version
status: public
- id: '466'
relation: later_version
status: public
- id: '5429'
relation: earlier_version
status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5436'
abstract:
- lang: eng
text: "Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata, nor in any other know
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata which makes it possible to express important
quantitative properties such as average response time.\r\nIn nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in run-time verification. We establish an almost complete
decidability picture for the basic decision problems about nested weighted automata,
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties."
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
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria;
2015. doi:10.15479/AT:IST-2015-170-v2-2
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted
automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted
Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata.
IST Austria, 2015.
ista: Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria,
29p.
mla: Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria,
2015, doi:10.15479/AT:IST-2015-170-v2-2.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria,
2015.
date_created: 2018-12-12T11:39:19Z
date_published: 2015-04-24T00:00:00Z
date_updated: 2023-02-23T12:25:21Z
day: '24'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2015-170-v2-2
file:
- access_level: open_access
checksum: 3c402f47d3669c28d04d1af405a08e3f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:19Z
date_updated: 2020-07-14T12:46:54Z
file_id: '5541'
file_name: IST-2015-170-v2+2_report.pdf
file_size: 569991
relation: main_file
file_date_updated: 2020-07-14T12:46:54Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '331'
related_material:
record:
- id: '1656'
relation: later_version
status: public
- id: '467'
relation: later_version
status: public
- id: '5415'
relation: earlier_version
status: public
status: public
title: Nested weighted automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5437'
abstract:
- lang: eng
text: "We consider the core algorithmic problems related to verification of systems
with respect to three classical quantitative properties, namely, the mean-payoff
property, the ratio property, and the minimum initial credit for energy property.
\r\nThe algorithmic problem given a graph and a quantitative property asks to
compute the optimal value (the infimum value over all traces) from every node
of the graph. We consider graphs with constant treewidth, and it is well-known
that the control-flow graphs of most programs have constant treewidth. Let $n$
denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth
graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main
theoretical results are as follows.\r\nFirst, for constant treewidth graphs we
present an algorithm that approximates the mean-payoff value within a multiplicative
factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space,
as compared to the classical algorithms that require quadratic time. Second, for
the ratio property we present an algorithm that for constant treewidth graphs
works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when
the output is $\\frac{a}{b}$, as compared to the previously best known algorithm
with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial
credit problem we show that (i)~for general graphs the problem can be solved in
$O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot
m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$
and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs
we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the
previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented
some of our algorithms and show that they present a significant speedup on standard
benchmarks. "
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-330-v2-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster
algorithms for quantitative verification in constant treewidth graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms
for quantitative verification in constant treewidth graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for
quantitative verification in constant treewidth graphs, IST Austria, 27p.
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification
in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:19Z
date_published: 2015-04-27T00:00:00Z
date_updated: 2023-02-23T12:26:05Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-330-v2-1
file:
- access_level: open_access
checksum: f5917c20f84018b362d385c000a2e123
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:12Z
date_updated: 2020-07-14T12:46:54Z
file_id: '5473'
file_name: IST-2015-330-v2+1_main.pdf
file_size: 1072137
relation: main_file
file_date_updated: 2020-07-14T12:46:54Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '333'
related_material:
record:
- id: '1607'
relation: later_version
status: public
- id: '5430'
relation: earlier_version
status: public
status: public
title: Faster algorithms for quantitative verification in constant treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5438'
abstract:
- lang: eng
text: "The edit distance between two words w1, w2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses.\r\nThe problem of computing edit
distance to a pushdown automaton is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k. "
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown
Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance
for pushdown automata. IST Austria, 2015.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata, IST Austria, 15p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata.
IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for
Pushdown Automata, IST Austria, 2015.
date_created: 2018-12-12T11:39:20Z
date_published: 2015-05-05T00:00:00Z
date_updated: 2023-02-23T12:20:08Z
day: '05'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-334-v1-1
file:
- access_level: open_access
checksum: 8a5f2d77560e552af87eb1982437a43b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:56Z
date_updated: 2020-07-14T12:46:55Z
file_id: '5518'
file_name: IST-2015-334-v1+1_report.pdf
file_size: 422573
relation: main_file
file_date_updated: 2020-07-14T12:46:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '15'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '334'
related_material:
record:
- id: '1610'
relation: later_version
status: public
- id: '465'
relation: later_version
status: public
status: public
title: Edit distance for pushdown automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5440'
abstract:
- lang: eng
text: 'Evolution occurs in populations of reproducing individuals. The structure
of the population affects the outcome of the evolutionary process. Evolutionary
graph theory is a powerful approach to study this phenomenon. There are two graphs.
The interaction graph specifies who interacts with whom for payoff in the context
of evolution. The replacement graph specifies who competes with whom for reproduction.
The vertices of the two graphs are the same, and each vertex corresponds to an
individual of the population. The fitness (or the reproductive rate) is a non-negative
number, and depends on the payoff. A key quantity is the fixation probability
of a new mutant. It is defined as the probability that a newly introduced mutant
(on a single vertex) generates a lineage of offspring which eventually takes over
the entire population of resident individuals. The basic computational questions
are as follows: (i) the qualitative question asks whether the fixation probability
is positive; and (ii) the quantitative approximation question asks for an approximation
of the fixation probability. Our main results are as follows: First, we consider
a special case of the general problem, where the residents do not reproduce. We
show that the qualitative question is NP-complete, and the quantitative approximation
question is #P-complete, and the hardness results hold even in the special case
where the interaction and the replacement graphs coincide. Second, we show that
in general both the qualitative and the quantitative approximation questions are
PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds
even when the fitness is always positive.'
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: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games
on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v2-2
apa: Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity
of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity
of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary
games on graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary
games on graphs, IST Austria, 18p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs.
IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary
Games on Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:21Z
date_published: 2015-06-16T00:00:00Z
date_updated: 2023-02-23T12:26:10Z
day: '16'
ddc:
- '005'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-323-v2-2
file:
- access_level: open_access
checksum: 66aace7d367032af97c15e35c9be9636
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:23Z
date_updated: 2020-07-14T12:46:56Z
file_id: '5484'
file_name: IST-2015-323-v2+2_main.pdf
file_size: 466161
relation: main_file
file_date_updated: 2020-07-14T12:46:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '338'
related_material:
record:
- id: '5421'
relation: earlier_version
status: public
- id: '5432'
relation: earlier_version
status: public
status: public
title: The complexity of evolutionary games on graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5441'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
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: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- 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, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A.
(2015). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady,
and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,
IST Austria, 24p.
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015,
doi:10.15479/AT:IST-2015-340-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,
IST Austria, 2015.
date_created: 2018-12-12T11:39:21Z
date_published: 2015-07-11T00:00:00Z
date_updated: 2023-09-19T14:36:19Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-340-v1-1
file:
- access_level: open_access
checksum: df383dc62c94d7b2ea639aba088a76c6
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:09Z
date_updated: 2020-07-14T12:46:56Z
file_id: '5531'
file_name: IST-2015-340-v1+1_main.pdf
file_size: 861396
relation: main_file
file_date_updated: 2020-07-14T12:46:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '24'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '340'
related_material:
record:
- id: '1437'
relation: later_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '6009'
relation: later_version
status: public
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5443'
abstract:
- lang: eng
text: POMDPs are standard models for probabilistic planning problems, where an agent
interacts with an uncertain environment. We study the problem of almost-sure reachability,
where given a set of target states, the question is to decide whether there is
a policy to ensure that the target set is reached with probability 1 (almost-surely).
While in general the problem is EXPTIME-complete, in many practical cases policies
with a small amount of memory suffice. Moreover, the existing solution to the
problem is explicit, which first requires to construct explicitly an exponential
reduction to a belief-support MDP. In this work, we first study the existence
of observation-stationary strategies, which is NP-complete, and then small-memory
strategies. We present a symbolic algorithm by an efficient encoding to SAT and
using a SAT solver for the problem. We report experimental results demonstrating
the scalability of our symbolic (SAT-based) approach.
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Jessica
full_name: Davies, Jessica
id: 378E0060-F248-11E8-B48F-1D18A9856A87
last_name: Davies
citation:
ama: Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure
Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1
apa: Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based
algorithm for almost-sure reachability with small strategies in POMDPs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic
SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
ieee: K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm
for almost-sure reachability with small strategies in POMDPs. IST Austria,
2015.
ista: Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for
almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
mla: Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure
Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.
short: K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for
Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
date_created: 2018-12-12T11:39:22Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2023-02-21T16:24:05Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-325-v2-1
file:
- access_level: open_access
checksum: f0fa31ad8161ed655137e94012123ef9
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:05Z
date_updated: 2020-07-14T12:46:57Z
file_id: '5466'
file_name: IST-2015-325-v2+1_main.pdf
file_size: 412379
relation: main_file
file_date_updated: 2020-07-14T12:46:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '23'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '362'
related_material:
record:
- id: '1166'
relation: later_version
status: public
status: public
title: A symbolic SAT-based algorithm for almost-sure reachability with small strategies
in POMDPs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5444'
abstract:
- lang: eng
text: A comprehensive understanding of the clonal evolution of cancer is critical
for understanding neoplasia. Genome-wide sequencing data enables evolutionary
studies at unprecedented depth. However, classical phylogenetic methods often
struggle with noisy sequencing data of impure DNA samples and fail to detect subclones
that have different evolutionary trajectories. We have developed a tool, called
Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly
available sequencing technologies. Using Bayesian inference and Integer Linear
Programming, robust phylogenies consistent with the biological processes underlying
cancer evolution were obtained for pancreatic, ovarian, and prostate cancers.
Furthermore, Treeomics correctly identified sequencing artifacts such as those
resulting from low statistical power; nearly 7% of variants were misclassified
by conventional statistical methods. These artifacts can skew phylogenies by creating
illusory tumor heterogeneity among distinct samples. Importantly, we show that
the evolutionary trees generated with Treeomics are mathematically optimal.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Alvin
full_name: Makohon-Moore, Alvin
last_name: Makohon-Moore
- first_name: Jeffrey
full_name: Gerold, Jeffrey
last_name: Gerold
- first_name: Ivana
full_name: Bozic, Ivana
last_name: Bozic
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Christine
full_name: Iacobuzio-Donahue, Christine
last_name: Iacobuzio-Donahue
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Makohon-Moore A, Gerold J, et al. Reconstructing Robust Phylogenies
of Metastatic Cancers. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1
apa: Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue,
C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers.
IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1
chicago: Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu
Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing
Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.
ieee: J. Reiter et al., Reconstructing robust phylogenies of metastatic
cancers. IST Austria, 2015.
ista: Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue
C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic
cancers, IST Austria, 25p.
mla: Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic
Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.
short: J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue,
B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers,
IST Austria, 2015.
date_created: 2018-12-12T11:39:22Z
date_published: 2015-12-30T00:00:00Z
date_updated: 2020-07-14T23:05:07Z
day: '30'
ddc:
- '000'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-399-v1-1
file:
- access_level: open_access
checksum: c47d33bdda06181753c0af36f16e7b5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5485'
file_name: IST-2015-399-v1+1_treeomics.pdf
file_size: 3533200
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '399'
status: public
title: Reconstructing robust phylogenies of metastatic cancers
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5549'
abstract:
- lang: eng
text: "This repository contains the experimental part of the CAV 2015 publication
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe
extended the probabilistic model checker PRISM to represent strategies of Markov
Decision Processes as Decision Trees.\r\nThe archive contains a java executable
version of the extended tool (prism_dectree.jar) together with a few examples
of the PRISM benchmark library.\r\nTo execute the program, please have a look
at the README.txt, which provides instructions and further information on the
archive.\r\nThe archive contains scripts that (if run often enough) reproduces
the data presented in the publication."
article_processing_charge: No
author:
- first_name: Andreas
full_name: Fellner, Andreas
id: 42BABFB4-F248-11E8-B48F-1D18A9856A87
last_name: Fellner
citation:
ama: 'Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28'
apa: 'Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28'
chicago: 'Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes.” Institute
of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.'
ieee: 'A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes.” Institute of Science
and Technology Austria, 2015.'
ista: 'Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:28.'
mla: 'Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.'
short: A. Fellner, (2015).
contributor:
- first_name: Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
datarep_id: '28'
date_created: 2018-12-12T12:31:29Z
date_published: 2015-08-13T00:00:00Z
date_updated: 2024-02-21T13:52:07Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:ISTA:28
ec_funded: 1
file:
- access_level: open_access
checksum: b8bcb43c0893023cda66c1b69c16ac62
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:31Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5597'
file_name: IST-2015-28-v1+2_Fellner_DataRep.zip
file_size: 49557109
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
keyword:
- Markov Decision Process
- Decision Tree
- Probabilistic Verification
- Counterexample Explanation
month: '08'
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
publisher: Institute of Science and Technology Austria
publist_id: '5564'
related_material:
record:
- id: '1603'
relation: popular_science
status: public
status: public
title: 'Experimental part of CAV 2015 publication: Counterexample Explanation by Learning
Small Strategies in Markov Decision Processes'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1481'
abstract:
- lang: eng
text: 'Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role
not only in the development of mathematical and logical skills, but also in the
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. We present an approach that 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. The presence of such states for standard game variants
like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played
as the default start state is heavily biased. '
acknowledgement: "A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n"
article_processing_charge: No
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 simple traditional board games. In: Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.'
apa: 'Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation
of alternative starting positions for simple traditional board games. In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp.
745–752). Austin, TX, USA: AAAI Press.'
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation
of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52.
AAAI Press, 2015.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative
starting positions for simple traditional board games,” in Proceedings of the
Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA,
2015, vol. 2, pp. 745–752.
ista: 'Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative
starting positions for simple traditional board games. Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 2, 745–752.'
mla: Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions
for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference
on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.
short: U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.
conference:
end_date: 2015-01-30
location: Austin, TX, USA
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2015-01-25
date_created: 2018-12-11T11:52:16Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:07Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
intvolume: ' 2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300
month: '01'
oa: 1
oa_version: None
page: 745 - 752
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 Twenty-Ninth AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '5713'
quality_controlled: '1'
related_material:
record:
- id: '5410'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Automatic generation of alternative starting positions for simple traditional
board games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '1499'
abstract:
- lang: eng
text: "We consider weighted automata with both positive and negative integer weights
on edges and\r\nstudy the problem of synchronization using adaptive strategies
that may only observe whether\r\nthe current weight-level is negative or nonnegative.
We show that the synchronization problem is decidable in polynomial time for deterministic
weighted automata."
acknowledgement: "The research leading to these results has received funding from
the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement
601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center
IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM),
the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein
Award), the Czech Science Foundation under grant agreement P202/12/G061, and People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme
(FP7/2007-2013) REA Grant No 291734."
alternative_title:
- LIPIcs
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Kim
full_name: Larsen, Kim
last_name: Larsen
- first_name: Simon
full_name: Laursen, Simon
last_name: Laursen
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: 'Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of
weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2015:142-154. doi:10.4230/LIPIcs.CONCUR.2015.142'
apa: 'Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial
time decidability of weighted synchronization under partial observability (Vol.
42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142'
chicago: Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time
Decidability of Weighted Synchronization under Partial Observability,” 42:142–54.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.
ieee: 'J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability
of weighted synchronization under partial observability,” presented at the CONCUR:
Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.'
ista: 'Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability
of weighted synchronization under partial observability. CONCUR: Concurrency Theory,
LIPIcs, vol. 42, 142–154.'
mla: Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization
under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.
short: J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2015, pp. 142–154.
conference:
end_date: 2015-09-04
location: Madrid, Spain
name: 'CONCUR: Concurrency Theory'
start_date: 2015-09-01
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:10Z
day: '01'
ddc:
- '000'
- '003'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2015.142
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:12Z
date_updated: 2020-07-14T12:44:58Z
file_id: '4672'
file_name: IST-2016-498-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 42'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 142 - 154
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: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5680'
pubrep_id: '498'
quality_controlled: '1'
scopus_import: 1
status: public
title: Polynomial time decidability of weighted synchronization under partial observability
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2015'
...
---
_id: '1501'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability. We introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph algorithms with quadratic complexity to compute the simulation
relation. We present an automated technique for assume-guarantee style reasoning
for compositional analysis of two-player games by giving a counterexample guided
abstraction-refinement approach to compute our new simulation relation. We show
a tight link between two-player games and MDPs, and as a consequence the results
for games are lifted to MDPs with qualitative properties. We have implemented
our algorithms and show that the compositional analysis leads to significant improvements. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE),
and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games),
Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive
Modeling).'
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: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
citation:
ama: Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative
properties in Markov decision processes. Formal Methods in System Design.
2015;47(2):230-264. doi:10.1007/s10703-015-0235-2
apa: Chatterjee, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional
analysis of qualitative properties in Markov decision processes. Formal Methods
in System Design. Springer. https://doi.org/10.1007/s10703-015-0235-2
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for
Compositional Analysis of Qualitative Properties in Markov Decision Processes.”
Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
ieee: K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis
of qualitative properties in Markov decision processes,” Formal Methods in
System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
ista: Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of
qualitative properties in Markov decision processes. Formal Methods in System
Design. 47(2), 230–264.
mla: Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative
Properties in Markov Decision Processes.” Formal Methods in System Design,
vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.
short: K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015)
230–264.
date_created: 2018-12-11T11:52:23Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-015-0235-2
ec_funded: 1
intvolume: ' 47'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.0835
month: '10'
oa: 1
oa_version: Preprint
page: 230 - 264
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
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '5677'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: CEGAR for compositional analysis of qualitative properties in Markov decision
processes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2015'
...
---
_id: '1502'
abstract:
- lang: eng
text: We extend the theory of input-output conformance with operators for merge
and quotient. The former is useful when testing against multiple requirements
or views. The latter can be used to generate tests for patches of an already tested
system. Both operators can combine systems with different action alphabets, which
is usually the case when constructing complex systems and specifications from
parts, for instance different views as well as newly defined functionality of
a~previous version of the system.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme
(Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013)
under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373
(nSafeCer). Jan Křetínský has been partially supported by the Czech Science Foundation,
grant No. P202/12/G061. Nikola Beneš has been supported by the\r\nMEYS project
No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for
Scientific Excellence."
alternative_title:
- 'Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering '
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- 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: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
citation:
ama: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition
operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:10.1145/2737166.2737175'
apa: 'Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., & Nickovic, D. (2015).
Complete composition operators for IOCO-testing theory (pp. 101–110). Presented
at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.
https://doi.org/10.1145/2737166.2737175'
chicago: Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and
Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10.
ACM, 2015. https://doi.org/10.1145/2737166.2737175.
ieee: 'N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete
composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based
Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.'
ista: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition
operators for IOCO-testing theory. CBSE: Component-Based Software Engineering
, Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering , , 101–110.'
mla: Beneš, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory.
ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.
short: N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015,
pp. 101–110.
conference:
end_date: 2015-05-08
location: Montreal, QC, Canada
name: 'CBSE: Component-Based Software Engineering '
start_date: 2015-05-04
date_created: 2018-12-11T11:52:24Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1145/2737166.2737175
ec_funded: 1
file:
- access_level: open_access
checksum: c6ce681035c163a158751f240cb7d389
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:46Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5303'
file_name: IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf
file_size: 467561
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 101 - 110
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: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_identifier:
isbn:
- 978-1-4503-3471-6
publication_status: published
publisher: ACM
publist_id: '5676'
pubrep_id: '625'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Complete composition operators for IOCO-testing theory
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1559'
abstract:
- lang: eng
text: 'There are deep, yet largely unexplored, connections between computer science
and biology. Both disciplines examine how information proliferates in time and
space. Central results in computer science describe the complexity of algorithms
that solve certain classes of problems. An algorithm is deemed efficient if it
can solve a problem in polynomial time, which means the running time of the algorithm
is a polynomial function of the length of the input. There are classes of harder
problems for which the fastest possible algorithm requires exponential time. Another
criterion is the space requirement of the algorithm. There is a crucial distinction
between algorithms that can find a solution, verify a solution, or list several
distinct solutions in given time and space. The complexity hierarchy that is generated
in this way is the foundation of theoretical computer science. Precise complexity
results can be notoriously difficult. The famous question whether polynomial time
equals nondeterministic polynomial time (i.e., P = NP) is one of the hardest open
problems in computer science and all of mathematics. Here, we consider simple
processes of ecological and evolutionary spatial dynamics. The basic question
is: What is the probability that a new invader (or a new mutant)will take over
a resident population?We derive precise complexity results for a variety of scenarios.
We therefore show that some fundamental questions in this area cannot be answered
by simple equations (assuming that P is not equal to NP).'
author:
- 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: 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: Ibsen-Jensen R, Chatterjee K, Nowak M. Computational complexity of ecological
and evolutionary spatial dynamics. PNAS. 2015;112(51):15636-15641. doi:10.1073/pnas.1511366112
apa: Ibsen-Jensen, R., Chatterjee, K., & Nowak, M. (2015). Computational complexity
of ecological and evolutionary spatial dynamics. PNAS. National Academy
of Sciences. https://doi.org/10.1073/pnas.1511366112
chicago: Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational
Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS. National
Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511366112.
ieee: R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of
ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51.
National Academy of Sciences, pp. 15636–15641, 2015.
ista: Ibsen-Jensen R, Chatterjee K, Nowak M. 2015. Computational complexity of ecological
and evolutionary spatial dynamics. PNAS. 112(51), 15636–15641.
mla: Ibsen-Jensen, Rasmus, et al. “Computational Complexity of Ecological and Evolutionary
Spatial Dynamics.” PNAS, vol. 112, no. 51, National Academy of Sciences,
2015, pp. 15636–41, doi:10.1073/pnas.1511366112.
short: R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
date_created: 2018-12-11T11:52:43Z
date_published: 2015-12-22T00:00:00Z
date_updated: 2021-01-12T06:51:36Z
day: '22'
department:
- _id: KrCh
doi: 10.1073/pnas.1511366112
external_id:
pmid:
- '26644569'
intvolume: ' 112'
issue: '51'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4697423/
month: '12'
oa: 1
oa_version: Submitted Version
page: 15636 - 15641
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5612'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computational complexity of ecological and evolutionary spatial dynamics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...