---
_id: '509'
abstract:
- lang: eng
text: 'Clathrin-mediated endocytosis (CME) regulates many aspects of plant development,
including hormone signaling and responses to environmental stresses. Despite the
importance of this process, the machinery that regulates CME in plants is largely
unknown. In mammals, the heterotetrameric ADAPTOR PROTEIN COMPLEX-2 (AP-2) is
required for the formation of clathrin-coated vesicles at the plasma membrane
(PM). Although the existence of AP-2 has been predicted in Arabidopsis thaliana,
the biochemistry and functionality of the complex is still uncharacterized. Here,
we identified all the subunits of the Arabidopsis AP-2 by tandem affinity purification
and found that one of the large AP-2 subunits, AP2A1, localized at the PM and
interacted with clathrin. Furthermore, endocytosis of the leucine-rich repeat
receptor kinase, BRASSINOSTEROID INSENSITIVE1 (BRI1), was shown to depend on AP-2.
Knockdown of the two Arabidopsis AP2A genes or overexpression of a dominant-negative
version of the medium AP-2 subunit, AP2M, impaired BRI1 endocytosis and enhanced
the brassinosteroid signaling. Our data reveal that the CME machinery in Arabidopsis
is evolutionarily conserved and that AP-2 functions in receptormediated endocytosis. '
author:
- first_name: Simone
full_name: Di Rubbo, Simone
last_name: Di Rubbo
- first_name: Niloufer
full_name: Irani, Niloufer
last_name: Irani
- first_name: Soo
full_name: Kim, Soo
last_name: Kim
- first_name: Zheng
full_name: Xu, Zheng
last_name: Xu
- first_name: Astrid
full_name: Gadeyne, Astrid
last_name: Gadeyne
- first_name: Wim
full_name: Dejonghe, Wim
last_name: Dejonghe
- first_name: Isabelle
full_name: Vanhoutte, Isabelle
last_name: Vanhoutte
- first_name: Geert
full_name: Persiau, Geert
last_name: Persiau
- first_name: Dominique
full_name: Eeckhout, Dominique
last_name: Eeckhout
- first_name: Sibu
full_name: Simon, Sibu
id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
last_name: Simon
orcid: 0000-0002-1998-6741
- first_name: Kyungyoung
full_name: Song, Kyungyoung
last_name: Song
- first_name: Jürgen
full_name: Kleine Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Geert
full_name: De Jaeger, Geert
last_name: De Jaeger
- first_name: Daniël
full_name: Van Damme, Daniël
last_name: Van Damme
- first_name: Inhwan
full_name: Hwang, Inhwan
last_name: Hwang
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
citation:
ama: Di Rubbo S, Irani N, Kim S, et al. The clathrin adaptor complex AP-2 mediates
endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis. Plant Cell.
2013;25(8):2986-2997. doi:10.1105/tpc.113.114058
apa: Di Rubbo, S., Irani, N., Kim, S., Xu, Z., Gadeyne, A., Dejonghe, W., … Russinova,
E. (2013). The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid
INSENSITIVE1 in arabidopsis. Plant Cell. American Society of Plant Biologists.
https://doi.org/10.1105/tpc.113.114058
chicago: Di Rubbo, Simone, Niloufer Irani, Soo Kim, Zheng Xu, Astrid Gadeyne, Wim
Dejonghe, Isabelle Vanhoutte, et al. “The Clathrin Adaptor Complex AP-2 Mediates
Endocytosis of Brassinosteroid INSENSITIVE1 in Arabidopsis.” Plant Cell.
American Society of Plant Biologists, 2013. https://doi.org/10.1105/tpc.113.114058.
ieee: S. Di Rubbo et al., “The clathrin adaptor complex AP-2 mediates endocytosis
of brassinosteroid INSENSITIVE1 in arabidopsis,” Plant Cell, vol. 25, no.
8. American Society of Plant Biologists, pp. 2986–2997, 2013.
ista: Di Rubbo S, Irani N, Kim S, Xu Z, Gadeyne A, Dejonghe W, Vanhoutte I, Persiau
G, Eeckhout D, Simon S, Song K, Kleine Vehn J, Friml J, De Jaeger G, Van Damme
D, Hwang I, Russinova E. 2013. The clathrin adaptor complex AP-2 mediates endocytosis
of brassinosteroid INSENSITIVE1 in arabidopsis. Plant Cell. 25(8), 2986–2997.
mla: Di Rubbo, Simone, et al. “The Clathrin Adaptor Complex AP-2 Mediates Endocytosis
of Brassinosteroid INSENSITIVE1 in Arabidopsis.” Plant Cell, vol. 25, no.
8, American Society of Plant Biologists, 2013, pp. 2986–97, doi:10.1105/tpc.113.114058.
short: S. Di Rubbo, N. Irani, S. Kim, Z. Xu, A. Gadeyne, W. Dejonghe, I. Vanhoutte,
G. Persiau, D. Eeckhout, S. Simon, K. Song, J. Kleine Vehn, J. Friml, G. De Jaeger,
D. Van Damme, I. Hwang, E. Russinova, Plant Cell 25 (2013) 2986–2997.
date_created: 2018-12-11T11:46:52Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2021-01-12T08:01:13Z
day: '01'
department:
- _id: JiFr
doi: 10.1105/tpc.113.114058
external_id:
pmid:
- '23975899'
intvolume: ' 25'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3784593/
month: '08'
oa: 1
oa_version: Submitted Version
page: 2986 - 2997
pmid: 1
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '7311'
quality_controlled: '1'
scopus_import: 1
status: public
title: The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1
in arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '511'
abstract:
- lang: eng
text: The native auxin, indole-3-acetic acid (IAA), is a major regulator of plant
growth and development. Its nonuniform distribution between cells and tissues
underlies the spatiotemporal coordination of many developmental events and responses
to environmental stimuli. The regulation of auxin gradients and the formation
of auxin maxima/minima most likely involve the regulation of both metabolic and
transport processes. In this article, we have demonstrated that 2-oxindole-3-acetic
acid (oxIAA) is a major primary IAA catabolite formed in Arabidopsis thaliana
root tissues. OxIAA had little biological activity and was formed rapidly and
irreversibly in response to increases in auxin levels. We further showed that
there is cell type-specific regulation of oxIAA levels in the Arabidopsis root
apex. We propose that oxIAA is an important element in the regulation of output
from auxin gradients and, therefore, in the regulation of auxin homeostasis and
response mechanisms.
author:
- first_name: Aleš
full_name: Pěnčík, Aleš
last_name: Pěnčík
- first_name: Biljana
full_name: Simonovik, Biljana
last_name: Simonovik
- first_name: Sara
full_name: Petersson, Sara
last_name: Petersson
- first_name: Eva
full_name: Henyková, Eva
last_name: Henyková
- first_name: Sibu
full_name: Simon, Sibu
id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
last_name: Simon
orcid: 0000-0002-1998-6741
- first_name: Kathleen
full_name: Greenham, Kathleen
last_name: Greenham
- first_name: Yi
full_name: Zhang, Yi
last_name: Zhang
- first_name: Mariusz
full_name: Kowalczyk, Mariusz
last_name: Kowalczyk
- first_name: Mark
full_name: Estelle, Mark
last_name: Estelle
- first_name: Eva
full_name: Zažímalová, Eva
last_name: Zažímalová
- first_name: Ondřej
full_name: Novák, Ondřej
last_name: Novák
- first_name: Göran
full_name: Sandberg, Göran
last_name: Sandberg
- first_name: Karin
full_name: Ljung, Karin
last_name: Ljung
citation:
ama: Pěnčík A, Simonovik B, Petersson S, et al. Regulation of auxin homeostasis
and gradients in Arabidopsis roots through the formation of the indole-3-acetic
acid catabolite 2-oxindole-3-acetic acid. Plant Cell. 2013;25(10):3858-3870.
doi:10.1105/tpc.113.114421
apa: Pěnčík, A., Simonovik, B., Petersson, S., Henyková, E., Simon, S., Greenham,
K., … Ljung, K. (2013). Regulation of auxin homeostasis and gradients in Arabidopsis
roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic
acid. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.113.114421
chicago: Pěnčík, Aleš, Biljana Simonovik, Sara Petersson, Eva Henyková, Sibu Simon,
Kathleen Greenham, Yi Zhang, et al. “Regulation of Auxin Homeostasis and Gradients
in Arabidopsis Roots through the Formation of the Indole-3-Acetic Acid Catabolite
2-Oxindole-3-Acetic Acid.” Plant Cell. American Society of Plant Biologists,
2013. https://doi.org/10.1105/tpc.113.114421.
ieee: A. Pěnčík et al., “Regulation of auxin homeostasis and gradients in
Arabidopsis roots through the formation of the indole-3-acetic acid catabolite
2-oxindole-3-acetic acid,” Plant Cell, vol. 25, no. 10. American Society
of Plant Biologists, pp. 3858–3870, 2013.
ista: Pěnčík A, Simonovik B, Petersson S, Henyková E, Simon S, Greenham K, Zhang
Y, Kowalczyk M, Estelle M, Zažímalová E, Novák O, Sandberg G, Ljung K. 2013. Regulation
of auxin homeostasis and gradients in Arabidopsis roots through the formation
of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid. Plant Cell. 25(10),
3858–3870.
mla: Pěnčík, Aleš, et al. “Regulation of Auxin Homeostasis and Gradients in Arabidopsis
Roots through the Formation of the Indole-3-Acetic Acid Catabolite 2-Oxindole-3-Acetic
Acid.” Plant Cell, vol. 25, no. 10, American Society of Plant Biologists,
2013, pp. 3858–70, doi:10.1105/tpc.113.114421.
short: A. Pěnčík, B. Simonovik, S. Petersson, E. Henyková, S. Simon, K. Greenham,
Y. Zhang, M. Kowalczyk, M. Estelle, E. Zažímalová, O. Novák, G. Sandberg, K. Ljung,
Plant Cell 25 (2013) 3858–3870.
date_created: 2018-12-11T11:46:53Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2021-01-12T08:01:15Z
day: '01'
department:
- _id: JiFr
doi: 10.1105/tpc.113.114421
external_id:
pmid:
- '24163311'
intvolume: ' 25'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.doi.org/10.1105/tpc.113.114421
month: '10'
oa: 1
oa_version: Published Version
page: 3858 - 3870
pmid: 1
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '7309'
quality_controlled: '1'
scopus_import: 1
status: public
title: Regulation of auxin homeostasis and gradients in Arabidopsis roots through
the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '516'
abstract:
- lang: eng
text: In plants, changes in local auxin concentrations can trigger a range of developmental
processes as distinct tissues respond differently to the same auxin stimulus.
However, little is known about how auxin is interpreted by individual cell types.
We performed a transcriptomic analysis of responses to auxin within four distinct
tissues of the Arabidopsis thaliana root and demonstrate that different cell types
show competence for discrete responses. The majority of auxin‐responsive genes
displayed a spatial bias in their induction or repression. The novel data set
was used to examine how auxin influences tissue‐specific transcriptional regulation
of cell‐identity markers. Additionally, the data were used in combination with
spatial expression maps of the root to plot a transcriptomic auxin‐response gradient
across the apical and basal meristem. The readout revealed a strong correlation
for thousands of genes between the relative response to auxin and expression along
the longitudinal axis of the root. This data set and comparative analysis provide
a transcriptome‐level spatial breakdown of the response to auxin within an organ
where this hormone mediates many aspects of development.
article_number: '688'
article_processing_charge: No
author:
- first_name: Bastiaan
full_name: Bargmann, Bastiaan
last_name: Bargmann
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Gabriel
full_name: Krouk, Gabriel
last_name: Krouk
- first_name: Tal
full_name: Nawy, Tal
last_name: Nawy
- first_name: Idan
full_name: Efroni, Idan
last_name: Efroni
- first_name: Eilon
full_name: Shani, Eilon
last_name: Shani
- first_name: Goh
full_name: Choe, Goh
last_name: Choe
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Dominique
full_name: Bergmann, Dominique
last_name: Bergmann
- first_name: Mark
full_name: Estelle, Mark
last_name: Estelle
- first_name: Kenneth
full_name: Birnbaum, Kenneth
last_name: Birnbaum
citation:
ama: Bargmann B, Vanneste S, Krouk G, et al. A map of cell type‐specific auxin responses.
Molecular Systems Biology. 2013;9(1). doi:10.1038/msb.2013.40
apa: Bargmann, B., Vanneste, S., Krouk, G., Nawy, T., Efroni, I., Shani, E., … Birnbaum,
K. (2013). A map of cell type‐specific auxin responses. Molecular Systems Biology.
Nature Publishing Group. https://doi.org/10.1038/msb.2013.40
chicago: Bargmann, Bastiaan, Steffen Vanneste, Gabriel Krouk, Tal Nawy, Idan Efroni,
Eilon Shani, Goh Choe, et al. “A Map of Cell Type‐specific Auxin Responses.” Molecular
Systems Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/msb.2013.40.
ieee: B. Bargmann et al., “A map of cell type‐specific auxin responses,”
Molecular Systems Biology, vol. 9, no. 1. Nature Publishing Group, 2013.
ista: Bargmann B, Vanneste S, Krouk G, Nawy T, Efroni I, Shani E, Choe G, Friml
J, Bergmann D, Estelle M, Birnbaum K. 2013. A map of cell type‐specific auxin
responses. Molecular Systems Biology. 9(1), 688.
mla: Bargmann, Bastiaan, et al. “A Map of Cell Type‐specific Auxin Responses.” Molecular
Systems Biology, vol. 9, no. 1, 688, Nature Publishing Group, 2013, doi:10.1038/msb.2013.40.
short: B. Bargmann, S. Vanneste, G. Krouk, T. Nawy, I. Efroni, E. Shani, G. Choe,
J. Friml, D. Bergmann, M. Estelle, K. Birnbaum, Molecular Systems Biology 9 (2013).
date_created: 2018-12-11T11:46:55Z
date_published: 2013-09-10T00:00:00Z
date_updated: 2021-01-12T08:01:17Z
day: '10'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1038/msb.2013.40
file:
- access_level: open_access
checksum: 9c4fbe793af4bb22b3fe50cc677a39bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:46Z
date_updated: 2020-07-14T12:46:36Z
file_id: '4644'
file_name: IST-2018-936-v1+1_2008_Barton_A_map.pdf
file_size: 3257692
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Molecular Systems Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7303'
pubrep_id: '936'
quality_controlled: '1'
scopus_import: 1
status: public
title: A map of cell type‐specific auxin responses
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2013'
...
---
_id: '522'
abstract:
- lang: eng
text: Podoplanin, a mucin-like plasma membrane protein, is expressed by lymphatic
endothelial cells and responsible for separation of blood and lymphatic circulation
through activation of platelets. Here we show that podoplanin is also expressed
by thymic fibroblastic reticular cells (tFRC), a novel thymic medulla stroma cell
type associated with thymic conduits, and involved in development of natural regulatory
T cells (nTreg). Young mice deficient in podoplanin lack nTreg owing to retardation
of CD4+CD25+ thymocytes in the cortex and missing differentiation of Foxp3+ thymocytes
in the medulla. This might be due to CCL21 that delocalizes upon deletion of the
CCL21-binding podoplanin from medullar tFRC to cortex areas. The animals do not
remain devoid of nTreg but generate them delayed within the first month resulting
in Th2-biased hypergammaglobulinemia but not in the death-causing autoimmune phenotype
of Foxp3-deficient Scurfy mice.
author:
- first_name: Elke
full_name: Fuertbauer, Elke
last_name: Fuertbauer
- first_name: Jan
full_name: Zaujec, Jan
last_name: Zaujec
- first_name: Pavel
full_name: Uhrin, Pavel
last_name: Uhrin
- first_name: Ingrid
full_name: Raab, Ingrid
last_name: Raab
- first_name: Michele
full_name: Weber, Michele
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
- first_name: Helga
full_name: Schachner, Helga
last_name: Schachner
- first_name: Miroslav
full_name: Bauer, Miroslav
last_name: Bauer
- first_name: Gerhard
full_name: Schütz, Gerhard
last_name: Schütz
- first_name: Bernd
full_name: Binder, Bernd
last_name: Binder
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Dontscho
full_name: Kerjaschki, Dontscho
last_name: Kerjaschki
- first_name: Hannes
full_name: Stockinger, Hannes
last_name: Stockinger
citation:
ama: Fuertbauer E, Zaujec J, Uhrin P, et al. Thymic medullar conduits-associated
podoplanin promotes natural regulatory T cells. Immunology Letters. 2013;154(1-2):31-41.
doi:10.1016/j.imlet.2013.07.007
apa: Fuertbauer, E., Zaujec, J., Uhrin, P., Raab, I., Weber, M., Schachner, H.,
… Stockinger, H. (2013). Thymic medullar conduits-associated podoplanin promotes
natural regulatory T cells. Immunology Letters. Elsevier. https://doi.org/10.1016/j.imlet.2013.07.007
chicago: Fuertbauer, Elke, Jan Zaujec, Pavel Uhrin, Ingrid Raab, Michele Weber,
Helga Schachner, Miroslav Bauer, et al. “Thymic Medullar Conduits-Associated Podoplanin
Promotes Natural Regulatory T Cells.” Immunology Letters. Elsevier, 2013.
https://doi.org/10.1016/j.imlet.2013.07.007.
ieee: E. Fuertbauer et al., “Thymic medullar conduits-associated podoplanin
promotes natural regulatory T cells,” Immunology Letters, vol. 154, no.
1–2. Elsevier, pp. 31–41, 2013.
ista: Fuertbauer E, Zaujec J, Uhrin P, Raab I, Weber M, Schachner H, Bauer M, Schütz
G, Binder B, Sixt MK, Kerjaschki D, Stockinger H. 2013. Thymic medullar conduits-associated
podoplanin promotes natural regulatory T cells. Immunology Letters. 154(1–2),
31–41.
mla: Fuertbauer, Elke, et al. “Thymic Medullar Conduits-Associated Podoplanin Promotes
Natural Regulatory T Cells.” Immunology Letters, vol. 154, no. 1–2, Elsevier,
2013, pp. 31–41, doi:10.1016/j.imlet.2013.07.007.
short: E. Fuertbauer, J. Zaujec, P. Uhrin, I. Raab, M. Weber, H. Schachner, M. Bauer,
G. Schütz, B. Binder, M.K. Sixt, D. Kerjaschki, H. Stockinger, Immunology Letters
154 (2013) 31–41.
date_created: 2018-12-11T11:46:57Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2021-01-12T08:01:22Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.imlet.2013.07.007
intvolume: ' 154'
issue: 1-2
language:
- iso: eng
month: '07'
oa_version: None
page: 31 - 41
publication: Immunology Letters
publication_status: published
publisher: Elsevier
publist_id: '7300'
quality_controlled: '1'
scopus_import: 1
status: public
title: Thymic medullar conduits-associated podoplanin promotes natural regulatory
T cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 154
year: '2013'
...
---
_id: '527'
abstract:
- lang: eng
text: The apical-basal axis of the early plant embryo determines the body plan of
the adult organism. To establish a polarized embryonic axis, plants evolved a
unique mechanism that involves directional, cell-to-cell transport of the growth
regulator auxin. Auxin transport relies on PIN auxin transporters [1], whose polar
subcellular localization determines the flow directionality. PIN-mediated auxin
transport mediates the spatial and temporal activity of the auxin response machinery
[2-7] that contributes to embryo patterning processes, including establishment
of the apical (shoot) and basal (root) embryo poles [8]. However, little is known
of upstream mechanisms guiding the (re)polarization of auxin fluxes during embryogenesis
[9]. Here, we developed a model of plant embryogenesis that correctly generates
emergent cell polarities and auxin-mediated sequential initiation of apical-basal
axis of plant embryo. The model relies on two precisely localized auxin sources
and a feedback between auxin and the polar, subcellular PIN transporter localization.
Simulations reproduced PIN polarity and auxin distribution, as well as previously
unknown polarization events during early embryogenesis. The spectrum of validated
model predictions suggests that our model corresponds to a minimal mechanistic
framework for initiation and orientation of the apical-basal axis to guide both
embryonic and postembryonic plant development.
author:
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Hélène
full_name: Robert, Hélène
last_name: Robert
- first_name: Richard
full_name: Smith, Richard
last_name: Smith
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Wabnik KT, Robert H, Smith R, Friml J. Modeling framework for the establishment
of the apical-basal embryonic axis in plants. Current Biology. 2013;23(24):2513-2518.
doi:10.1016/j.cub.2013.10.038
apa: Wabnik, K. T., Robert, H., Smith, R., & Friml, J. (2013). Modeling framework
for the establishment of the apical-basal embryonic axis in plants. Current
Biology. Cell Press. https://doi.org/10.1016/j.cub.2013.10.038
chicago: Wabnik, Krzysztof T, Hélène Robert, Richard Smith, and Jiří Friml. “Modeling
Framework for the Establishment of the Apical-Basal Embryonic Axis in Plants.”
Current Biology. Cell Press, 2013. https://doi.org/10.1016/j.cub.2013.10.038.
ieee: K. T. Wabnik, H. Robert, R. Smith, and J. Friml, “Modeling framework for the
establishment of the apical-basal embryonic axis in plants,” Current Biology,
vol. 23, no. 24. Cell Press, pp. 2513–2518, 2013.
ista: Wabnik KT, Robert H, Smith R, Friml J. 2013. Modeling framework for the establishment
of the apical-basal embryonic axis in plants. Current Biology. 23(24), 2513–2518.
mla: Wabnik, Krzysztof T., et al. “Modeling Framework for the Establishment of the
Apical-Basal Embryonic Axis in Plants.” Current Biology, vol. 23, no. 24,
Cell Press, 2013, pp. 2513–18, doi:10.1016/j.cub.2013.10.038.
short: K.T. Wabnik, H. Robert, R. Smith, J. Friml, Current Biology 23 (2013) 2513–2518.
date_created: 2018-12-11T11:46:58Z
date_published: 2013-12-16T00:00:00Z
date_updated: 2021-01-12T08:01:24Z
day: '16'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1016/j.cub.2013.10.038
ec_funded: 1
intvolume: ' 23'
issue: '24'
language:
- iso: eng
month: '12'
oa_version: None
page: 2513 - 2518
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '7292'
quality_controlled: '1'
scopus_import: 1
status: public
title: Modeling framework for the establishment of the apical-basal embryonic axis
in plants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '528'
abstract:
- lang: eng
text: Establishment of the embryonic axis foreshadows the main body axis of adults
both in plants and in animals, but underlying mechanisms are considered distinct.
Plants utilize directional, cell-to-cell transport of the growth hormone auxin
[1, 2] to generate an asymmetric auxin response that specifies the embryonic apical-basal
axis [3-6]. The auxin flow directionality depends on the polarized subcellular
localization of PIN-FORMED (PIN) auxin transporters [7, 8]. It remains unknown
which mechanisms and spatial cues guide cell polarization and axis orientation
in early embryos. Herein, we provide conceptually novel insights into the formation
of embryonic axis in Arabidopsis by identifying a crucial role of localized tryptophan-dependent
auxin biosynthesis [9-12]. Local auxin production at the base of young embryos
and the accompanying PIN7-mediated auxin flow toward the proembryo are required
for the apical auxin response maximum and the specification of apical embryonic
structures. Later in embryogenesis, the precisely timed onset of localized apical
auxin biosynthesis mediates PIN1 polarization, basal auxin response maximum, and
specification of the root pole. Thus, the tight spatiotemporal control of distinct
local auxin sources provides a necessary, non-cell-autonomous trigger for the
coordinated cell polarization and subsequent apical-basal axis orientation during
embryogenesis and, presumably, also for other polarization events during postembryonic
plant life [13, 14].
author:
- first_name: Hélène
full_name: Robert, Hélène
last_name: Robert
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Anna
full_name: Stepanova, Anna
last_name: Stepanova
- first_name: Linda
full_name: Robles, Linda
last_name: Robles
- first_name: Annemarie
full_name: Lokerse, Annemarie
last_name: Lokerse
- first_name: Jose
full_name: Alonso, Jose
last_name: Alonso
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Robert H, Grones P, Stepanova A, et al. Local auxin sources orient the apical
basal axis in arabidopsis embryos. Current Biology. 2013;23(24):2506-2512.
doi:10.1016/j.cub.2013.09.039
apa: Robert, H., Grones, P., Stepanova, A., Robles, L., Lokerse, A., Alonso, J.,
… Friml, J. (2013). Local auxin sources orient the apical basal axis in arabidopsis
embryos. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2013.09.039
chicago: Robert, Hélène, Peter Grones, Anna Stepanova, Linda Robles, Annemarie Lokerse,
Jose Alonso, Dolf Weijers, and Jiří Friml. “Local Auxin Sources Orient the Apical
Basal Axis in Arabidopsis Embryos.” Current Biology. Cell Press, 2013.
https://doi.org/10.1016/j.cub.2013.09.039.
ieee: H. Robert et al., “Local auxin sources orient the apical basal axis
in arabidopsis embryos,” Current Biology, vol. 23, no. 24. Cell Press,
pp. 2506–2512, 2013.
ista: Robert H, Grones P, Stepanova A, Robles L, Lokerse A, Alonso J, Weijers D,
Friml J. 2013. Local auxin sources orient the apical basal axis in arabidopsis
embryos. Current Biology. 23(24), 2506–2512.
mla: Robert, Hélène, et al. “Local Auxin Sources Orient the Apical Basal Axis in
Arabidopsis Embryos.” Current Biology, vol. 23, no. 24, Cell Press, 2013,
pp. 2506–12, doi:10.1016/j.cub.2013.09.039.
short: H. Robert, P. Grones, A. Stepanova, L. Robles, A. Lokerse, J. Alonso, D.
Weijers, J. Friml, Current Biology 23 (2013) 2506–2512.
date_created: 2018-12-11T11:46:59Z
date_published: 2013-12-16T00:00:00Z
date_updated: 2021-01-12T08:01:25Z
day: '16'
department:
- _id: JiFr
doi: 10.1016/j.cub.2013.09.039
ec_funded: 1
intvolume: ' 23'
issue: '24'
language:
- iso: eng
month: '12'
oa_version: None
page: 2506 - 2512
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '7291'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local auxin sources orient the apical basal axis in arabidopsis embryos
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2013'
...
---
_id: '5399'
abstract:
- lang: eng
text: In this work we present a flexible tool for tumor progression, which simulates
the evolutionary dynamics of cancer. Tumor progression implements a multi-type
branching process where the key parameters are the fitness landscape, the mutation
rate, and the average time of cell division. The fitness of a cancer cell depends
on the mutations it has accumulated. The input to our tool could be any fitness
landscape, mutation rate, and cell division time, and the tool produces the growth
dynamics and all relevant statistics.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Bozic, Ivana
last_name: Bozic
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Reiter J, Bozic I, Chatterjee K, Nowak M. TTP: Tool for Tumor Progression.
IST Austria; 2013. doi:10.15479/AT:IST-2013-104-v1-1'
apa: 'Reiter, J., Bozic, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool
for Tumor Progression. IST Austria. https://doi.org/10.15479/AT:IST-2013-104-v1-1'
chicago: 'Reiter, Johannes, Ivana Bozic, Krishnendu Chatterjee, and Martin Nowak.
TTP: Tool for Tumor Progression. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-104-v1-1.'
ieee: 'J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor
Progression. IST Austria, 2013.'
ista: 'Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression,
IST Austria, 17p.'
mla: 'Reiter, Johannes, et al. TTP: Tool for Tumor Progression. IST Austria,
2013, doi:10.15479/AT:IST-2013-104-v1-1.'
short: 'J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression,
IST Austria, 2013.'
date_created: 2018-12-12T11:39:07Z
date_published: 2013-01-11T00:00:00Z
date_updated: 2023-02-23T10:23:57Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-104-v1-1
file:
- access_level: open_access
checksum: 2cc8c6e157eca1271128db80bb3dec80
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:20Z
date_updated: 2020-07-14T12:46:44Z
file_id: '5542'
file_name: IST-2013-104-v1+1_tumortool.pdf
file_size: 1471954
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '104'
related_material:
record:
- id: '2000'
relation: later_version
status: public
status: public
title: 'TTP: Tool for Tumor Progression'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5400'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs) with ω-regular
conditions specified as parity objectives. The class of ω-regular languages extends
regular languages to infinite strings and provides a robust specification language
to express all properties used in verification, and parity objectives are canonical
forms to express ω-regular conditions. The qualitative analysis problem given
a POMDP and a parity objective asks whether there is a strategy to ensure that
the objective is satis- fied with probability 1 (resp. positive probability).
While the qualitative analysis problems are known to be undecidable even for very
special cases of parity objectives, we establish decidability (with optimal complexity)
of the qualitative analysis problems for POMDPs with all parity objectives under
finite- memory strategies. We establish asymptotically optimal (exponential) memory
bounds and EXPTIME- completeness of the qualitative analysis problems under finite-memory
strategies for POMDPs with parity objectives.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Chmelik M, Tracol M. What Is Decidable about Partially Observable
Markov Decision Processes with ω-Regular Objectives. IST Austria; 2013. doi:10.15479/AT:IST-2013-109-v1-1
apa: Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable
about partially observable Markov decision processes with ω-regular objectives.
IST Austria. https://doi.org/10.15479/AT:IST-2013-109-v1-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is
Decidable about Partially Observable Markov Decision Processes with ω-Regular
Objectives. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-109-v1-1.
ieee: K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially
observable Markov decision processes with ω-regular objectives. IST Austria,
2013.
ista: Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially
observable Markov decision processes with ω-regular objectives, IST Austria, 41p.
mla: Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable
Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013, doi:10.15479/AT:IST-2013-109-v1-1.
short: K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable
Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
date_created: 2018-12-12T11:39:07Z
date_published: 2013-02-20T00:00:00Z
date_updated: 2023-02-23T10:36:45Z
day: '20'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-109-v1-1
file:
- access_level: open_access
checksum: cbba40210788a1b22c6cf06433b5ed6f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:06Z
date_updated: 2020-07-14T12:46:44Z
file_id: '5467'
file_name: IST-2013-109-v1+1_What_is_Decidable_about_Partially_Observable_Markov_Decision_Processes_with_ω-Regular_Objectives.pdf
file_size: 483407
relation: main_file
file_date_updated: 2020-07-14T12:46:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '41'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '109'
related_material:
record:
- id: '1477'
relation: later_version
status: public
- id: '2295'
relation: later_version
status: public
status: public
title: What is decidable about partially observable Markov decision processes with
ω-regular objectives
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5401'
abstract:
- lang: eng
text: This document is created as a part of the project “Repository for Research
Data at IST Austria”. It summarises the actual initiatives, projects and standards
related to the project. It supports the preparation of standards and specifications
for the project, which should be considered and followed to ensure interoperability
and visibility of the uploaded data.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Initiatives and Projects Related to RD. IST Austria; 2013.
apa: Porsche, J. (2013). Initiatives and projects related to RD. IST Austria.
chicago: Porsche, Jana. Initiatives and Projects Related to RD. IST Austria,
2013.
ieee: J. Porsche, Initiatives and projects related to RD. IST Austria, 2013.
ista: Porsche J. 2013. Initiatives and projects related to RD, IST Austria,p.
mla: Porsche, Jana. Initiatives and Projects Related to RD. IST Austria,
2013.
short: J. Porsche, Initiatives and Projects Related to RD, IST Austria, 2013.
date_created: 2018-12-12T11:39:07Z
date_published: 2013-03-20T00:00:00Z
date_updated: 2020-07-14T23:04:47Z
day: '20'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: d68712db838432ecdacf9ffb1de8f8a6
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:14Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5536'
file_name: IST-2013-113-v1+1_Initiatives_and_projects_related_to_RD.pdf
file_size: 151208
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
pubrep_id: '113'
status: public
title: Initiatives and projects related to RD
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5402'
abstract:
- lang: eng
text: "Linearizability requires that the outcome of calls by competing threads to
a concurrent data structure is the same as some sequential execution where each
thread has exclusive access to the data structure. In an ordered data structure,
such as a queue or a stack, linearizability is ensured by requiring threads commit
in the order dictated by the sequential semantics of the data structure; e.g.,
in a concurrent queue implementation a dequeue can only remove the oldest element.
\r\nIn this paper, we investigate the impact of this strict ordering, by comparing
what linearizability allows to what existing implementations do. We first give
an operational definition for linearizability which allows us to build the most
general linearizable implementation as a transition system for any given sequential
specification. We then use this operational definition to categorize linearizable
implementations based on whether they are bound or free. In a bound implementation,
whenever all threads observe the same logical state, the updates to the logical
state and the temporal order of commits coincide. All existing queue implementations
we know of are bound. We then proceed to present, to the best of our knowledge,
the first ever free queue implementation. Our experiments show that free implementations
have the potential for better performance by suffering less from contention."
alternative_title:
- IST Austria Technical Report
author:
- 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: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: Henzinger TA, Sezgin A. How Free Is Your Linearizable Concurrent Data Structure?
IST Austria; 2013. doi:10.15479/AT:IST-2013-123-v1-1
apa: Henzinger, T. A., & Sezgin, A. (2013). How free is your linearizable
concurrent data structure? IST Austria. https://doi.org/10.15479/AT:IST-2013-123-v1-1
chicago: Henzinger, Thomas A, and Ali Sezgin. How Free Is Your Linearizable Concurrent
Data Structure? IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-123-v1-1.
ieee: T. A. Henzinger and A. Sezgin, How free is your linearizable concurrent
data structure? IST Austria, 2013.
ista: Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data
structure?, IST Austria, 16p.
mla: Henzinger, Thomas A., and Ali Sezgin. How Free Is Your Linearizable Concurrent
Data Structure? IST Austria, 2013, doi:10.15479/AT:IST-2013-123-v1-1.
short: T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data
Structure?, IST Austria, 2013.
date_created: 2018-12-12T11:39:07Z
date_published: 2013-06-12T00:00:00Z
date_updated: 2020-07-14T23:04:47Z
day: '12'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2013-123-v1-1
file:
- access_level: open_access
checksum: ce580605ae9756a8c99d7b403ebb8eed
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:19Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5480'
file_name: IST-2013-123-v1+1_main-concur2013.pdf
file_size: 249790
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '16'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '123'
status: public
title: How free is your linearizable concurrent data structure?
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5403'
abstract:
- lang: eng
text: 'We consider concurrent games played by two-players on a finite state graph,
where in every round the players simultaneously choose a move, and the current
state along with the joint moves determine the successor state. We study the most
fundamental objective for concurrent games, namely, mean-payoff or limit-average
objective, where a reward is associated to every transition, and the goal of player
1 is to maximize the long-run average of the rewards, and the objective of player
2 is strictly the opposite (i.e., the games are zero-sum). The path constraint
for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward,
or arbitrarily close to it; or quantitative, i.e., a given threshold between the
minimal and maximal reward. We consider the computation of the almost-sure (resp.
positive) winning sets, where player 1 can ensure that the path constraint is
satisfied with probability 1 (resp. positive probability). Almost-sure winning
with qualitative constraint exactly corresponds to the question whether there
exists a strategy to ensure that the payoff is the maximal reward of the game.
Our main results for qualitative path constraints are as follows: (1) we establish
qualitative determinacy results that show for every state either player 1 has
a strategy to ensure almost-sure (resp. positive) winning against all player-2
strategies or player 2 has a spoiling strategy to falsify almost-sure (resp. positive)
winning against all player-1 strategies; (2) we present optimal strategy complexity
results that precisely characterize the classes of strategies required for almost-sure
and positive winning for both players; and (3) we present quadratic time algorithms
to compute the almost-sure and the positive winning sets, matching the best known
bound of the algorithms for much simpler problems (such as reachability objectives).
For quantitative constraints we show that a polynomial time solution for the almost-sure
or the positive winning set would imply a solution to a long-standing open problem
(of solving the value problem of mean-payoff games) that is not known to be in
polynomial time.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: Chatterjee K, Ibsen-Jensen R. Qualitative Analysis of Concurrent Mean-Payoff
Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-126-v1-1
apa: Chatterjee, K., & Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent
mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2013-126-v1-1
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis
of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
ieee: K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff
games. IST Austria, 2013.
ista: Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff
games, IST Austria, 33p.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of
Concurrent Mean-Payoff Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-126-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff
Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:08Z
date_published: 2013-07-03T00:00:00Z
date_updated: 2023-02-23T12:22:53Z
day: '03'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-126-v1-1
file:
- access_level: open_access
checksum: 063868c665beec37bf28160e2a695746
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:49Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5510'
file_name: IST-2013-126-v1+1_soda_full.pdf
file_size: 434523
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '126'
related_material:
record:
- id: '524'
relation: later_version
status: public
status: public
title: Qualitative analysis of concurrent mean-payoff games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5404'
abstract:
- lang: eng
text: 'We study finite-state two-player (zero-sum) concurrent mean-payoff games
played on a graph. We focus on the important sub-class of ergodic games where
all states are visited infinitely often with probability 1. The algorithmic study
of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966,
but all basic complexity questions have remained unresolved. Our main results
for ergodic games are as follows: We establish (1) an optimal exponential bound
on the patience of stationary strategies (where patience of a distribution is
the inverse of the smallest positive probability and represents a complexity measure
of a stationary strategy); (2) the approximation problem lie in FNP; (3) the approximation
problem is at least as hard as the decision problem for simple stochastic games
(for which NP and coNP is the long-standing best known bound). We show that the
exact value can be expressed in the existential theory of the reals, and also
establish square-root sum hardness for a related class of games.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: Chatterjee K, Ibsen-Jensen R. The Complexity of Ergodic Games. IST Austria;
2013. doi:10.15479/AT:IST-2013-127-v1-1
apa: Chatterjee, K., & Ibsen-Jensen, R. (2013). The complexity of ergodic
games. IST Austria. https://doi.org/10.15479/AT:IST-2013-127-v1-1
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic
Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
ieee: K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games.
IST Austria, 2013.
ista: Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria,
29p.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic
Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-127-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria,
2013.
date_created: 2018-12-12T11:39:08Z
date_published: 2013-07-03T00:00:00Z
date_updated: 2023-02-23T10:30:55Z
day: '03'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-127-v1-1
file:
- access_level: open_access
checksum: 79ee5e677a82611ce06e0360c69d494a
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:35Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5496'
file_name: IST-2013-127-v1+1_ergodic.pdf
file_size: 517275
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '127'
related_material:
record:
- id: '2162'
relation: later_version
status: public
status: public
title: The complexity of ergodic games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5405'
abstract:
- lang: eng
text: "The theory of graph games is the foundation for modeling and synthesizing
reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player
games where some transitions of the game graph are controlled by two adversarial
players, the System and the Environment, and the other transitions are determined
probabilistically. We consider 2-1/2-player games where the objective of the System
is the conjunction of a qualitative objective (specified as a parity condition)
and a quantitative objective (specified as a mean-payoff condition). We establish
that the problem of deciding whether the System can ensure that the probability
to satisfy the mean-payoff parity objective is at least a given threshold is in
NP ∩ coNP, matching the best known bound in the special case of 2-player games
(where all transitions are deterministic) with only parity objectives, or with
only mean-payoff objectives. We present an algorithm running\r\nin time O(d ·
n^{2d}·MeanGame) to compute the set of almost-sure winning states from which the
objective\r\ncan be ensured with probability 1, where n is the number of states
of the game, d the number of priorities\r\nof the parity objective, and MeanGame
is the complexity to compute the set of almost-sure winning states\r\nin 2-1/2-player
mean-payoff games. Our results are useful in the synthesis of stochastic reactive
systems\r\nwith both functional requirement (given as a qualitative objective)
and performance requirement (given\r\nas a quantitative objective)."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- first_name: Youssouf
full_name: Oualhadj, Youssouf
last_name: Oualhadj
citation:
ama: Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-Information Stochastic
Mean-Payoff Parity Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-128-v1-1
apa: Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information
stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj.
Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013.
https://doi.org/10.15479/AT:IST-2013-128-v1-1.
ieee: K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information
stochastic mean-payoff parity games. IST Austria, 2013.
ista: Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic
mean-payoff parity games, IST Austria, 22p.
mla: Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff
Parity Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-128-v1-1.
short: K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic
Mean-Payoff Parity Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-08T00:00:00Z
date_updated: 2023-02-23T10:33:08Z
day: '08'
ddc:
- '000'
- '005'
- '510'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-128-v1-1
file:
- access_level: open_access
checksum: ede787a10e74e4f7db302fab8f12f3ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:54Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5516'
file_name: IST-2013-128-v1+1_full_stoch_mpp.pdf
file_size: 387467
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '128'
related_material:
record:
- id: '2212'
relation: later_version
status: public
status: public
title: Perfect-information stochastic mean-payoff parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5406'
abstract:
- lang: eng
text: 'We consider the distributed synthesis problem fortemporal logic specifications.
Traditionally, the problem has been studied for LTL, and the previous results
show that the problem is decidable iff there is no information fork in the architecture.
We consider the problem for fragments of LTLand our main results are as follows:
(1) We show that the problem is undecidable for architectures with information
forks even for the fragment of LTL with temporal operators restricted to next
and eventually. (2) For specifications restricted to globally along with non-nested
next operators, we establish decidability (in EXPSPACE) for star architectures
where the processes receive disjoint inputs, whereas we establish undecidability
for architectures containing an information fork-meet structure. (3)Finally, we
consider LTL without the next operator, and establish decidability (NEXPTIME-complete)
for all architectures for a fragment that consists of a set of safety assumptions,
and a set of guarantees where each guarantee is a safety, reachability, or liveness
condition.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed Synthesis
for LTL Fragments. IST Austria; 2013. doi:10.15479/AT:IST-2013-130-v1-1
apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013).
Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis.
Distributed Synthesis for LTL Fragments. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-130-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed
synthesis for LTL Fragments. IST Austria, 2013.
ista: Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis
for LTL Fragments, IST Austria, 11p.
mla: Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments.
IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.
short: K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis
for LTL Fragments, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-08T00:00:00Z
date_updated: 2023-02-21T17:01:26Z
day: '08'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2013-130-v1-1
file:
- access_level: open_access
checksum: 855513ebaf6f72228800c5fdb522f93c
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:18Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5540'
file_name: IST-2013-130-v1+1_Distributed_Synthesis.pdf
file_size: 467895
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '11'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '130'
related_material:
record:
- id: '1376'
relation: later_version
status: public
status: public
title: Distributed synthesis for LTL Fragments
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5407'
abstract:
- lang: eng
text: This document is created as a part of the project “Repository for Research
Data at IST Austria”. It summarises the mandatory features, which need to be fulfilled
to provide an institutional repository as a platform and also a service to the
scientists at the institute. It also includes optional features, which would be
of strong benefit for the scientists and would increase the usage of the repository,
and hence the visibility of research at IST Austria.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Technical Requirements and Features. IST Austria; 2013.
apa: Porsche, J. (2013). Technical requirements and features. IST Austria.
chicago: Porsche, Jana. Technical Requirements and Features. IST Austria,
2013.
ieee: J. Porsche, Technical requirements and features. IST Austria, 2013.
ista: Porsche J. 2013. Technical requirements and features, IST Austria,p.
mla: Porsche, Jana. Technical Requirements and Features. IST Austria, 2013.
short: J. Porsche, Technical Requirements and Features, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-13T00:00:00Z
date_updated: 2020-07-14T23:07:51Z
day: '13'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: 9e4f9abf79a56f651f0012a34909880f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:02Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5463'
file_name: IST-2013-135-v1+1_Features.pdf
file_size: 90311
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
pubrep_id: '135'
status: public
title: Technical requirements and features
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5408'
abstract:
- lang: eng
text: "We consider two-player partial-observation stochastic games where player
1 has partial observation and player 2 has perfect observation. The winning condition
we study are omega-regular conditions specified as parity objectives. The qualitative
analysis problem given a partial-observation stochastic game and a parity objective
asks whether there is a strategy to ensure that the objective is satisfied with
probability 1 (resp. positive probability). While the qualitative analysis problems
are known to be undecidable even for very special cases of parity objectives,
they were shown to be decidable in 2EXPTIME under finite-memory strategies. We
improve the complexity and show that the qualitative analysis problems for partial-observation
stochastic parity games under finite-memory strategies are \r\nEXPTIME-complete;
and also establish optimal (exponential) memory bounds for finite-memory strategies
required for qualitative analysis. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Sumit
full_name: Nain, Sumit
last_name: Nain
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: Chatterjee K, Doyen L, Nain S, Vardi M. The Complexity of Partial-Observation
Stochastic Parity Games with Finite-Memory Strategies. IST Austria; 2013.
doi:10.15479/AT:IST-2013-141-v1-1
apa: Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity
of partial-observation stochastic parity games with finite-memory strategies.
IST Austria. https://doi.org/10.15479/AT:IST-2013-141-v1-1
chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The
Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.
IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-141-v1-1.
ieee: K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation
stochastic parity games with finite-memory strategies. IST Austria, 2013.
ista: Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation
stochastic parity games with finite-memory strategies, IST Austria, 17p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic
Parity Games with Finite-Memory Strategies. IST Austria, 2013, doi:10.15479/AT:IST-2013-141-v1-1.
short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation
Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-09-12T00:00:00Z
date_updated: 2023-02-23T10:33:11Z
day: '12'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-141-v1-1
file:
- access_level: open_access
checksum: 226bc791124f8d3138379778ce834e86
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:16Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5477'
file_name: IST-2013-141-v1+1_main-tech-rpt.pdf
file_size: 300481
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '141'
related_material:
record:
- id: '2213'
relation: later_version
status: public
status: public
title: The complexity of partial-observation stochastic parity games with finite-memory
strategies
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5409'
abstract:
- lang: eng
text: "The edit distance between two (untimed) traces is the minimum cost of a sequence
of edit operations (insertion, deletion, or substitution) needed to transform
one trace to the other. Edit distances have been extensively studied in the untimed
setting, and form the basis for approximate matching of sequences in different
domains such as coding theory, parsing, and speech recognition. \r\nIn this paper,
we lift the study of edit distances from untimed languages to the timed setting.
We define an edit distance between timed words which incorporates both the edit
distance between the untimed words and the absolute difference in timestamps.
Our edit distance between two timed words is computable in polynomial time. Further,
we show that the edit distance between a timed word and a timed language generated
by a timed automaton, defined as the edit distance between the word and the closest
word in the language, is PSPACE-complete. While computing the edit distance between
two timed automata is undecidable, we show that the approximate version, where
we decide if the edit distance between two timed automata is either less than
a given parameter or more than delta away from the parameter, for delta>0, can
be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques
can be generalized to the setting of hybrid systems, and we show analogous decidability
results for rectangular automata."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
citation:
ama: Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit Distance for Timed Automata.
IST Austria; 2013. doi:10.15479/AT:IST-2013-144-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance
for timed automata. IST Austria. https://doi.org/10.15479/AT:IST-2013-144-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit
Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed
automata. IST Austria, 2013.
ista: Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata,
IST Austria, 12p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. IST
Austria, 2013, doi:10.15479/AT:IST-2013-144-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata,
IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-10-30T00:00:00Z
date_updated: 2023-02-23T10:33:18Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-144-v1-1
file:
- access_level: open_access
checksum: 0f7633081ba8299c543322f0ad08571f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:08Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5469'
file_name: IST-2013-144-v1+1_main.pdf
file_size: 336377
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '12'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '144'
related_material:
record:
- id: '2216'
relation: later_version
status: public
status: public
title: Edit distance for timed automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5410'
abstract:
- lang: eng
text: "Board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only
in development of mathematical and logical skills, but also in emotional and social
development. In this paper, we address the problem of generating targeted starting
positions for such games. This can facilitate new approaches for bringing novice
players to mastery, and also leads to discovery of interesting game variants.
\r\nOur approach generates starting states of varying hardness levels for player
1 in a two-player board game, given rules of the board game, the desired number
of steps required for player 1 to win, and the expertise levels of the two players.
Our approach leverages symbolic methods and iterative simulation to efficiently
search the extremely large state space. We present experimental results that include
discovery of states of varying hardness levels for several simple grid-based board
games. Also, the presence of such states for standard game variants like Tic-Tac-Toe
on board size 4x4 opens up new games to be played that have not been played for
ages since the default start state is heavily biased. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: Ahmed U, Chatterjee K, Gulwani S. Automatic Generation of Alternative Starting
Positions for Traditional Board Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-146-v1-1
apa: Ahmed, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation
of alternative starting positions for traditional board games. IST Austria.
https://doi.org/10.15479/AT:IST-2013-146-v1-1
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation
of Alternative Starting Positions for Traditional Board Games. IST Austria,
2013. https://doi.org/10.15479/AT:IST-2013-146-v1-1.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative
starting positions for traditional board games. IST Austria, 2013.
ista: Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative
starting positions for traditional board games, IST Austria, 13p.
mla: Ahmed, Umair, et al. Automatic Generation of Alternative Starting Positions
for Traditional Board Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-146-v1-1.
short: U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative
Starting Positions for Traditional Board Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-12-03T00:00:00Z
date_updated: 2023-02-23T10:00:50Z
day: '03'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-146-v1-1
file:
- access_level: open_access
checksum: 409f3aaaf1184e4057b89cbb449dac80
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:06Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5528'
file_name: IST-2013-146-v1+1_main.pdf
file_size: 818189
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '13'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '146'
related_material:
record:
- id: '1481'
relation: later_version
status: public
status: public
title: Automatic generation of alternative starting positions for traditional board
games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5747'
article_processing_charge: No
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: 'Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent
Objects with Cooperating Updates. In: Computer Aided Verification. Vol
8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:10.1007/978-3-642-39799-8_11'
apa: 'Dragoi, C., Gupta, A., & Henzinger, T. A. (2013). Automatic Linearizability
Proofs of Concurrent Objects with Cooperating Updates. In Computer Aided Verification
(Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-39799-8_11'
chicago: 'Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability
Proofs of Concurrent Objects with Cooperating Updates.” In Computer Aided Verification,
8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39799-8_11.'
ieee: 'C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs
of Concurrent Objects with Cooperating Updates,” in Computer Aided Verification,
vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.'
ista: 'Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of
Concurrent Objects with Cooperating Updates. In: Computer Aided Verification.
vol. 8044, 174–190.'
mla: Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects
with Cooperating Updates.” Computer Aided Verification, vol. 8044, Springer
Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.
short: C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.
conference:
end_date: 2013-07-19
location: Saint Petersburg, Russia
name: CAV 2013
start_date: 2013-07-13
date_created: 2018-12-18T13:10:21Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-05T14:16:07Z
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39799-8_11
ec_funded: 1
file:
- access_level: open_access
checksum: a901cc6b71db08b61c0d4c0cbacc6287
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:13:33Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5748'
file_name: 2013_CAV_Dragoi.pdf
file_size: 236480
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 8044'
language:
- iso: eng
oa: 1
oa_version: None
page: 174-190
place: Berlin, Heidelberg
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783642397981'
- '9783642397998'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
pubrep_id: '195'
quality_controlled: '1'
scopus_import: '1'
series_title: CAV
status: public
title: Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8044
year: '2013'
...
---
_id: '6440'
abstract:
- lang: eng
text: In order to guarantee that each method of a data structure updates the logical
state exactly once, al-most all non-blocking implementations employ Compare-And-Swap
(CAS) based synchronization. For FIFO queue implementations this translates into concurrent enqueue or dequeue methods
competing among themselves to update the same variable, the tail or the head,
respectively, leading to high contention and poor scalability. Recent non-blocking
queue implementations try to alleviate high contentionby increasing the number
of contention points, all the while using CAS-based synchronization. Furthermore,
obtaining a wait-free implementation with competition is achieved by additional
synchronization which leads to further degradation of performance.In this paper
we formalize the notion of competitiveness of a synchronizing statement which
can beused as a measure for the scalability of concurrent implementations. We
present a new queue implementation, the Speculative Pairing (SP) queue, which,
as we show, decreases competitiveness by using Fetch-And-Increment (FAI) instead
of CAS. We prove that the SP queue is linearizable and lock-free.We also show
that replacing CAS with FAI leads to wait-freedom for dequeue methods without
an adverse effect on performance. In fact, our experiments suggest that the SP
queue can perform and scale better than the state-of-the-art queue implementations.
alternative_title:
- IST Austria Technical Report
author:
- 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: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: Henzinger TA, Payer H, Sezgin A. Replacing Competition with Cooperation
to Achieve Scalable Lock-Free FIFO Queues . IST Austria; 2013. doi:10.15479/AT:IST-2013-124-v1-1
apa: Henzinger, T. A., Payer, H., & Sezgin, A. (2013). Replacing competition
with cooperation to achieve scalable lock-free FIFO queues . IST Austria.
https://doi.org/10.15479/AT:IST-2013-124-v1-1
chicago: Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. Replacing Competition
with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria,
2013. https://doi.org/10.15479/AT:IST-2013-124-v1-1.
ieee: T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation
to achieve scalable lock-free FIFO queues . IST Austria, 2013.
ista: Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation
to achieve scalable lock-free FIFO queues , IST Austria, 23p.
mla: Henzinger, Thomas A., et al. Replacing Competition with Cooperation to Achieve
Scalable Lock-Free FIFO Queues . IST Austria, 2013, doi:10.15479/AT:IST-2013-124-v1-1.
short: T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation
to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
date_created: 2019-05-13T14:13:27Z
date_published: 2013-06-13T00:00:00Z
date_updated: 2020-07-14T23:06:19Z
day: '13'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2013-124-v1-1
file:
- access_level: open_access
checksum: a219ba4eada6cd62befed52262ee15d4
content_type: application/pdf
creator: dernst
date_created: 2019-05-13T14:11:39Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6441'
file_name: 2013_TechRep_Henzinger.pdf
file_size: 549684
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '23'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '124'
status: public
title: 'Replacing competition with cooperation to achieve scalable lock-free FIFO
queues '
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...