---
_id: '3852'
abstract:
- lang: eng
text: 'We introduce two-level discounted games played by two players on a perfect-information
stochastic game graph. The upper level game is a discounted game and the lower
level game is an undiscounted reachability game. Two-level games model hierarchical
and sequential decision making under uncertainty across different time scales.
We show the existence of pure memoryless optimal strategies for both players and
an ordered field property for such games. 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 games can be decided in NP intersected coNP. We also give
an alternate strategy improvement algorithm to compute the value. '
alternative_title:
- EPTCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Majumdar R. Discounting in games across time scales. In: Vol
25. EPTCS; 2010:22-29. doi:10.4204/EPTCS.25.6'
apa: 'Chatterjee, K., & Majumdar, R. (2010). Discounting in games across time
scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic,
and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.25.6'
chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across
Time Scales,” 25:22–29. EPTCS, 2010. https://doi.org/10.4204/EPTCS.25.6.
ieee: 'K. Chatterjee and R. Majumdar, “Discounting in games across time scales,”
presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori,
Italy, 2010, vol. 25, pp. 22–29.'
ista: 'Chatterjee K, Majumdar R. 2010. Discounting in games across time scales.
GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.'
mla: Chatterjee, Krishnendu, and Ritankar Majumdar. Discounting in Games across
Time Scales. Vol. 25, EPTCS, 2010, pp. 22–29, doi:10.4204/EPTCS.25.6.
short: K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.
conference:
end_date: 2010-06-18
location: Minori, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2010-06-17
date_created: 2018-12-11T12:05:31Z
date_published: 2010-06-08T00:00:00Z
date_updated: 2023-09-04T11:47:04Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4204/EPTCS.25.6
external_id:
arxiv:
- '1006.1403'
file:
- access_level: open_access
checksum: 2bdf1e9103710555c6251ca4153cb5e9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:19Z
date_updated: 2020-07-14T12:46:17Z
file_id: '4937'
file_name: IST-2016-491-v1+1_1006.1403v1.pdf
file_size: 74598
relation: main_file
file_date_updated: 2020-07-14T12:46:17Z
has_accepted_license: '1'
intvolume: ' 25'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 22 - 29
publication_status: published
publisher: EPTCS
publist_id: '2329'
pubrep_id: '491'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discounting in games across time scales
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2010'
...
---
_id: '3853'
abstract:
- lang: eng
text: 'Quantitative languages are an extension of boolean languages that assign
to each word a real number. Mean-payoff automata are finite automata with numerical
weights on transitions that assign to each infinite path the long-run average
of the transition weights. When the mode of branching of the automaton is deterministic,
nondeterministic, or alternating, the corresponding class of quantitative languages
is not robust as it is not closed under the pointwise operations of max, min,
sum, and numerical complement. Nondeterministic and alternating mean-payoff automata
are not decidable either, as the quantitative generalization of the problems of
universality and language inclusion is undecidable. We introduce a new class of
quantitative languages, defined by mean-payoff automaton expressions, which is
robust and decidable: it is closed under the four pointwise operations, and we
show that all decision problems are decidable for this class. Mean-payoff automaton
expressions subsume deterministic meanpayoff automata, and we show that they have
expressive power incomparable to nondeterministic and alternating mean-payoff
automata. We also present for the first time an algorithm to compute distance
between two quantitative languages, and in our case the quantitative languages
are given as mean-payoff automaton expressions.'
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: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- 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: Philippe
full_name: Rannou, Philippe
last_name: Rannou
citation:
ama: 'Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff
automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2010:269-283. doi:10.1007/978-3-642-15375-4_19'
apa: 'Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou,
P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented
at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger,
and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_19.
ieee: 'K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou,
“Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory,
Paris, France, 2010, vol. 6269, pp. 269–283.'
ista: 'Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff
automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.'
mla: Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol.
6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.
short: K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.
conference:
end_date: 2010-09-03
location: Paris, France
name: 'CONCUR: Concurrency Theory'
start_date: 2010-08-31
date_created: 2018-12-11T12:05:31Z
date_published: 2010-11-18T00:00:00Z
date_updated: 2021-01-12T07:52:40Z
day: '18'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: HeEd
- _id: ToHe
doi: 10.1007/978-3-642-15375-4_19
ec_funded: 1
file:
- access_level: open_access
checksum: 4f753ae99d076553fb8733e2c8b390e2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:41Z
date_updated: 2020-07-14T12:46:17Z
file_id: '5163'
file_name: IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf
file_size: 233260
relation: main_file
file_date_updated: 2020-07-14T12:46:17Z
has_accepted_license: '1'
intvolume: ' 6269'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 269 - 283
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2328'
pubrep_id: '62'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mean-payoff automaton expressions
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6269
year: '2010'
...
---
_id: '3855'
abstract:
- lang: eng
text: 'We study observation-based strategies for partially-observable Markov decision
processes (POMDPs) with parity objectives. An observation-based strategy relies
on partial information about the history of a play, namely, on the past sequence
of observations. We consider qualitative analysis problems: given a POMDP with
a parity objective, decide whether there exists an observation-based strategy
to achieve the objective with probability 1 (almost-sure winning), or with positive
probability (positive winning). Our main results are twofold. First, we present
a complete picture of the computational complexity of the qualitative analysis
problem for POMDPs with parity objectives and its subclasses: safety, reachability,
Büchi, and coBüchi objectives. We establish several upper and lower bounds that
were not known in the literature. Second, we give optimal bounds (matching upper
and lower bounds) for the memory required by pure and randomized observation-based
strategies for each class of 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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable
Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:10.1007/978-3-642-15155-2_24'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis
of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented
at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic:
Springer. https://doi.org/10.1007/978-3-642-15155-2_24'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative
Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer,
2010. https://doi.org/10.1007/978-3-642-15155-2_24.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable
Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of
Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable
Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science,
LNCS, vol. 6281, 258–269.'
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable
Markov Decision Processes. Vol. 6281, Springer, 2010, pp. 258–69, doi:10.1007/978-3-642-15155-2_24.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.
conference:
end_date: 2010-08-27
location: Brno, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2010-08-23
date_created: 2018-12-11T12:05:32Z
date_published: 2010-08-01T00:00:00Z
date_updated: 2023-02-23T12:24:22Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-15155-2_24
ec_funded: 1
file:
- access_level: open_access
checksum: b6c82ec82f194e5b0ab7c1c3800e4580
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:51Z
date_updated: 2020-07-14T12:46:17Z
file_id: '5038'
file_name: IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf
file_size: 173948
relation: main_file
file_date_updated: 2020-07-14T12:46:17Z
has_accepted_license: '1'
intvolume: ' 6281'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 258 - 269
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '2326'
pubrep_id: '61'
quality_controlled: '1'
related_material:
record:
- id: '5395'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Qualitative analysis of partially-observable Markov Decision Processes
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6281
year: '2010'
...
---
_id: '3856'
abstract:
- lang: eng
text: 'We consider two-player zero-sum games on graphs. These games can be classified
on the basis of the information of the players and on the mode of interaction
between them. On the basis of information the classification is as follows: (a)
partial-observation (both players have partial view of the game); (b) one-sided
complete-observation (one player has complete observation); and (c) complete-observation
(both players have complete view of the game). On the basis of mode of interaction
we have the following classification: (a) concurrent (players interact simultaneously);
and (b) turn-based (players interact in turn). The two sources of randomness in
these games are randomness in transition function and randomness in strategies.
In general, randomized strategies are more powerful than deterministic strategies,
and randomness in transitions gives more general classes of games. We present
a complete characterization for the classes of games where randomness is not helpful
in: (a) the transition function (probabilistic transition can be simulated by
deterministic transition); and (b) strategies (pure strategies are as powerful
as randomized strategies). As consequence of our characterization we obtain new
undecidability results for these games. '
acknowledgement: This research was supported by the European Union project COMBEST
and the European Network of Excellence ArtistDesign.
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: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- 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, Gimbert H, Henzinger TA. Randomness for free. In: Vol
6281. Springer; 2010:246-257. doi:10.1007/978-3-642-15155-2_23'
apa: 'Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness
for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations
of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger.
“Randomness for Free,” 6281:246–57. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_23.
ieee: 'K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for
free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno,
Czech Republic, 2010, vol. 6281, pp. 246–257.'
ista: 'Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free.
MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.'
mla: Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer,
2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.
short: K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010,
pp. 246–257.
conference:
end_date: 2010-08-27
location: Brno, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2010-08-23
date_created: 2018-12-11T12:05:32Z
date_published: 2010-09-06T00:00:00Z
date_updated: 2023-02-23T10:12:00Z
day: '06'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-15155-2_23
ec_funded: 1
intvolume: ' 6281'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1006.0673v1
month: '09'
oa: 1
oa_version: Preprint
page: 246 - 257
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '2325'
pubrep_id: '60'
quality_controlled: '1'
related_material:
record:
- id: '1731'
relation: later_version
status: public
scopus_import: 1
status: public
title: Randomness for free
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6281
year: '2010'
...
---
_id: '3858'
abstract:
- lang: eng
text: 'We consider two-player zero-sum games on graphs. On the basis of the information
available to the players these games can be classified as follows: (a) partial-observation
(both players have partial view of the game); (b) one-sided partial-observation
(one player has partial-observation and the other player has complete-observation);
and (c) complete-observation (both players have com- plete view of the game).
We survey the complexity results for the problem of de- ciding the winner in various
classes of partial-observation games with ω-regular winning conditions specified
as parity objectives. We present a reduction from the class of parity objectives
that depend on sequence of states of the game to the sub-class of parity objectives
that only depend on the sequence of observations. We also establish that partial-observation
acyclic games are PSPACE-complete.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. The complexity of partial-observation parity games.
In: Vol 6397. Springer; 2010:1-14. doi:10.1007/978-3-642-16242-8_1'
apa: 'Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation
parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming,
Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation
Parity Games,” 6397:1–14. Springer, 2010. https://doi.org/10.1007/978-3-642-16242-8_1.
ieee: 'K. Chatterjee and L. Doyen, “The complexity of partial-observation parity
games,” presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.'
ista: 'Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity
games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS,
vol. 6397, 1–14.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. The Complexity of Partial-Observation
Parity Games. Vol. 6397, Springer, 2010, pp. 1–14, doi:10.1007/978-3-642-16242-8_1.
short: K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.
conference:
end_date: 2010-10-15
location: Yogyakarta, Indonesia
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2010-10-10
date_created: 2018-12-11T12:05:33Z
date_published: 2010-12-09T00:00:00Z
date_updated: 2021-01-12T07:52:43Z
day: '09'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-642-16242-8_1
file:
- access_level: open_access
checksum: 770e86e5d78c56fddb4786a8da7ef126
content_type: application/pdf
creator: dernst
date_created: 2020-05-19T16:29:04Z
date_updated: 2020-07-14T12:46:18Z
file_id: '7872'
file_name: 2010_LPAR_Chatterjee.pdf
file_size: 142836
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 6397'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 1 - 14
publication_status: published
publisher: Springer
publist_id: '2323'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of partial-observation parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6397
year: '2010'
...
---
_id: '3860'
abstract:
- lang: eng
text: 'In mean-payoff games, the objective of the protagonist is to ensure that
the limit average of an infinite sequence of numeric weights is nonnegative. In
energy games, the objective is to ensure that the running sum of weights is always
nonnegative. Generalized mean-payoff and energy games replace individual weights
by tuples, and the limit average (resp. running sum) of each coordinate must be
(resp. remain) nonnegative. These games have applications in the synthesis of
resource-bounded processes with multiple resources. We prove the finite-memory
determinacy of generalized energy games and show the inter- reducibility of generalized
mean-payoff and energy games for finite-memory strategies. We also improve the
computational complexity for solving both classes of games with finite-memory
strategies: while the previously best known upper bound was EXPSPACE, and no lower
bound was known, we give an optimal coNP-complete bound. For memoryless strategies,
we show that the problem of deciding the existence of a winning strategy for the
protagonist is NP-complete.'
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and
energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516.
doi:10.4230/LIPIcs.FSTTCS.2010.505'
apa: 'Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized
mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, Chennai, India: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin.
“Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505.
ieee: 'K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff
and energy games,” presented at the FSTTCS: Foundations of Software Technology
and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.'
ista: 'Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff
and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer
Science, LIPIcs, vol. 8, 505–516.'
mla: Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games.
Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2010, pp. 505–516.
conference:
end_date: 2010-12-18
location: Chennai, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2010-12-15
date_created: 2018-12-11T12:05:34Z
date_published: 2010-12-13T00:00:00Z
date_updated: 2021-01-12T07:52:44Z
day: '13'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2010.505
file:
- access_level: open_access
checksum: 1caabd6319b979927208117a41192637
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:27Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5147'
file_name: IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf
file_size: 178278
relation: main_file
- access_level: open_access
checksum: 3a59759ceeacdb5b578f3803d5e6769b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:28Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5148'
file_name: IST-2016-59-v2+1_2_1_.pdf
file_size: 477976
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 505 - 516
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2321'
pubrep_id: '59'
quality_controlled: '1'
scopus_import: 1
status: public
title: Generalized mean-payoff and energy games
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2010'
...
---
_id: '3861'
abstract:
- lang: eng
text: We introduce strategy logic, a logic that treats strategies in two-player
games as explicit first-order objects. The explicit treatment of strategies allows
us to specify properties of nonzero-sum games in a simple and natural way. We
show that the one-alternation fragment of strategy logic is strong enough to express
the existence of Nash equilibria and secure equilibria, and subsumes other logics
that were introduced to reason about games, such as ATL, ATL*, and game logic.
We show that strategy logic is decidable, by constructing tree automata that recognize
sets of strategies. While for the general logic, our decision procedure is nonelementary,
for the simple fragment that is used above we show that the complexity is polynomial
in the size of the game graph and optimal in the size of the formula (ranging
from polynomial to 2EXPTIME depending on the form of the formula).
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: Chatterjee K, Henzinger TA, Piterman N. Strategy logic. Information and
Computation. 2010;208(6):677-693. doi:10.1016/j.ic.2009.07.004
apa: Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic.
Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy
Logic.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.07.004.
ieee: K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information
and Computation, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.
ista: Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information
and Computation. 208(6), 677–693.
mla: Chatterjee, Krishnendu, et al. “Strategy Logic.” Information and Computation,
vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.
short: K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208
(2010) 677–693.
date_created: 2018-12-11T12:05:34Z
date_published: 2010-06-01T00:00:00Z
date_updated: 2023-02-23T11:46:57Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2009.07.004
file:
- access_level: open_access
checksum: 13bff93f3c2a014e2908145a4517f177
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:54Z
date_updated: 2020-07-14T12:46:18Z
file_id: '4911'
file_name: IST-2012-56-v1+1_Strategy_logic.pdf
file_size: 189120
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 208'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 677 - 693
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '2317'
pubrep_id: '56'
quality_controlled: '1'
related_material:
record:
- id: '3884'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Strategy logic
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 208
year: '2010'
...
---
_id: '3862'
abstract:
- lang: eng
text: Quantitative generalizations of classical languages, which assign to each
word a real number instead of a Boolean value, have applications in modeling resource-constrained
computation. We use weighted automata (finite automata with transition weights)
to define several natural classes of quantitative languages over finite and infinite
words; in particular, the real value of an infinite run is computed as the maximum,
limsup, liminf, limit average, or discounted sum of the transition weights. We
define the classical decision problems of automata theory (emptiness, universality,
language inclusion, and language equivalence) in the quantitative setting and
study their computational complexity. As the decidability of the language-inclusion
problem remains open for some classes of weighted automata, we introduce a notion
of quantitative simulation that is decidable and implies language inclusion. We
also give a complete characterization of the expressive power of the various classes
of weighted automata. In particular, we show that most classes of weighted automata
cannot be determinized.
article_number: '23'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Chatterjee K, Doyen L, Henzinger TA. Quantitative languages. ACM Transactions
on Computational Logic (TOCL). 2010;11(4). doi:10.1145/1805950.1805953
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Quantitative languages.
ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1805950.1805953
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative
Languages.” ACM Transactions on Computational Logic (TOCL). ACM, 2010.
https://doi.org/10.1145/1805950.1805953.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” ACM
Transactions on Computational Logic (TOCL), vol. 11, no. 4. ACM, 2010.
ista: Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions
on Computational Logic (TOCL). 11(4), 23.
mla: Chatterjee, Krishnendu, et al. “Quantitative Languages.” ACM Transactions
on Computational Logic (TOCL), vol. 11, no. 4, 23, ACM, 2010, doi:10.1145/1805950.1805953.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational
Logic (TOCL) 11 (2010).
date_created: 2018-12-11T12:05:34Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2022-03-21T08:20:03Z
day: '01'
ddc:
- '004'
doi: 10.1145/1805950.1805953
ec_funded: 1
extern: '1'
file:
- access_level: open_access
checksum: f2e50bbd6871fba0aec30bd9625a1ee7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:41Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5230'
file_name: IST-2012-57-v1+1_Quantitative_languages.pdf
file_size: 169136
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '2318'
pubrep_id: '57'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative languages
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2010'
...
---
_id: '3863'
abstract:
- lang: eng
text: 'We consider two-player parity games with imperfect information in which strategies
rely on observations that provide imperfect information about the history of a
play. To solve such games, i.e., to determine the winning regions of players and
corresponding winning strategies, one can use the subset construction to build
an equivalent perfect-information game. Recently, an algorithm that avoids the
inefficient subset construction has been proposed. The algorithm performs a fixed-point
computation in a lattice of antichains, thus maintaining a succinct representation
of state sets. However, this representation does not allow to recover winning
strategies. In this paper, we build on the antichain approach to develop an algorithm
for constructing the winning strategies in parity games of imperfect information.
One major obstacle in adapting the classical procedure is that the complementation
of attractor sets would break the invariant of downward-closedness on which the
antichain representation relies. We overcome this difficulty by decomposing problem
instances recursively into games with a combination of reachability, safety, and
simpler parity conditions. We also report on an experimental implementation of
our algorithm: to our knowledge, this is the first implementation of a procedure
for solving imperfect-information parity games on graphs.'
author:
- first_name: Dietmar
full_name: Berwanger, Dietmar
last_name: Berwanger
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: De Wulf, Martin
last_name: De Wulf
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction
for parity games with imperfect information. Information and Computation.
2010;208(10):1206-1220. doi:10.1016/j.ic.2009.09.006
apa: Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T.
A. (2010). Strategy construction for parity games with imperfect information.
Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.09.006
chicago: Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen,
and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect
Information.” Information and Computation. Elsevier, 2010. https://doi.org/10.1016/j.ic.2009.09.006.
ieee: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy
construction for parity games with imperfect information,” Information and
Computation, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.
ista: Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy
construction for parity games with imperfect information. Information and Computation.
208(10), 1206–1220.
mla: Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect
Information.” Information and Computation, vol. 208, no. 10, Elsevier,
2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.
short: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information
and Computation 208 (2010) 1206–1220.
date_created: 2018-12-11T12:05:35Z
date_published: 2010-10-01T00:00:00Z
date_updated: 2023-02-23T11:46:47Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2009.09.006
ec_funded: 1
file:
- access_level: open_access
checksum: 29d146e4f8049dbb7f80bbf7ea3700ed
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:44Z
date_updated: 2020-07-14T12:46:18Z
file_id: '5300'
file_name: IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf
file_size: 287496
relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: ' 208'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1206 - 1220
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '2319'
pubrep_id: '58'
quality_controlled: '1'
related_material:
record:
- id: '3880'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Strategy construction for parity games with imperfect information
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 208
year: '2010'
...
---
_id: '3864'
abstract:
- lang: eng
text: 'Often one has a preference order among the different systems that satisfy
a given specification. Under a probabilistic assumption about the possible inputs,
such a preference order is naturally expressed by a weighted automaton, which
assigns to each word a value, such that a system is preferred if it generates
a higher expected value. We solve the following optimal-synthesis problem: given
an omega-regular specification, a Markov chain that describes the distribution
of inputs, and a weighted automaton that measures how well a system satisfies
the given specification tinder the given input assumption, synthesize a system
that optimizes the measured value. For safety specifications and measures that
are defined by mean-payoff automata, the optimal-synthesis problem amounts to
finding a strategy in a Markov decision process (MDP) that is optimal for a long-run
average reward objective, which can be done in polynomial time. For general omega-regular
specifications, the solution rests on a new, polynomial-time algorithm for computing
optimal strategies in MDPs with mean-payoff parity objectives. We present some
experimental results showing optimal systems that were automatically generated
in this way.'
acknowledgement: This research was supported by the European Union project COMBEST
and the European Network of Excellence ArtistDesign.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing
systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:10.1007/978-3-642-14295-6_34'
apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring
and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395).
Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom:
Springer. https://doi.org/10.1007/978-3-642-14295-6_34'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit
Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95.
Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_34.
ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and
synthesizing systems in probabilistic environments,” presented at the CAV: Computer
Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing
systems in probabilistic environments. CAV: Computer Aided Verification, LNCS,
vol. 6174, 380–395.'
mla: Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic
Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010,
pp. 380–395.
conference:
end_date: 2010-07-19
location: Edinburgh, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 201-07-15
date_created: 2018-12-11T12:05:35Z
date_published: 2010-07-09T00:00:00Z
date_updated: 2023-02-23T10:17:28Z
day: '09'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_34
intvolume: ' 6174'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1004.0739
month: '07'
oa: 1
oa_version: Preprint
page: 380 - 395
publication_status: published
publisher: Springer
publist_id: '2313'
quality_controlled: '1'
related_material:
record:
- id: '1856'
relation: later_version
status: public
scopus_import: 1
status: public
title: Measuring and synthesizing systems in probabilistic environments
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
_id: '3866'
abstract:
- lang: eng
text: Systems ought to behave reasonably even in circumstances that are not anticipated
in their specifications. We propose a definition of robustness for liveness specifications
which prescribes, for any number of environment assumptions that are violated,
a minimal number of system guarantees that must still be fulfilled. This notion
of robustness can be formulated and realized using a Generalized Reactivity formula.
We present an algorithm for synthesizing robust systems from such formulas. For
the important special case of Generalized Reactivity formulas of rank 1, our algorithm
improves the complexity of [PPS06] for large specifications with a small number
of assumptions and guarantees.
alternative_title:
- LNCS
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Karin
full_name: Greimel, Karin
last_name: Greimel
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
citation:
ama: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in
the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer;
2010:410-424. doi:10.1007/978-3-642-14295-6_36'
apa: 'Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann,
B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &
P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided
Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir
Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. https://doi.org/10.1007/978-3-642-14295-6_36.
ieee: 'R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness
in the presence of liveness,” presented at the CAV: Computer Aided Verification,
Edinburgh, UK, 2010, vol. 6174, pp. 410–424.'
ista: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness
in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174,
410–424.'
mla: Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited
by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.
short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T.
Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.
conference:
end_date: 2010-07-19
location: Edinburgh, UK
name: 'CAV: Computer Aided Verification'
start_date: 2010-07-15
date_created: 2018-12-11T12:05:36Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2021-01-12T07:52:47Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_36
ec_funded: 1
editor:
- first_name: Tayssir
full_name: Touili, Tayssir
last_name: Touili
- first_name: Byron
full_name: Cook, Byron
last_name: Cook
- first_name: Paul
full_name: Jackson, Paul
last_name: Jackson
file:
- access_level: open_access
checksum: 9d204611c8d7855bed8134f8708a0010
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:52Z
date_updated: 2020-07-14T12:46:19Z
file_id: '5243'
file_name: IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf
file_size: 213083
relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: ' 6174'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 410 - 424
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '2310'
pubrep_id: '54'
quality_controlled: '1'
scopus_import: 1
status: public
title: Robustness in the presence of liveness
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
_id: '3867'
abstract:
- lang: eng
text: Weighted automata are nondeterministic automata with numerical weights on
transitions. They can define quantitative languages L that assign to each word
w a real number L(w). In the case of infinite words, the value of a run is naturally
computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the
transition weights. The value of a word w is the supremum of the values of the
runs over w. We study expressiveness and closure questions about these quantitative
languages. We first show that the set of words with value greater than a threshold
can be omega-regular for deterministic limit-average and discounted-sum automata,
while this set is always omega-regular when the threshold is isolated (i.e., some
neighborhood around the threshold contains no word). In the latter case, we prove
that the omega-regular language is robust against small perturbations of the transition
weights. We next consider automata with transition weights 0 or 1 and show that
they are as expressive as general weighted automata in the limit-average case,
but not in the discounted-sum case. Third, for quantitative languages L-1 and
L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which
generalize the boolean operations on languages, as well as the sum L-1 + L-2.
We establish the closure properties of all classes of quantitative languages with
respect to these four operations.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties
for quantitative languages. Logical Methods in Computer Science. 2010;6(3):1-23.
doi:10.2168/LMCS-6(3:10)2010
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Expressiveness and
closure properties for quantitative languages. Logical Methods in Computer
Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-6(3:10)2010
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness
and Closure Properties for Quantitative Languages.” Logical Methods in Computer
Science. International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:10)2010.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure
properties for quantitative languages,” Logical Methods in Computer Science,
vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.
ista: Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties
for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
mla: Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative
Languages.” Logical Methods in Computer Science, vol. 6, no. 3, International
Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science
6 (2010) 1–23.
date_created: 2018-12-11T12:05:36Z
date_published: 2010-08-30T00:00:00Z
date_updated: 2023-02-23T12:15:42Z
day: '30'
ddc:
- '000'
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-6(3:10)2010
ec_funded: 1
file:
- access_level: open_access
checksum: 0243da726476817f2ea33b48b78be696
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:54Z
date_updated: 2020-07-14T12:46:19Z
file_id: '5312'
file_name: IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf
file_size: 216598
relation: main_file
- access_level: open_access
checksum: 5e512b8503a9cb263de26331c4ee9cf2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:55Z
date_updated: 2020-07-14T12:46:19Z
file_id: '5313'
file_name: IST-2016-55-v2+1_1007.4018.pdf
file_size: 302416
relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 1 - 23
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '2311'
pubrep_id: '504'
quality_controlled: '1'
related_material:
record:
- id: '4540'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Expressiveness and closure properties for quantitative languages
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2010'
...
---
_id: '3868'
abstract:
- lang: eng
text: Simulation and bisimulation metrics for stochastic systems provide a quantitative
generalization of the classical simulation and bisimulation relations. These metrics
capture the similarity of states with respect to quantitative specifications written
in the quantitative mu-calculus and related probabilistic logics. We first show
that the metrics provide a bound for the difference in long-run average and discounted
average behavior across states, indicating that the metrics can be used both in
system verification, and in performance evaluation. For turn-based games and MDPs,
we provide a polynomial-time algorithm for the computation of the one-step metric
distance between states. The algorithm is based on linear programming; it improves
on the previous known exponential-time algorithm based on a reduction to the theory
of reals. We then present PSPACE algorithms for both the decision problem and
the problem of approximating the metric distance between two states, matching
the best known algorithms for Markov chains. For the bisimulation kernel of the
metric our algorithm works in time O(n(4)) for both turn-based games and MDPs;
improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For
a concurrent game G, we show that computing the exact distance be tween states
is at least as hard as computing the value of concurrent reachability games and
the square-root-sum problem in computational geometry. We show that checking whether
the metric distance is bounded by a rational r, can be done via a reduction to
the theory of real closed fields, involving a formula with three quantifier alternations,
yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time
complexity, improving the previously known reduction, which yielded O(vertical
bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms
can be iterated to approximate the metrics using binary search
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics.
Logical Methods in Computer Science. 2010;6(3):1-27. doi:10.2168/LMCS-6(3:13)2010
apa: Chatterjee, K., De Alfaro, L., Majumdar, R., & Raman, V. (2010). Algorithms
for game metrics. Logical Methods in Computer Science. International Federation
of Computational Logic. https://doi.org/10.2168/LMCS-6(3:13)2010
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath
Raman. “Algorithms for Game Metrics.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2010. https://doi.org/10.2168/LMCS-6(3:13)2010.
ieee: K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game
metrics,” Logical Methods in Computer Science, vol. 6, no. 3. International
Federation of Computational Logic, pp. 1–27, 2010.
ista: Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game
metrics. Logical Methods in Computer Science. 6(3), 1–27.
mla: Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.” Logical Methods
in Computer Science, vol. 6, no. 3, International Federation of Computational
Logic, 2010, pp. 1–27, doi:10.2168/LMCS-6(3:13)2010.
short: K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer
Science 6 (2010) 1–27.
date_created: 2018-12-11T12:05:36Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2023-02-23T11:30:18Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.2168/LMCS-6(3:13)2010
file:
- access_level: open_access
checksum: a18988135fef3016c93808ecb15b55f5
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:11Z
date_updated: 2020-07-14T12:46:19Z
file_id: '4671'
file_name: IST-2015-370-v1+1_0809.4326.pdf
file_size: 346527
relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1 - 27
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '2312'
pubrep_id: '370'
quality_controlled: '1'
related_material:
record:
- id: '3504'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Algorithms for game metrics
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2010'
...
---
_id: '3901'
abstract:
- lang: eng
text: We are interested in 3-dimensional images given as arrays of voxels with intensity
values. Extending these values to acontinuous function, we study the robustness
of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded
to destroy these classes. The structure of the homology classes and their robustness,
over all level and interlevel sets, can bevisualized by a triangular diagram of
dots obtained by computing the extended persistence of the function. We give a
fast hierarchicalalgorithm using the dual complexes of oct-tree approximations
of the function. In addition, we show that for balanced oct-trees, thedual complexes
are geometrically realized in $R^3$ and can thus be used to construct level and
interlevel sets. We apply these tools tostudy 3-dimensional images of plant root
systems.
author:
- first_name: Paul
full_name: Bendich, Paul
id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
last_name: Bendich
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for
images. IEEE Transactions of Visualization and Computer Graphics. 2010;16(6):1251-1260.
doi:10.1109/TVCG.2010.139
apa: Bendich, P., Edelsbrunner, H., & Kerber, M. (2010). Computing robustness
and persistence for images. IEEE Transactions of Visualization and Computer
Graphics. IEEE. https://doi.org/10.1109/TVCG.2010.139
chicago: Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness
and Persistence for Images.” IEEE Transactions of Visualization and Computer
Graphics. IEEE, 2010. https://doi.org/10.1109/TVCG.2010.139.
ieee: P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence
for images,” IEEE Transactions of Visualization and Computer Graphics,
vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.
ista: Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence
for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
mla: Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” IEEE
Transactions of Visualization and Computer Graphics, vol. 16, no. 6, IEEE,
2010, pp. 1251–60, doi:10.1109/TVCG.2010.139.
short: P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization
and Computer Graphics 16 (2010) 1251–1260.
date_created: 2018-12-11T12:05:47Z
date_published: 2010-10-28T00:00:00Z
date_updated: 2021-01-12T07:53:04Z
day: '28'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1109/TVCG.2010.139
file:
- access_level: open_access
checksum: f6d813c04f4b46023cec6b9a17f15472
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:10Z
date_updated: 2020-07-14T12:46:21Z
file_id: '5262'
file_name: IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf
file_size: 721994
relation: main_file
file_date_updated: 2020-07-14T12:46:21Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '6'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1251 - 1260
publication: IEEE Transactions of Visualization and Computer Graphics
publication_status: published
publisher: IEEE
publist_id: '2253'
pubrep_id: '536'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing robustness and persistence for images
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2010'
...
---
_id: '3904'
abstract:
- lang: eng
text: Social organisms are constantly exposed to infectious agents via physical
contact with conspecifics. While previous work has shown that disease susceptibility
at the individual and group level is influenced by gen- etic diversity within
and between group members, it remains poorly understood how group-level resistance
to pathogens relates directly to individual physiology, defence behaviour and
social interactions. We investigated the effects of high versus low genetic diversity
on both the individual and collective disease defences in the ant Cardiocondyla
obscurior. We compared the antiseptic behaviours (grooming and hygienic behaviour)
of workers from genetically homogeneous and diverse colonies after exposure of
their brood to the entomopathogenic fungus Metarhizium anisopliae. While workers
from diverse colonies performed intensive allogrooming and quickly removed larvae
covered with live fungal spores from the nest, workers from homogeneous colonies
only removed sick larvae late after infection. This difference was not caused
by a reduced repertoire of antiseptic behaviours or a generally decreased brood
care activity in ants from homogeneous colonies. Our data instead suggest that
reduced genetic diversity compromises the ability of Cardiocondyla colonies to
quickly detect or react to the presence of pathogenic fungal spores before an
infection is established, thereby affecting the dynamics of social immunity in
the colony.
author:
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Daniel
full_name: Kronauer, Daniel
last_name: Kronauer
- first_name: Alexandra
full_name: Schrempf, Alexandra
last_name: Schrempf
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Ugelvig LV, Kronauer D, Schrempf A, Heinze J, Cremer S. Rapid anti-pathogen
response in ant societies relies on high genetic diversity. Proceedings of
the Royal Society of London Series B Biological Sciences. 2010;277(1695):2821-2828.
doi:10.1098/rspb.2010.0644
apa: Ugelvig, L. V., Kronauer, D., Schrempf, A., Heinze, J., & Cremer, S. (2010).
Rapid anti-pathogen response in ant societies relies on high genetic diversity.
Proceedings of the Royal Society of London Series B Biological Sciences.
Royal Society, The. https://doi.org/10.1098/rspb.2010.0644
chicago: Ugelvig, Line V, Daniel Kronauer, Alexandra Schrempf, Jürgen Heinze, and
Sylvia Cremer. “Rapid Anti-Pathogen Response in Ant Societies Relies on High Genetic
Diversity.” Proceedings of the Royal Society of London Series B Biological
Sciences. Royal Society, The, 2010. https://doi.org/10.1098/rspb.2010.0644.
ieee: L. V. Ugelvig, D. Kronauer, A. Schrempf, J. Heinze, and S. Cremer, “Rapid
anti-pathogen response in ant societies relies on high genetic diversity,” Proceedings
of the Royal Society of London Series B Biological Sciences, vol. 277, no.
1695. Royal Society, The, pp. 2821–2828, 2010.
ista: Ugelvig LV, Kronauer D, Schrempf A, Heinze J, Cremer S. 2010. Rapid anti-pathogen
response in ant societies relies on high genetic diversity. Proceedings of the
Royal Society of London Series B Biological Sciences. 277(1695), 2821–2828.
mla: Ugelvig, Line V., et al. “Rapid Anti-Pathogen Response in Ant Societies Relies
on High Genetic Diversity.” Proceedings of the Royal Society of London Series
B Biological Sciences, vol. 277, no. 1695, Royal Society, The, 2010, pp. 2821–28,
doi:10.1098/rspb.2010.0644.
short: L.V. Ugelvig, D. Kronauer, A. Schrempf, J. Heinze, S. Cremer, Proceedings
of the Royal Society of London Series B Biological Sciences 277 (2010) 2821–2828.
date_created: 2018-12-11T12:05:48Z
date_published: 2010-05-05T00:00:00Z
date_updated: 2021-01-12T07:53:05Z
day: '05'
doi: 10.1098/rspb.2010.0644
extern: '1'
intvolume: ' 277'
issue: '1695'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2981995/
month: '05'
oa: 1
oa_version: None
page: 2821 - 2828
publication: Proceedings of the Royal Society of London Series B Biological Sciences
publication_status: published
publisher: Royal Society, The
publist_id: '2251'
status: public
title: Rapid anti-pathogen response in ant societies relies on high genetic diversity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 277
year: '2010'
...
---
_id: '3960'
abstract:
- lang: eng
text: When lymphocytes follow chemotactic cues, they can adopt different migratory
modes depending on the geometry and molecular composition of their extracellular
environment. In this issue of The EMBO Journal, Klemke et al (2010) describe a
novel Ras-dependent chemokine receptor signalling pathway that leads to activation
of cofilin, which in turn amplifies actin turnover. This signalling module is
exclusively required for lymphocyte migration in three-dimensional (3D) environments,
but not for locomotion on two-dimensional (2D) surfaces.
author:
- first_name: Michele
full_name: Michele Weber
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Weber M, Sixt MK. MEK signalling tunes actin treadmilling for interstitial
lymphocyte migration. EMBO Journal. 2010;29(17):2861-2863. doi:10.1038/emboj.2010.183
apa: Weber, M., & Sixt, M. K. (2010). MEK signalling tunes actin treadmilling
for interstitial lymphocyte migration. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2010.183
chicago: Weber, Michele, and Michael K Sixt. “MEK Signalling Tunes Actin Treadmilling
for Interstitial Lymphocyte Migration.” EMBO Journal. Wiley-Blackwell,
2010. https://doi.org/10.1038/emboj.2010.183.
ieee: M. Weber and M. K. Sixt, “MEK signalling tunes actin treadmilling for interstitial
lymphocyte migration,” EMBO Journal, vol. 29, no. 17. Wiley-Blackwell,
pp. 2861–2863, 2010.
ista: Weber M, Sixt MK. 2010. MEK signalling tunes actin treadmilling for interstitial
lymphocyte migration. EMBO Journal. 29(17), 2861–2863.
mla: Weber, Michele, and Michael K. Sixt. “MEK Signalling Tunes Actin Treadmilling
for Interstitial Lymphocyte Migration.” EMBO Journal, vol. 29, no. 17,
Wiley-Blackwell, 2010, pp. 2861–63, doi:10.1038/emboj.2010.183.
short: M. Weber, M.K. Sixt, EMBO Journal 29 (2010) 2861–2863.
date_created: 2018-12-11T12:06:07Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2021-01-12T07:53:29Z
day: '01'
doi: 10.1038/emboj.2010.183
extern: 1
intvolume: ' 29'
issue: '17'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/issues/190105/
month: '09'
oa: 1
page: 2861 - 2863
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2167'
quality_controlled: 0
status: public
title: MEK signalling tunes actin treadmilling for interstitial lymphocyte migration
type: journal_article
volume: 29
year: '2010'
...
---
_id: '4157'
abstract:
- lang: eng
text: Integrin- and cadherin-mediated adhesion is central for cell and tissue morphogenesis,
allowing cells and tissues to change shape without loosing integrity. Studies
predominantly in cell culture showed that mechanosensation through adhesion structures
is achieved by force-mediated modulation of their molecular composition. The specific
molecular composition of adhesion sites in turn determines their signalling activity
and dynamic reorganization. Here, we will review how adhesion sites respond to
mecanical stimuli, and how spatially and temporally regulated signalling from
different adhesion sites controls cell migration and tissue morphogenesis.
acknowledged_ssus:
- _id: Bio
author:
- first_name: Ekaterina
full_name: Papusheva, Ekaterina
id: 41DB591E-F248-11E8-B48F-1D18A9856A87
last_name: Papusheva
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Papusheva E, Heisenberg C-PJ. Spatial organization of adhesion: force-dependent
regulation and function in tissue morphogenesis. EMBO Journal. 2010;29(16):2753-2768.
doi:10.1038/emboj.2010.182'
apa: 'Papusheva, E., & Heisenberg, C.-P. J. (2010). Spatial organization of
adhesion: force-dependent regulation and function in tissue morphogenesis. EMBO
Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2010.182'
chicago: 'Papusheva, Ekaterina, and Carl-Philipp J Heisenberg. “Spatial Organization
of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.”
EMBO Journal. Wiley-Blackwell, 2010. https://doi.org/10.1038/emboj.2010.182.'
ieee: 'E. Papusheva and C.-P. J. Heisenberg, “Spatial organization of adhesion:
force-dependent regulation and function in tissue morphogenesis,” EMBO Journal,
vol. 29, no. 16. Wiley-Blackwell, pp. 2753–2768, 2010.'
ista: 'Papusheva E, Heisenberg C-PJ. 2010. Spatial organization of adhesion: force-dependent
regulation and function in tissue morphogenesis. EMBO Journal. 29(16), 2753–2768.'
mla: 'Papusheva, Ekaterina, and Carl-Philipp J. Heisenberg. “Spatial Organization
of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.”
EMBO Journal, vol. 29, no. 16, Wiley-Blackwell, 2010, pp. 2753–68, doi:10.1038/emboj.2010.182.'
short: E. Papusheva, C.-P.J. Heisenberg, EMBO Journal 29 (2010) 2753–2768.
date_created: 2018-12-11T12:07:17Z
date_published: 2010-08-18T00:00:00Z
date_updated: 2021-01-12T07:54:55Z
day: '18'
department:
- _id: Bio
- _id: CaHe
doi: 10.1038/emboj.2010.182
external_id:
pmid:
- '20717145'
intvolume: ' 29'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/
month: '08'
oa: 1
oa_version: Submitted Version
page: 2753 - 2768
pmid: 1
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1962'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Spatial organization of adhesion: force-dependent regulation and function
in tissue morphogenesis'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2010'
...
---
_id: '4243'
abstract:
- lang: eng
text: We investigate a new model for populations evolving in a spatial continuum.
This model can be thought of as a spatial version of the Lambda-Fleming-Viot process.
It explicitly incorporates both small scale reproduction events and large scale
extinction-recolonisation events. The lineages ancestral to a sample from a population
evolving according to this model can be described in terms of a spatial version
of the Lambda-coalescent. Using a technique of Evans (1997), we prove existence
and uniqueness in law for the model. We then investigate the asymptotic behaviour
of the genealogy of a finite number of individuals sampled uniformly at random
(or more generally `far enough apart') from a two-dimensional torus of sidelength
L as L tends to infinity. Under appropriate conditions (and on a suitable timescale)
we can obtain as limiting genealogical processes a Kingman coalescent, a more
general Lambda-coalescent or a system of coalescing Brownian motions (with a non-local
coalescence mechanism).
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- first_name: Amandine
full_name: Véber, Amandine
last_name: Véber
citation:
ama: Barton NH, Etheridge A, Véber A. A new model for evolution in a spatial continuum.
Electronic Journal of Probability. 2010;15(7):162-216. doi:10.1214/EJP.v15-741
apa: Barton, N. H., Etheridge, A., & Véber, A. (2010). A new model for evolution
in a spatial continuum. Electronic Journal of Probability. Institute of
Mathematical Statistics. https://doi.org/10.1214/EJP.v15-741
chicago: Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “A New Model
for Evolution in a Spatial Continuum.” Electronic Journal of Probability.
Institute of Mathematical Statistics, 2010. https://doi.org/10.1214/EJP.v15-741.
ieee: N. H. Barton, A. Etheridge, and A. Véber, “A new model for evolution in a
spatial continuum,” Electronic Journal of Probability, vol. 15, no. 7.
Institute of Mathematical Statistics, pp. 162–216, 2010.
ista: Barton NH, Etheridge A, Véber A. 2010. A new model for evolution in a spatial
continuum. Electronic Journal of Probability. 15(7), 162–216.
mla: Barton, Nicholas H., et al. “A New Model for Evolution in a Spatial Continuum.”
Electronic Journal of Probability, vol. 15, no. 7, Institute of Mathematical
Statistics, 2010, pp. 162–216, doi:10.1214/EJP.v15-741.
short: N.H. Barton, A. Etheridge, A. Véber, Electronic Journal of Probability 15
(2010) 162–216.
date_created: 2018-12-11T12:07:48Z
date_published: 2010-02-03T00:00:00Z
date_updated: 2021-01-12T07:55:34Z
day: '03'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1214/EJP.v15-741
file:
- access_level: open_access
checksum: bab577546dd4e8f882e9a9dd645cd01e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:21Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5140'
file_name: IST-2015-369-v1+1_741-2535-1-PB.pdf
file_size: 450171
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '7'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 162 - 216
publication: Electronic Journal of Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '1863'
pubrep_id: '369'
quality_controlled: '1'
scopus_import: 1
status: public
title: A new model for evolution in a spatial continuum
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2010'
...
---
_id: '4339'
abstract:
- lang: ger
text: Mit diesem Buch möchten wir einen Überblick der aktuellen Diskussion zum Thema
Bibliothek 2.0 geben und den Stand der tatsächlichen Umsetzung der Web 2.0-Ansätze
in deutschsprachigen Bibliotheken beleuchten. An dieser Stelle ist die Frage erlaubt,
warum es zu einer Zeit, in der es bereits die ersten "Web 3.0"- Konferenzen gibt,
eines Handbuches der Bibliothek 2.0 noch bedarf. Und warum es überhaupt ein deutschsprachiges
Handbuch zur Bibliothek 2.0 braucht, wo es doch bereits verschiedenste Publikationen
zu diesem Thema aus anderen Ländern, insbesondere des angloamerikanischen Raums
gibt. Ist dazu nicht bereits alles gesagt?
author:
- first_name: Julia
full_name: Bergmann, Julia
last_name: Bergmann
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
citation:
ama: 'Bergmann J, Danowski P. Ist Bibliothek 2.0 überhaupt noch relevant? – Eine
Einleitung in das Handbuch. In: Bergmann J, Danowski P, eds. Handbuch Bibliothek
2.0. Bibliotheks- und Informationspraxis 41. De Gruyter; 2010:5-20. doi:10.1515/9783110232103'
apa: Bergmann, J., & Danowski, P. (2010). Ist Bibliothek 2.0 überhaupt noch
relevant? – Eine Einleitung in das Handbuch. In J. Bergmann & P. Danowski
(Eds.), Handbuch Bibliothek 2.0 (pp. 5–20). De Gruyter. https://doi.org/10.1515/9783110232103
chicago: Bergmann, Julia, and Patrick Danowski. “Ist Bibliothek 2.0 Überhaupt Noch
Relevant? – Eine Einleitung in Das Handbuch.” In Handbuch Bibliothek 2.0,
edited by Julia Bergmann and Patrick Danowski, 5–20. Bibliotheks- Und Informationspraxis
41. De Gruyter, 2010. https://doi.org/10.1515/9783110232103.
ieee: J. Bergmann and P. Danowski, “Ist Bibliothek 2.0 überhaupt noch relevant?
– Eine Einleitung in das Handbuch,” in Handbuch Bibliothek 2.0, J. Bergmann
and P. Danowski, Eds. De Gruyter, 2010, pp. 5–20.
ista: 'Bergmann J, Danowski P. 2010.Ist Bibliothek 2.0 überhaupt noch relevant?
– Eine Einleitung in das Handbuch. In: Handbuch Bibliothek 2.0. , 5–20.'
mla: Bergmann, Julia, and Patrick Danowski. “Ist Bibliothek 2.0 Überhaupt Noch Relevant?
– Eine Einleitung in Das Handbuch.” Handbuch Bibliothek 2.0, edited by
Julia Bergmann and Patrick Danowski, De Gruyter, 2010, pp. 5–20, doi:10.1515/9783110232103.
short: J. Bergmann, P. Danowski, in:, J. Bergmann, P. Danowski (Eds.), Handbuch
Bibliothek 2.0, De Gruyter, 2010, pp. 5–20.
date_created: 2018-12-11T12:08:21Z
date_published: 2010-09-23T00:00:00Z
date_updated: 2021-01-12T07:56:15Z
day: '23'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.1515/9783110232103
editor:
- first_name: Julia
full_name: Bergmann, Julia
last_name: Bergmann
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
file:
- access_level: open_access
checksum: d42cedd48fffa85d75046f396a309fc3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:06Z
date_updated: 2020-07-14T12:46:27Z
file_id: '5123'
file_name: IST-2012-12-v1+1_9783110232103.5.pdf
file_size: 567580
relation: main_file
file_date_updated: 2020-07-14T12:46:27Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 5 - 20
publication: Handbuch Bibliothek 2.0
publication_status: published
publisher: De Gruyter
publist_id: '1235'
pubrep_id: '12'
quality_controlled: '1'
series_title: Bibliotheks- und Informationspraxis 41
status: public
title: Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch
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: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '4340'
abstract:
- lang: eng
text: "More and more libraries starting semantic web projects. The question about
the license of the data\r\nis not discussed or the discussion is deferred to the
end of project. in this paper is discussed why\r\nthe question of the license
is so important in context of the semantic web that is should be one of the\r\nfirst
aspects in a semantic web project. Also it will be shown why a public domain weaver
is the\r\nonly solution that fulfill the the special requirements of the semantic
web and that guaranties the\r\nreuseablitly of semantic library data for a sustainability
of the projects. "
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
citation:
ama: Danowski P. Open Bibliographic Data. Elsevier; 2010.
apa: Danowski, P. (2010). Open bibliographic data. European Library Automation
Group (ELAG) 2010. Elsevier.
chicago: Danowski, Patrick. Open Bibliographic Data. European Library
Automation Group (ELAG) 2010. Elsevier, 2010.
ieee: P. Danowski, Open bibliographic data. Elsevier, 2010.
ista: Danowski P. 2010. Open bibliographic data, Elsevier,p.
mla: Danowski, Patrick. “Open Bibliographic Data.” European Library Automation
Group (ELAG) 2010, Elsevier, 2010.
short: P. Danowski, Open Bibliographic Data, Elsevier, 2010.
conference:
name: 'ELAG: European Library Automation Group'
date_created: 2018-12-11T12:08:21Z
date_published: 2010-06-10T00:00:00Z
date_updated: 2020-07-14T23:07:19Z
day: '10'
ddc:
- '020'
extern: '1'
file:
- access_level: open_access
checksum: 7061756135333d73b26a84526fa654f5
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:01Z
date_updated: 2020-07-14T12:46:27Z
file_id: '5118'
file_name: IST-2012-51-v1+1_149-danowski-en.pdf
file_size: 94982
relation: main_file
file_date_updated: 2020-07-14T12:46:27Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.slideshare.net/PatrickD/open-bibliographic-data-elag2010
month: '06'
oa: 1
oa_version: None
publication: European Library Automation Group (ELAG) 2010
publication_status: published
publisher: Elsevier
publist_id: '1234'
status: public
title: Open bibliographic data
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: other_academic_publication
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...