---
_id: '4385'
abstract:
- lang: eng
text: "Transactional memories are typically speculative and rely on contention managers
to cure conflicts. This paper explores a complementary approach that prevents
conflicts by scheduling transactions according to predictions on their access
sets.\r\nWe first explore the theoretical boundaries of this approach and prove
that (1) a TM scheduler with an accurate prediction can be 2-competitive with
an optimal offline TM scheduler, but (2) even a slight inaccuracy in prediction
makes the competitive ratio of the TM scheduler in the order of the number of
transactions.\r\nWe then show that, in practice, there is room for a pragmatic
approach with good average case performance. We present Shrink, a scheduler that
(1) bases its prediction of transactional accesses on the access patterns of the
past transactions from the same thread, and (2) uses a novel heuristic, which
we call serialization affinity, to schedule transactions with a probability proportional
to the current amount of contention. Shrink obtains roughly 70% accurate read
and write access predictions on STMBench7 and STAMP. In our experimental evaluation,
Shrink significantly improves STM performance in cases the number of executing
threads is higher than the number of available CPU cores. For SwissTM, Shrink
improves the performance by up to 55% on STMBench7, and up to 120% on STAMP. For
TinySTM, Shrink drastically improves the performance on STMBench7 and STAMP benchmarks."
article_processing_charge: No
author:
- first_name: Aleksandar
full_name: Dragojevic, Aleksandar
last_name: Dragojevic
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Anmol
full_name: Singh, Anmol
last_name: Singh
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Dragojevic A, Guerraoui R, Singh A, Singh V. Preventing versus curing: Avoiding
conflicts in transactional memories. In: Proceedings of the 28th ACM Symposium
on Principles of Distributed Computing. ACM; 2009:7-16. doi:10.1145/1582716.1582725'
apa: 'Dragojevic, A., Guerraoui, R., Singh, A., & Singh, V. (2009). Preventing
versus curing: Avoiding conflicts in transactional memories. In Proceedings
of the 28th ACM symposium on Principles of distributed computing (pp. 7–16).
Calgary, Canada: ACM. https://doi.org/10.1145/1582716.1582725'
chicago: 'Dragojevic, Aleksandar, Rachid Guerraoui, Anmol Singh, and Vasu Singh.
“Preventing versus Curing: Avoiding Conflicts in Transactional Memories.” In Proceedings
of the 28th ACM Symposium on Principles of Distributed Computing, 7–16. ACM,
2009. https://doi.org/10.1145/1582716.1582725.'
ieee: 'A. Dragojevic, R. Guerraoui, A. Singh, and V. Singh, “Preventing versus curing:
Avoiding conflicts in transactional memories,” in Proceedings of the 28th ACM
symposium on Principles of distributed computing, Calgary, Canada, 2009, pp.
7–16.'
ista: 'Dragojevic A, Guerraoui R, Singh A, Singh V. 2009. Preventing versus curing:
Avoiding conflicts in transactional memories. Proceedings of the 28th ACM symposium
on Principles of distributed computing. POPL: Principles of Programming Languages,
7–16.'
mla: 'Dragojevic, Aleksandar, et al. “Preventing versus Curing: Avoiding Conflicts
in Transactional Memories.” Proceedings of the 28th ACM Symposium on Principles
of Distributed Computing, ACM, 2009, pp. 7–16, doi:10.1145/1582716.1582725.'
short: A. Dragojevic, R. Guerraoui, A. Singh, V. Singh, in:, Proceedings of the
28th ACM Symposium on Principles of Distributed Computing, ACM, 2009, pp. 7–16.
conference:
end_date: 2009-08-12
location: Calgary, Canada
name: 'POPL: Principles of Programming Languages'
start_date: 2009-08-10
date_created: 2018-12-11T12:08:35Z
date_published: 2009-08-10T00:00:00Z
date_updated: 2025-07-02T06:35:49Z
day: '10'
doi: 10.1145/1582716.1582725
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 7 - 16
publication: Proceedings of the 28th ACM symposium on Principles of distributed computing
publication_status: published
publisher: ACM
publist_id: '1070'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Preventing versus curing: Avoiding conflicts in transactional memories'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '4391'
abstract:
- lang: eng
text: We address the problem of analyzing programs such as J2ME midlets for mobile
devices, where a central correctness requirement concerns confidentiality of data
that the user wants to keep secret. Existing software model checking tools analyze
individual program executions, and are not applicable to checking confidentiality
properties that require reasoning about equivalence among executions. We develop
an automated analysis technique for such properties. We show that both over- and
under- approximation is needed for sound analysis. Given a program and a confidentiality
requirement, our technique produces a formula that is satisfiable if the requirement
holds. We evaluate the approach by analyzing bytecode of a set of Java (J2ME)
methods.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
citation:
ama: 'Cerny P, Alur R. Automated analysis of Java methods for confidentiality. In:
21st International Conference on Computer Aided Verification. Vol 5643.
Springer; 2009:173-187. doi:10.1007/978-3-642-02658-4_16'
apa: Cerny, P., & Alur, R. (2009). Automated analysis of Java methods for confidentiality.
In 21st International Conference on Computer Aided Verification (Vol. 5643,
pp. 173–187). Springer. https://doi.org/10.1007/978-3-642-02658-4_16
chicago: Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for
Confidentiality.” In 21st International Conference on Computer Aided Verification,
5643:173–87. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_16.
ieee: P. Cerny and R. Alur, “Automated analysis of Java methods for confidentiality,”
in 21st International Conference on Computer Aided Verification, 2009,
vol. 5643, pp. 173–187.
ista: 'Cerny P, Alur R. 2009. Automated analysis of Java methods for confidentiality.
21st International Conference on Computer Aided Verification. CAV: Computer Aided
Verification, LNCS, vol. 5643, 173–187.'
mla: Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality.”
21st International Conference on Computer Aided Verification, vol. 5643,
Springer, 2009, pp. 173–87, doi:10.1007/978-3-642-02658-4_16.
short: P. Cerny, R. Alur, in:, 21st International Conference on Computer Aided Verification,
Springer, 2009, pp. 173–187.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2018-12-11T12:08:36Z
date_published: 2009-07-01T00:00:00Z
date_updated: 2025-07-02T06:32:32Z
day: '01'
doi: 10.1007/978-3-642-02658-4_16
extern: '1'
intvolume: ' 5643'
language:
- iso: eng
month: '07'
oa_version: None
page: 173 - 187
publication: 21st International Conference on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '1067'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Automated analysis of Java methods for confidentiality
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5643
year: '2009'
...
---
_id: '4403'
abstract:
- lang: eng
text: For programs whose data variables range over boolean or finite domains, program
verification is decidable, and this forms the basis of recent tools for software
model checking. In this paper, we consider algorithmic verification of programs
that use boolean variables, and in addition, access a single read-only array whose
length is potentially unbounded, and whose elements range over a potentially unbounded
data domain. We show that the reachability problem, while undecidable in general,
is (1) Pspace-complete for programs in which the array-accessing for-loops are
not nested, (2) decidable for a restricted class of programs with doubly-nested
loops. The second result establishes connections to automata and logics defining
languages over data words.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Scott
full_name: Weinstein, Scott
last_name: Weinstein
citation:
ama: 'Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs.
In: Vol 5771. Springer; 2009:86-101. doi:10.1007/978-3-642-04027-6_9'
apa: 'Alur, R., Cerny, P., & Weinstein, S. (2009). Algorithmic analysis of array-accessing
programs (Vol. 5771, pp. 86–101). Presented at the CSL: Computer Science Logic,
Coimbra, Portugal: Springer. https://doi.org/10.1007/978-3-642-04027-6_9'
chicago: Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of
Array-Accessing Programs,” 5771:86–101. Springer, 2009. https://doi.org/10.1007/978-3-642-04027-6_9.
ieee: 'R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing
programs,” presented at the CSL: Computer Science Logic, Coimbra, Portugal, 2009,
vol. 5771, pp. 86–101.'
ista: 'Alur R, Cerny P, Weinstein S. 2009. Algorithmic analysis of array-accessing
programs. CSL: Computer Science Logic, LNCS, vol. 5771, 86–101.'
mla: Alur, Rajeev, et al. Algorithmic Analysis of Array-Accessing Programs.
Vol. 5771, Springer, 2009, pp. 86–101, doi:10.1007/978-3-642-04027-6_9.
short: R. Alur, P. Cerny, S. Weinstein, in:, Springer, 2009, pp. 86–101.
conference:
end_date: 2009-09-11
location: Coimbra, Portugal
name: 'CSL: Computer Science Logic'
start_date: 2009-09-07
date_created: 2018-12-11T12:08:40Z
date_published: 2009-09-01T00:00:00Z
date_updated: 2025-09-30T08:04:32Z
day: '01'
doi: 10.1007/978-3-642-04027-6_9
extern: '1'
intvolume: ' 5771'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://repository.upenn.edu/cis_reports/894/
month: '09'
oa: 1
oa_version: Submitted Version
page: 86 - 101
publication_status: published
publisher: Springer
publist_id: '1056'
quality_controlled: '1'
related_material:
record:
- id: '2967'
relation: later_version
status: public
status: public
title: Algorithmic analysis of array-accessing programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5771
year: '2009'
...
---
_id: '4453'
abstract:
- lang: eng
text: We present an on-the-fly abstraction technique for infinite-state continuous
-time Markov chains. We consider Markov chains that are specified by a finite
set of transition classes. Such models naturally represent biochemical reactions
and therefore play an important role in the stochastic modeling of biological
systems. We approximate the transient probability distributions at various time
instances by solving a sequence of dynamically constructed abstract models, each
depending on the previous one. Each abstract model is a finite Markov chain that
represents the behavior of the original, infinite chain during a specific time
interval. Our approach provides complete information about probability distributions,
not just about individual parameters like the mean. The error of each abstraction
can be computed, and the precision of the abstraction refined when desired. We
implemented the algorithm and demonstrate its usefulness and efficiency on several
case studies from systems biology.
acknowledgement: The research has been partially funded by the Swiss National Science
Foundation under grant 205321-111840.
alternative_title:
- LNCS
author:
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Maria
full_name: Maria Mateescu
id: 3B43276C-F248-11E8-B48F-1D18A9856A87
last_name: Mateescu
- first_name: Verena
full_name: Wolf, Verena
last_name: Wolf
citation:
ama: 'Henzinger TA, Mateescu M, Wolf V. Sliding-window abstraction for infinite
Markov chains. In: Vol 5643. Springer; 2009:337-352. doi:10.1007/978-3-642-02658-4_27'
apa: 'Henzinger, T. A., Mateescu, M., & Wolf, V. (2009). Sliding-window abstraction
for infinite Markov chains (Vol. 5643, pp. 337–352). Presented at the CAV: Computer
Aided Verification, Springer. https://doi.org/10.1007/978-3-642-02658-4_27'
chicago: Henzinger, Thomas A, Maria Mateescu, and Verena Wolf. “Sliding-Window Abstraction
for Infinite Markov Chains,” 5643:337–52. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_27.
ieee: 'T. A. Henzinger, M. Mateescu, and V. Wolf, “Sliding-window abstraction for
infinite Markov chains,” presented at the CAV: Computer Aided Verification, 2009,
vol. 5643, pp. 337–352.'
ista: 'Henzinger TA, Mateescu M, Wolf V. 2009. Sliding-window abstraction for infinite
Markov chains. CAV: Computer Aided Verification, LNCS, vol. 5643, 337–352.'
mla: Henzinger, Thomas A., et al. Sliding-Window Abstraction for Infinite Markov
Chains. Vol. 5643, Springer, 2009, pp. 337–52, doi:10.1007/978-3-642-02658-4_27.
short: T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 337–352.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2018-12-11T12:08:55Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T07:57:04Z
day: '01'
doi: 10.1007/978-3-642-02658-4_27
extern: 1
file:
- access_level: open_access
checksum: 36b974111521ea534aae294166e93a63
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:20Z
date_updated: 2020-07-14T12:46:30Z
file_id: '4938'
file_name: IST-2012-40-v1+1_Sliding-window_abstraction_for_infinite_markov_chains.pdf
file_size: 804295
relation: main_file
file_date_updated: 2020-07-14T12:46:30Z
intvolume: ' 5643'
main_file_link:
- open_access: '0'
url: http://pub.ist.ac.at/%7Etah/Publications/sliding-window_abstraction_for_infinite_markov_chains.pdf
month: '01'
oa: 1
page: 337 - 352
publication_status: published
publisher: Springer
publist_id: '278'
pubrep_id: '40'
quality_controlled: 0
status: public
title: Sliding-window abstraction for infinite Markov chains
type: conference
volume: 5643
year: '2009'
...
---
_id: '4535'
abstract:
- lang: eng
text: |-
Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete -state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive.
We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required.
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under grant 205321-111840 and by the Excellence Cluster on Multimodal
Computing and Interaction.
alternative_title:
- LNCS
author:
- first_name: Frédéric
full_name: Didier, Frédéric
last_name: Didier
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Maria
full_name: Maria Mateescu
id: 3B43276C-F248-11E8-B48F-1D18A9856A87
last_name: Mateescu
- first_name: Verena
full_name: Wolf, Verena
last_name: Wolf
citation:
ama: 'Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities
in noisy cellular processes. In: Vol 5688. Springer; 2009:173-188. doi:10.1007/978-3-642-03845-7_12'
apa: 'Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2009). Approximation
of event probabilities in noisy cellular processes (Vol. 5688, pp. 173–188). Presented
at the CMSB: Computational Methods in Systems Biology, Springer. https://doi.org/10.1007/978-3-642-03845-7_12'
chicago: Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf.
“Approximation of Event Probabilities in Noisy Cellular Processes,” 5688:173–88.
Springer, 2009. https://doi.org/10.1007/978-3-642-03845-7_12.
ieee: 'F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event
probabilities in noisy cellular processes,” presented at the CMSB: Computational
Methods in Systems Biology, 2009, vol. 5688, pp. 173–188.'
ista: 'Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Approximation of event
probabilities in noisy cellular processes. CMSB: Computational Methods in Systems
Biology, LNCS, vol. 5688, 173–188.'
mla: Didier, Frédéric, et al. Approximation of Event Probabilities in Noisy Cellular
Processes. Vol. 5688, Springer, 2009, pp. 173–88, doi:10.1007/978-3-642-03845-7_12.
short: F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp.
173–188.
conference:
name: 'CMSB: Computational Methods in Systems Biology'
date_created: 2018-12-11T12:09:21Z
date_published: 2009-08-17T00:00:00Z
date_updated: 2025-09-30T09:03:30Z
day: '17'
doi: 10.1007/978-3-642-03845-7_12
extern: 1
intvolume: ' 5688'
month: '08'
page: 173 - 188
publication_status: published
publisher: Springer
publist_id: '189'
quality_controlled: 0
related_material:
record:
- id: '3364'
relation: later_version
status: public
status: public
title: Approximation of event probabilities in noisy cellular processes
type: conference
volume: 5688
year: '2009'
...
---
_id: '4540'
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. 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 non-w-regular for deterministic limit-average and discounted-sum
automata, while this set is always w-regular when the threshold is isolated (i.e.,
some neighborhood around the threshold contains no word). In the latter case,
we prove that the w-regular language is robust against small perturbations of
the transition weights. We next consider automata with transition weights 0 or
1 and show that they are as expressive as general weighted automata in the limit-average
case, but not in the discounted-sum case. Third, for quantitative languages L-1
and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1-L-1, which
generalize the boolean operations on languages, as well as the sum L-1 + L-2.
We establish the closure properties of all classes of quantitative languages with
respect to these four operations.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties
for quantitative languages. In: IEEE; 2009:199-208. doi:10.1109/LICS.2009.16'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Expressiveness and
closure properties for quantitative languages (pp. 199–208). Presented at the
LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.2009.16'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness
and Closure Properties for Quantitative Languages,” 199–208. IEEE, 2009. https://doi.org/10.1109/LICS.2009.16.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure
properties for quantitative languages,” presented at the LICS: Logic in Computer
Science, 2009, pp. 199–208.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties
for quantitative languages. LICS: Logic in Computer Science, 199–208.'
mla: Chatterjee, Krishnendu, et al. Expressiveness and Closure Properties for
Quantitative Languages. IEEE, 2009, pp. 199–208, doi:10.1109/LICS.2009.16.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208.
conference:
name: 'LICS: Logic in Computer Science'
date_created: 2018-12-11T12:09:23Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2025-09-30T09:30:59Z
day: '01'
doi: 10.1109/LICS.2009.16
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 199 - 208
publication_status: published
publisher: IEEE
publist_id: '181'
pubrep_id: '55'
quality_controlled: '1'
related_material:
record:
- id: '3867'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Expressiveness and closure properties for quantitative languages
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '4542'
abstract:
- lang: eng
text: "Weighted automata are finite automata with numerical weights on transitions.
Nondeterministic weighted automata define quantitative languages L that assign
to each word w a real number L(w) computed as the maximal value of all runs over
w, and the value of a run r is a function of the sequence of weights that appear
along r. There are several natural functions to consider such as Sup, LimSup,
LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce
alternating weighted automata in which the transitions of the runs are chosen
by two players in a turn-based fashion. Each word is assigned the maximal value
of a run that the first player can enforce regardless of the choices made by the
second player. We survey the results about closure properties, expressiveness,
and decision problems for nondeterministic weighted automata, and we extend these
results to alternating weighted automata.\r\nFor quantitative languages L 1 and
L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1,
and the sum L 1 + L 2. We establish the closure properties of all classes of alternating
weighted automata with respect to these four operations.\r\nWe next compare the
expressive power of the various classes of alternating and nondeterministic weighted
automata over infinite words. In particular, for limit average and discounted
sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally,
we present decidability results and open questions for the quantitative extension
of the classical decision problems in automata theory: emptiness, universality,
language inclusion, and language equivalence."
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest,
Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal
Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol
5699. Springer; 2009:3-13. doi:10.1007/978-3-642-03409-1_2'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted
automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation
Theory, Wroclaw, Poland: Springer. https://doi.org/10.1007/978-3-642-03409-1_2'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating
Weighted Automata,” 5699:3–13. Springer, 2009. https://doi.org/10.1007/978-3-642-03409-1_2.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,”
presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009,
vol. 5699, pp. 3–13.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata.
FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.'
mla: Chatterjee, Krishnendu, et al. Alternating Weighted Automata. Vol. 5699,
Springer, 2009, pp. 3–13, doi:10.1007/978-3-642-03409-1_2.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.
conference:
end_date: 2009-09-04
location: Wroclaw, Poland
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2009-09-02
corr_author: '1'
date_created: 2018-12-11T12:09:23Z
date_published: 2009-09-10T00:00:00Z
date_updated: 2024-10-09T20:53:55Z
day: '10'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1007/978-3-642-03409-1_2
ec_funded: 1
file:
- access_level: open_access
checksum: e8f53abb63579de3f2bff58b2a1188e2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:09Z
date_updated: 2020-07-14T12:46:31Z
file_id: '5126'
file_name: IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf
file_size: 164428
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 5699'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 3 - 13
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '180'
pubrep_id: '39'
quality_controlled: '1'
scopus_import: 1
status: public
title: Alternating weighted automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5699
year: '2009'
...
---
_id: '4543'
abstract:
- lang: eng
text: The synthesis of a reactive system with respect to all omega-regular specification
requires the solution of a graph game. Such games have been extended in two natural
ways. First, a game graph can be equipped with probabilistic choices between alternative
transitions, thus allowing the, modeling of uncertain behaviour. These are called
stochastic games. Second, a liveness specification can he strengthened to require
satisfaction within all unknown but bounded amount of time. These are called finitary
objectives. We study. for the first time, the, combination of Stochastic games
and finitary objectives. We characterize the requirements on optimal strategies
and provide algorithms for Computing the maximal achievable probability of winning
stochastic games with finitary parity or Street, objectives. Most notably the
set of state's from which a player can win with probability . for a finitary parity
objective can he computed in polynomial time even though no polynomial-time algorithm
is known in the nonfinitary case.
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), and by the European project
Combest.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: 'Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives.
In: Vol 5734. Springer; 2009:34-54. doi:10.1007/978-3-642-03816-7_4'
apa: 'Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games
with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical
Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic
Games with Finitary Objectives,” 5734:34–54. Springer, 2009. https://doi.org/10.1007/978-3-642-03816-7_4.
ieee: 'K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary
objectives,” presented at the MFCS: Mathematical Foundations of Computer Science,
High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.'
ista: 'Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary
objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734,
34–54.'
mla: Chatterjee, Krishnendu, et al. Stochastic Games with Finitary Objectives.
Vol. 5734, Springer, 2009, pp. 34–54, doi:10.1007/978-3-642-03816-7_4.
short: K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.
conference:
end_date: 2009-08-28
location: High Tatras, Slovakia
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2009-08-24
corr_author: '1'
date_created: 2018-12-11T12:09:24Z
date_published: 2009-08-01T00:00:00Z
date_updated: 2024-10-09T20:53:54Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-03816-7_4
ec_funded: 1
intvolume: ' 5734'
language:
- iso: eng
month: '08'
oa_version: None
page: 34 - 54
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '178'
quality_controlled: '1'
scopus_import: 1
status: public
title: Stochastic games with finitary objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5734
year: '2009'
...
---
_id: '4544'
abstract:
- lang: eng
text: We consider concurrent games played on graphs. At every round of a game, each
player simultaneously and independently selects a move; the moves jointly determine
the transition to a successor state. Two basic objectives are the safety objective
to stay forever in a given set of states, and its dual, the reachability objective
to reach a given set of states. We present in this paper a strategy improvement
algorithm for computing the value of a concurrent safety game, that is, the maximal
probability with which player 1 can enforce the safety objective. The algorithm
yields a sequence of player-1 strategies which ensure probabilities of winning
that converge monotonically to the value of the safety game. Our result is significant
because the strategy improvement algorithm provides, for the first time, a way
to approximate the value of a concurrent safety game from below. Since a value
iteration algorithm, or a strategy improvement algorithm for reachability games,
can be used to approximate the same value from above, the combination of both
algorithms yields a method for computing a converging sequence of upper and lower
bounds for the values of concurrent reachability and safety games. Previous methods
could approximate the values of these games only from one direction, and as no
rates of convergence are known, they did not provide a practical way to solve
these games.
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: de Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, De Alfaro L, Henzinger TA. Termination criteria for solving
concurrent safety and reachability games. In: SIAM; 2009:197-206. doi:10.1137/1.9781611973068.23'
apa: 'Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2009). Termination
criteria for solving concurrent safety and reachability games (pp. 197–206). Presented
at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/1.9781611973068.23'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Termination
Criteria for Solving Concurrent Safety and Reachability Games,” 197–206. SIAM,
2009. https://doi.org/10.1137/1.9781611973068.23.
ieee: 'K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Termination criteria for
solving concurrent safety and reachability games,” presented at the SODA: Symposium
on Discrete Algorithms, 2009, pp. 197–206.'
ista: 'Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving
concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms,
197–206.'
mla: Chatterjee, Krishnendu, et al. Termination Criteria for Solving Concurrent
Safety and Reachability Games. SIAM, 2009, pp. 197–206, doi:10.1137/1.9781611973068.23.
short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2009, pp. 197–206.
conference:
name: 'SODA: Symposium on Discrete Algorithms'
date_created: 2018-12-11T12:09:24Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T07:59:35Z
day: '01'
doi: 10.1137/1.9781611973068.23
extern: 1
file:
- access_level: open_access
checksum: ce7dc1667502e26b23c07a767ac41ae6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:03Z
date_updated: 2020-07-14T12:46:31Z
file_id: '4662'
file_name: IST-2012-37-v1+1_Termination_criteria_for_solving_concurrent_safety_and_reachability_games.pdf
file_size: 212369
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
main_file_link:
- open_access: '1'
url: https://repository.ist.ac.at/id/eprint/37
month: '01'
oa: 1
page: 197 - 206
publication_status: published
publisher: SIAM
publist_id: '176'
pubrep_id: '37'
quality_controlled: 0
status: public
title: Termination criteria for solving concurrent safety and reachability games
type: conference
year: '2009'
...
---
_id: '4545'
abstract:
- lang: eng
text: 'A stochastic game is a two-player game played oil a graph, where in each
state the successor is chosen either by One of the players, or according to a
probability distribution. We Survey Stochastic games with limsup and liminf objectives.
A real-valued re-ward is assigned to each state, and the value of all infinite
path is the limsup (resp. liminf) of all rewards along the path. The value of
a stochastic game is the maximal expected value of an infinite path that call
he achieved by resolving the decisions of the first player. We present the complexity
of computing values of Stochastic games and their subclasses, and the complexity,
of optimal strategies in such games. '
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), by the European projects
COMBEST, Quasimodo, Gasics, by the PAI program Moves funded by the Belgian Federal
Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup
and liminf objectives. In: Vol 5556. Springer; 2009:1-15. doi:10.1007/978-3-642-02930-1_1'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). A survey of stochastic
games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the
ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. https://doi.org/10.1007/978-3-642-02930-1_1'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey
of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009.
https://doi.org/10.1007/978-3-642-02930-1_1.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games
with limsup and liminf objectives,” presented at the ICALP: Automata, Languages
and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with
limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS,
vol. 5556, 1–15.'
mla: Chatterjee, Krishnendu, et al. A Survey of Stochastic Games with Limsup
and Liminf Objectives. Vol. 5556, Springer, 2009, pp. 1–15, doi:10.1007/978-3-642-02930-1_1.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.
conference:
end_date: 2009-07-12
location: Rhodos, Greece
name: 'ICALP: Automata, Languages and Programming'
start_date: 2009-07-05
corr_author: '1'
date_created: 2018-12-11T12:09:24Z
date_published: 2009-06-24T00:00:00Z
date_updated: 2024-10-09T20:53:54Z
day: '24'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.1007/978-3-642-02930-1_1
ec_funded: 1
file:
- access_level: open_access
checksum: dabb6d24428a000254c95493d9c492e6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:11Z
date_updated: 2020-07-14T12:46:31Z
file_id: '4992'
file_name: IST-2012-38-v1+1_A_survey_of_stochastic_games_with_limsup_and_liminf_objectives.pdf
file_size: 187419
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 5556'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 1 - 15
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '177'
pubrep_id: '38'
quality_controlled: '1'
scopus_import: 1
status: public
title: A survey of stochastic games with limsup and liminf objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5556
year: '2009'
...
---
_id: '4569'
abstract:
- lang: eng
text: "Most specification languages express only qualitative constraints. However,
among two implementations that satisfy a given specification, one may be preferred
to another. For example, if a specification asks that every request is followed
by a response, one may prefer an implementation that generates responses quickly
but does not generate unnecessary responses. We use quantitative properties to
measure the “goodness” of an implementation. Using games with corresponding quantitative
objectives, we can synthesize “optimal” implementations, which are preferred among
the set of possible implementations that satisfy a given specification.\r\nIn
particular, we show how automata with lexicographic mean-payoff conditions can
be used to express many interesting quantitative properties for reactive systems.
In this framework, the synthesis of optimal implementations requires the solution
of lexicographic mean-payoff games (for safety requirements), and the solution
of games with both lexicographic mean-payoff and parity objectives (for liveness
requirements). We present algorithms for solving both kinds of novel graph games."
acknowledgement: This research was supported by the Swiss National Science Foundation
(Indo-Swiss Research Program and NCCR MICS) and the European Union projects COMBEST
and COCONUT.
alternative_title:
- LNCS
arxiv: 1
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: 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, Henzinger TA, Jobstmann B. Better quality in synthesis
through quantitative objectives. In: Vol 5643. Springer; 2009:140-156. doi:10.1007/978-3-642-02658-4_14'
apa: 'Bloem, R., Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2009). Better
quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156).
Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer.
https://doi.org/10.1007/978-3-642-02658-4_14'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara
Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,” 5643:140–56.
Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_14.
ieee: 'R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality
in synthesis through quantitative objectives,” presented at the CAV: Computer
Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156.'
ista: 'Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in
synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS,
vol. 5643, 140–156.'
mla: Bloem, Roderick, et al. Better Quality in Synthesis through Quantitative
Objectives. Vol. 5643, Springer, 2009, pp. 140–56, doi:10.1007/978-3-642-02658-4_14.
short: R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009,
pp. 140–156.
conference:
end_date: 2009-07-02
location: Grenoble, France
name: 'CAV: Computer Aided Verification'
start_date: 2009-06-26
date_created: 2018-12-11T12:09:31Z
date_published: 2009-06-19T00:00:00Z
date_updated: 2024-10-21T06:03:07Z
day: '19'
department:
- _id: KrCh
doi: 10.1007/978-3-642-02658-4_14
ec_funded: 1
external_id:
arxiv:
- '0904.2638'
intvolume: ' 5643'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0904.2638
month: '06'
oa: 1
oa_version: Preprint
page: 140 - 156
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '141'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Better quality in synthesis through quantitative objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5643
year: '2009'
...
---
_id: '4580'
abstract:
- lang: eng
text: Alpaga is a solver for two-player parity games with imperfect information.
Given the description of a game, it determines whether the first player can ensure
to win and, if so, it constructs a winning strategy. The tool provides a symbolic
implementation of a recent algorithm based on antichains.
alternative_title:
- LNCS
author:
- first_name: Dietmar
full_name: Berwanger, Dietmar
last_name: Berwanger
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
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: Thomas Henzinger
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. Alpaga: A tool
for solving parity games with imperfect information. In: Vol 5505. Springer; 2009:58-61.
doi:10.1007/978-3-642-00768-2_7'
apa: 'Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T.
A. (2009). Alpaga: A tool for solving parity games with imperfect information
(Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, Springer. https://doi.org/10.1007/978-3-642-00768-2_7'
chicago: 'Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen,
and Thomas A Henzinger. “Alpaga: A Tool for Solving Parity Games with Imperfect
Information,” 5505:58–61. Springer, 2009. https://doi.org/10.1007/978-3-642-00768-2_7.'
ieee: 'D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Alpaga:
A tool for solving parity games with imperfect information,” presented at the
TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2009,
vol. 5505, pp. 58–61.'
ista: 'Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2009. Alpaga:
A tool for solving parity games with imperfect information. TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, LNCS, vol. 5505, 58–61.'
mla: 'Berwanger, Dietmar, et al. Alpaga: A Tool for Solving Parity Games with
Imperfect Information. Vol. 5505, Springer, 2009, pp. 58–61, doi:10.1007/978-3-642-00768-2_7.'
short: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, in:, Springer,
2009, pp. 58–61.
conference:
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
date_created: 2018-12-11T12:09:35Z
date_published: 2009-03-09T00:00:00Z
date_updated: 2021-01-12T07:59:52Z
day: '09'
doi: 10.1007/978-3-642-00768-2_7
extern: 1
file:
- access_level: open_access
checksum: d52b55a10a47b3e3b0e016ea9bf85c41
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:45Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5168'
file_name: IST-2012-35-v1+1_Alpaga_-_A_tool_for_solving_parity_games_with_imperfect_information.pdf
file_size: 212180
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
intvolume: ' 5505'
main_file_link:
- open_access: '1'
url: https://repository.ist.ac.at/35/
month: '03'
oa: 1
page: 58 - 61
publication_status: published
publisher: Springer
publist_id: '127'
pubrep_id: '35'
quality_controlled: 0
status: public
title: 'Alpaga: A tool for solving parity games with imperfect information'
type: conference
volume: 5505
year: '2009'
...
---
_id: '5392'
abstract:
- lang: eng
text: We consider probabilistic automata on infinite words with acceptance defined
by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider
quantitative and qualitative decision problems. We present extensions and adaptations
of proofs of [GO09] and present a precise characterization of the decidability
and undecidability frontier of the quantitative and qualitative decision problems.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Chatterjee K. Probabilistic Automata on Infinite Words: Decidability and
Undecidability Results. IST Austria; 2009. doi:10.15479/AT:IST-2009-0004'
apa: 'Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability
and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004'
chicago: 'Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability
and Undecidability Results. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0004.'
ieee: 'K. Chatterjee, Probabilistic automata on infinite words: Decidability
and undecidability results. IST Austria, 2009.'
ista: 'Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability
and undecidability results, IST Austria, 17p.'
mla: 'Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability
and Undecidability Results. IST Austria, 2009, doi:10.15479/AT:IST-2009-0004.'
short: 'K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and
Undecidability Results, IST Austria, 2009.'
corr_author: '1'
date_created: 2018-12-12T11:39:04Z
date_published: 2009-11-02T00:00:00Z
date_updated: 2025-04-14T13:37:25Z
day: '02'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2009-0004
file:
- access_level: open_access
checksum: fb7563150231325b00b1718d956f687b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:08Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5530'
file_name: IST-2009-0004_IST-2009-0004.pdf
file_size: 311065
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '28'
related_material:
record:
- id: '3857'
relation: later_version
status: public
status: public
title: 'Probabilistic automata on infinite words: Decidability and undecidability
results'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '5393'
abstract:
- lang: eng
text: Gist is a tool that (a) solves the qualitative analysis problem of turn-based
probabilistic games with ω-regular objectives; and (b) synthesizes reasonable
environment assumptions for synthesis of unrealizable specifications. Our tool
provides efficient implementations of several reduction based techniques to solve
turn-based probabilistic games, and uses the analysis of turn-based probabilistic
games for synthesizing environment assumptions for unrealizable specifications.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. Gist: A Solver
for Probabilistic Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0003'
apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Radhakrishna, A. (2009).
Gist: A solver for probabilistic games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0003'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun
Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009.
https://doi.org/10.15479/AT:IST-2009-0003.'
ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist:
A solver for probabilistic games. IST Austria, 2009.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver
for probabilistic games, IST Austria, 12p.'
mla: 'Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games.
IST Austria, 2009, doi:10.15479/AT:IST-2009-0003.'
short: 'K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver
for Probabilistic Games, IST Austria, 2009.'
corr_author: '1'
date_created: 2018-12-12T11:39:05Z
date_published: 2009-10-09T00:00:00Z
date_updated: 2025-04-14T13:37:27Z
day: '09'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2009-0003
file:
- access_level: open_access
checksum: 49551ac552915b17593a14c993845274
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:58Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5459'
file_name: IST-2009-0003_IST-2009-0003.pdf
file_size: 386866
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '12'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '29'
related_material:
record:
- id: '4388'
relation: later_version
status: public
status: public
title: 'Gist: A solver for probabilistic games'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '5394'
abstract:
- lang: eng
text: We consider two-player games played on graphs with request-response and finitary
Streett objectives. We show these games are PSPACE-hard, improving the previous
known NP-hardness. We also improve the lower bounds on memory required by the
winning strategies for the players.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: Chatterjee K, Henzinger TA, Horn F. Improved Lower Bounds for Request-Response
and Finitary Streett Games. IST Austria; 2009. doi:10.15479/AT:IST-2009-0002
apa: Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Improved lower
bounds for request-response and finitary Streett games. IST Austria. https://doi.org/10.15479/AT:IST-2009-0002
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved
Lower Bounds for Request-Response and Finitary Streett Games. IST Austria,
2009. https://doi.org/10.15479/AT:IST-2009-0002.
ieee: K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for
request-response and finitary Streett games. IST Austria, 2009.
ista: Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response
and finitary Streett games, IST Austria, 11p.
mla: Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response
and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.
short: K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response
and Finitary Streett Games, IST Austria, 2009.
corr_author: '1'
date_created: 2018-12-12T11:39:05Z
date_published: 2009-09-09T00:00:00Z
date_updated: 2024-10-09T21:08:23Z
day: '09'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2009-0002
file:
- access_level: open_access
checksum: 1c50a9723fbae1b2c46d18138968efb3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:50Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5511'
file_name: IST-2009-0002_IST-2009-0002.pdf
file_size: 238091
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '11'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '30'
status: public
title: Improved lower bounds for request-response and finitary Streett games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '5395'
abstract:
- lang: eng
text: 'We study observation-based strategies for partially-observable Markov decision
processes (POMDPs) with omega-regular objectives. An observation-based strategy
relies on partial information about the history of a play, namely, on the past
sequence of observa- tions. We consider the qualitative analysis problem: given
a POMDP with an omega-regular objective, whether there is an observation-based
strategy to achieve the objective with probability 1 (almost-sure winning), or
with positive probability (positive winning). Our main results are twofold. First,
we present a complete picture of the computational complexity of the qualitative
analysis of POMDPs with parity objectives (a canonical form to express omega-regular
objectives) and its subclasses. Our contribution consists in establishing several
upper and lower bounds that were not known in literature. Second, we present optimal
bounds (matching upper and lower bounds) on the memory required by pure and randomized
observation-based strategies for the qualitative analysis of POMDPs with parity
objectives and its subclasses.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Chatterjee K, Doyen L, Henzinger TA. Qualitative Analysis of Partially-Observable
Markov Decision Processes. IST Austria; 2009. doi:10.15479/AT:IST-2009-0001
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis
of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative
Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009.
https://doi.org/10.15479/AT:IST-2009-0001.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable
Markov decision processes. IST Austria, 2009.
ista: Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable
Markov decision processes, IST Austria, 20p.
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable
Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable
Markov Decision Processes, IST Austria, 2009.
corr_author: '1'
date_created: 2018-12-12T11:39:05Z
date_published: 2009-09-09T00:00:00Z
date_updated: 2025-04-14T13:37:25Z
day: '09'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2009-0001
file:
- access_level: open_access
checksum: 04d9cc065cc19598a4e8631c47f1a562
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:25Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5486'
file_name: IST-2009-0001_IST-2009-0001.pdf
file_size: 342088
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '31'
related_material:
record:
- id: '3855'
relation: later_version
status: public
status: public
title: Qualitative analysis of partially-observable Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '599'
abstract:
- lang: eng
text: The human CDK8 subcomplex (CDK8, cyclin C, Med12, and Med13) negatively regulates
transcription in ways not completely defined; past studies suggested CDK8 kinase
activity was required for its repressive function. Using a reconstituted transcription
system together with recombinant or endogenous CDK8 subcomplexes, we demonstrate
that, in fact, Med12 and Med13 are critical for subcomplex-dependent repression,
whereas CDK8 kinase activity is not. A hallmark of activated transcription is
efficient reinitiation from promoter-bound scaffold complexes that recruit a series
of pol II enzymes to the gene. Notably, the CDK8 submodule strongly represses
even reinitiation events, suggesting a means to fine tune transcript levels. Structural
and biochemical studies confirm the CDK8 submodule binds the Mediator leg/tail
domain via the Med13 subunit, and this submodule-Mediator association precludes
pol II recruitment. Collectively, these results reveal the CDK8 subcomplex functions
as a simple switch that controls the Mediator-pol II interaction to help regulate
transcription initiation and reinitiation events. As Mediator is generally required
for expression of protein-coding genes, this may reflect a common mechanism by
which activated transcription is shut down in human cells.
article_processing_charge: No
author:
- first_name: Matthew
full_name: Knuesel, Matthew
last_name: Knuesel
- first_name: Krista
full_name: Meyer, Krista
last_name: Meyer
- first_name: Carrie A
full_name: Bernecky, Carrie A
id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87
last_name: Bernecky
orcid: 0000-0003-0893-7036
- first_name: Dylan
full_name: Taatjes, Dylan
last_name: Taatjes
citation:
ama: Knuesel M, Meyer K, Bernecky C, Taatjes D. The human CDK8 subcomplex is a molecular
switch that controls Mediator coactivator function. Genes and Development.
2009;23(4):439-451. doi:10.1101/gad.1767009
apa: Knuesel, M., Meyer, K., Bernecky, C., & Taatjes, D. (2009). The human CDK8
subcomplex is a molecular switch that controls Mediator coactivator function.
Genes and Development. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/gad.1767009
chicago: Knuesel, Matthew, Krista Meyer, Carrie Bernecky, and Dylan Taatjes. “The
Human CDK8 Subcomplex Is a Molecular Switch That Controls Mediator Coactivator
Function.” Genes and Development. Cold Spring Harbor Laboratory Press,
2009. https://doi.org/10.1101/gad.1767009.
ieee: M. Knuesel, K. Meyer, C. Bernecky, and D. Taatjes, “The human CDK8 subcomplex
is a molecular switch that controls Mediator coactivator function,” Genes and
Development, vol. 23, no. 4. Cold Spring Harbor Laboratory Press, pp. 439–451,
2009.
ista: Knuesel M, Meyer K, Bernecky C, Taatjes D. 2009. The human CDK8 subcomplex
is a molecular switch that controls Mediator coactivator function. Genes and Development.
23(4), 439–451.
mla: Knuesel, Matthew, et al. “The Human CDK8 Subcomplex Is a Molecular Switch That
Controls Mediator Coactivator Function.” Genes and Development, vol. 23,
no. 4, Cold Spring Harbor Laboratory Press, 2009, pp. 439–51, doi:10.1101/gad.1767009.
short: M. Knuesel, K. Meyer, C. Bernecky, D. Taatjes, Genes and Development 23 (2009)
439–451.
date_created: 2018-12-11T11:47:25Z
date_published: 2009-02-15T00:00:00Z
date_updated: 2021-01-12T08:05:32Z
day: '15'
doi: 10.1101/gad.1767009
extern: '1'
intvolume: ' 23'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648653/
month: '02'
oa: 1
oa_version: None
page: 439 - 451
publication: Genes and Development
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
publist_id: '7211'
status: public
title: The human CDK8 subcomplex is a molecular switch that controls Mediator coactivator
function
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2009'
...
---
_id: '6144'
abstract:
- lang: eng
text: Behaviours evolve by iterations of natural selection, but we have few insights
into the molecular and neural mechanisms involved. Here we show that some Caenorhabditis
elegans wild strains switch between two foraging behaviours in response to subtle
changes in ambient oxygen. This finely tuned switch is conferred by a naturally
variable hexacoordinated globin, GLB-5. GLB-5 acts with the atypical soluble guanylate
cyclases1,2,3, which are a different type of oxygen binding protein, to tune the
dynamic range of oxygen-sensing neurons close to atmospheric (21%) concentrations.
Calcium imaging indicates that one group of these neurons is activated when oxygen
rises towards 21%, and is inhibited as oxygen drops below 21%. The soluble guanylate
cyclase GCY-35 is required for high oxygen to activate the neurons; GLB-5 provides
inhibitory input when oxygen decreases below 21%. Together, these oxygen binding
proteins tune neuronal and behavioural responses to a narrow oxygen concentration
range close to atmospheric levels. The effect of the glb-5 gene on oxygen sensing
and foraging is modified by the naturally variable neuropeptide receptor npr-1
(refs 4, 5), providing insights into how polygenic variation reshapes neural circuit
function.
author:
- first_name: Annelie
full_name: Persson, Annelie
last_name: Persson
- first_name: Einav
full_name: Gross, Einav
last_name: Gross
- first_name: Patrick
full_name: Laurent, Patrick
last_name: Laurent
- first_name: Karl Emanuel
full_name: Busch, Karl Emanuel
last_name: Busch
- first_name: Hugo
full_name: Bretes, Hugo
last_name: Bretes
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Persson A, Gross E, Laurent P, Busch KE, Bretes H, de Bono M. Natural variation
in a neural globin tunes oxygen sensing in wild Caenorhabditis elegans. Nature.
2009;458(7241):1030-1033. doi:10.1038/nature07820
apa: Persson, A., Gross, E., Laurent, P., Busch, K. E., Bretes, H., & de Bono,
M. (2009). Natural variation in a neural globin tunes oxygen sensing in wild Caenorhabditis
elegans. Nature. Springer Nature. https://doi.org/10.1038/nature07820
chicago: Persson, Annelie, Einav Gross, Patrick Laurent, Karl Emanuel Busch, Hugo
Bretes, and Mario de Bono. “Natural Variation in a Neural Globin Tunes Oxygen
Sensing in Wild Caenorhabditis Elegans.” Nature. Springer Nature, 2009.
https://doi.org/10.1038/nature07820.
ieee: A. Persson, E. Gross, P. Laurent, K. E. Busch, H. Bretes, and M. de Bono,
“Natural variation in a neural globin tunes oxygen sensing in wild Caenorhabditis
elegans,” Nature, vol. 458, no. 7241. Springer Nature, pp. 1030–1033, 2009.
ista: Persson A, Gross E, Laurent P, Busch KE, Bretes H, de Bono M. 2009. Natural
variation in a neural globin tunes oxygen sensing in wild Caenorhabditis elegans.
Nature. 458(7241), 1030–1033.
mla: Persson, Annelie, et al. “Natural Variation in a Neural Globin Tunes Oxygen
Sensing in Wild Caenorhabditis Elegans.” Nature, vol. 458, no. 7241, Springer
Nature, 2009, pp. 1030–33, doi:10.1038/nature07820.
short: A. Persson, E. Gross, P. Laurent, K.E. Busch, H. Bretes, M. de Bono, Nature
458 (2009) 1030–1033.
date_created: 2019-03-21T07:48:44Z
date_published: 2009-04-23T00:00:00Z
date_updated: 2021-01-12T08:06:20Z
day: '23'
doi: 10.1038/nature07820
extern: '1'
external_id:
pmid:
- '19262507'
intvolume: ' 458'
issue: '7241'
language:
- iso: eng
month: '04'
oa_version: None
page: 1030-1033
pmid: 1
publication: Nature
publication_identifier:
issn:
- 0028-0836
- 1476-4687
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Natural variation in a neural globin tunes oxygen sensing in wild Caenorhabditis
elegans
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 458
year: '2009'
...
---
_id: '6145'
author:
- first_name: Merav
full_name: Cohen, Merav
last_name: Cohen
- first_name: Vincenzina
full_name: Reale, Vincenzina
last_name: Reale
- first_name: Birgitta
full_name: Olofsson, Birgitta
last_name: Olofsson
- first_name: Andrew
full_name: Knights, Andrew
last_name: Knights
- first_name: Peter
full_name: Evans, Peter
last_name: Evans
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Cohen M, Reale V, Olofsson B, Knights A, Evans P, de Bono M. Coordinated regulation
of foraging and metabolism in C. elegans by RFamide neuropeptide signaling. Cell
Metabolism. 2009;9(4):375-385. doi:10.1016/j.cmet.2009.02.003
apa: Cohen, M., Reale, V., Olofsson, B., Knights, A., Evans, P., & de Bono,
M. (2009). Coordinated regulation of foraging and metabolism in C. elegans by
RFamide neuropeptide signaling. Cell Metabolism. Elsevier. https://doi.org/10.1016/j.cmet.2009.02.003
chicago: Cohen, Merav, Vincenzina Reale, Birgitta Olofsson, Andrew Knights, Peter
Evans, and Mario de Bono. “Coordinated Regulation of Foraging and Metabolism in
C. Elegans by RFamide Neuropeptide Signaling.” Cell Metabolism. Elsevier,
2009. https://doi.org/10.1016/j.cmet.2009.02.003.
ieee: M. Cohen, V. Reale, B. Olofsson, A. Knights, P. Evans, and M. de Bono, “Coordinated
regulation of foraging and metabolism in C. elegans by RFamide neuropeptide signaling,”
Cell Metabolism, vol. 9, no. 4. Elsevier, pp. 375–385, 2009.
ista: Cohen M, Reale V, Olofsson B, Knights A, Evans P, de Bono M. 2009. Coordinated
regulation of foraging and metabolism in C. elegans by RFamide neuropeptide signaling.
Cell Metabolism. 9(4), 375–385.
mla: Cohen, Merav, et al. “Coordinated Regulation of Foraging and Metabolism in
C. Elegans by RFamide Neuropeptide Signaling.” Cell Metabolism, vol. 9,
no. 4, Elsevier, 2009, pp. 375–85, doi:10.1016/j.cmet.2009.02.003.
short: M. Cohen, V. Reale, B. Olofsson, A. Knights, P. Evans, M. de Bono, Cell Metabolism
9 (2009) 375–385.
date_created: 2019-03-21T07:57:52Z
date_published: 2009-04-08T00:00:00Z
date_updated: 2021-01-12T08:06:20Z
day: '08'
doi: 10.1016/j.cmet.2009.02.003
extern: '1'
external_id:
pmid:
- '19356718'
intvolume: ' 9'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 375-385
pmid: 1
publication: Cell Metabolism
publication_identifier:
issn:
- 1550-4131
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Coordinated regulation of foraging and metabolism in C. elegans by RFamide
neuropeptide signaling
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2009'
...
---
_id: '1983'
abstract:
- lang: eng
text: 'During many cellular processes such as cell division, polarization and motility,
the plasma membrane does not only represent a passive physical barrier, but also
provides a highly dynamic platform for the interplay between lipids, membrane
binding proteins and cytoskeletal elements. Even though many regulators of these
interactions are known, their mutual interdependence appears to be highly complex
and difficult to study in a living cell. Over the past few years, in vitro studies
on membrane-cytoskeleton interactions using biomimetic membranes turned out to
be extremely helpful to get better mechanistic insight into the dynamics of these
processes. In this review, we discuss some of the recent developments using in
vitro assays to dissect the role of the players involved: lipids in the membrane,
proteins binding to membranes and proteins binding to membrane proteins. We also
summarize advantages and disadvantages of supported lipid bilayers as model membrane.'
author:
- first_name: Martin
full_name: Martin Loose
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Petra
full_name: 'Schwille, Petra '
last_name: Schwille
citation:
ama: Loose M, Schwille P. Biomimetic membrane systems to study cellular organization.
Journal of Structural Biology. 2009;168(1):143-151. doi:10.1016/j.jsb.2009.03.016
apa: Loose, M., & Schwille, P. (2009). Biomimetic membrane systems to study
cellular organization. Journal of Structural Biology. Academic Press. https://doi.org/10.1016/j.jsb.2009.03.016
chicago: Loose, Martin, and Petra Schwille. “Biomimetic Membrane Systems to Study
Cellular Organization.” Journal of Structural Biology. Academic Press,
2009. https://doi.org/10.1016/j.jsb.2009.03.016.
ieee: M. Loose and P. Schwille, “Biomimetic membrane systems to study cellular organization,”
Journal of Structural Biology, vol. 168, no. 1. Academic Press, pp. 143–151,
2009.
ista: Loose M, Schwille P. 2009. Biomimetic membrane systems to study cellular organization.
Journal of Structural Biology. 168(1), 143–151.
mla: Loose, Martin, and Petra Schwille. “Biomimetic Membrane Systems to Study Cellular
Organization.” Journal of Structural Biology, vol. 168, no. 1, Academic
Press, 2009, pp. 143–51, doi:10.1016/j.jsb.2009.03.016.
short: M. Loose, P. Schwille, Journal of Structural Biology 168 (2009) 143–151.
date_created: 2018-12-11T11:55:03Z
date_published: 2009-10-01T00:00:00Z
date_updated: 2021-01-12T06:54:30Z
day: '01'
doi: 10.1016/j.jsb.2009.03.016
extern: 1
intvolume: ' 168'
issue: '1'
month: '10'
page: 143 - 151
publication: Journal of Structural Biology
publication_status: published
publisher: Academic Press
publist_id: '5099'
quality_controlled: 0
status: public
title: Biomimetic membrane systems to study cellular organization
type: journal_article
volume: 168
year: '2009'
...