---
_id: '1052'
abstract:
- lang: eng
text: The present paper aims at finding optimal parameters for trapping of Cs 2
molecules in optical lattices, with the perspective of creating a quantum degenerate
gas of ground-state molecules. We have calculated dynamic polarizabilities of
Cs 2 molecules subject to an oscillating electric field, using accurate potential
curves and electronic transition dipole moments. We show that for some particular
wavelengths of the optical lattice, called "magic wavelengths", the
polarizability of the ground-state molecules is equal to the one of a Feshbach
molecule. As the creation of the sample of ground-state molecules relies on an
adiabatic population transfer from weakly-bound molecules created on a Feshbach
resonance, such a coincidence ensures that both the initial and final states are
favorably trapped by the lattice light, allowing optimized transfer in agreement
with the experimental observation.
acknowledgement: "We thank E. Haller for important contributions to the experimental
work and R. Grimm for generous support. We acknowledge funding by the Austrian
\ Science Fund (FWF) within\r\nproject Quantum Gases of Ground-State Molecules,
\ project\r\nnumber P 21555-N20."
article_processing_charge: No
arxiv: 1
author:
- first_name: Romain
full_name: Vexiau, Romain
last_name: Vexiau
- first_name: Nadia
full_name: Bouloufa, Nadia
last_name: Bouloufa
- first_name: Mireille
full_name: Aymar, Mireille
last_name: Aymar
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Manfred
full_name: Mark, Manfred
last_name: Mark
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
- first_name: Olivier
full_name: Dulieu, Olivier
last_name: Dulieu
citation:
ama: Vexiau R, Bouloufa N, Aymar M, et al. Optimal trapping wavelengths of Cs 2
molecules in an optical lattice. European Physical Journal D. 2011;65(1-2):243-250.
doi:10.1140/epjd/e2011-20085-4
apa: Vexiau, R., Bouloufa, N., Aymar, M., Danzl, J. G., Mark, M., Nägerl, H., &
Dulieu, O. (2011). Optimal trapping wavelengths of Cs 2 molecules in an optical
lattice. European Physical Journal D. Springer. https://doi.org/10.1140/epjd/e2011-20085-4
chicago: Vexiau, Romain, Nadia Bouloufa, Mireille Aymar, Johann G Danzl, Manfred
Mark, Hanns Nägerl, and Olivier Dulieu. “Optimal Trapping Wavelengths of Cs 2
Molecules in an Optical Lattice.” European Physical Journal D. Springer,
2011. https://doi.org/10.1140/epjd/e2011-20085-4.
ieee: R. Vexiau et al., “Optimal trapping wavelengths of Cs 2 molecules in
an optical lattice,” European Physical Journal D, vol. 65, no. 1–2. Springer,
pp. 243–250, 2011.
ista: Vexiau R, Bouloufa N, Aymar M, Danzl JG, Mark M, Nägerl H, Dulieu O. 2011.
Optimal trapping wavelengths of Cs 2 molecules in an optical lattice. European
Physical Journal D. 65(1–2), 243–250.
mla: Vexiau, Romain, et al. “Optimal Trapping Wavelengths of Cs 2 Molecules in an
Optical Lattice.” European Physical Journal D, vol. 65, no. 1–2, Springer,
2011, pp. 243–50, doi:10.1140/epjd/e2011-20085-4.
short: R. Vexiau, N. Bouloufa, M. Aymar, J.G. Danzl, M. Mark, H. Nägerl, O. Dulieu,
European Physical Journal D 65 (2011) 243–250.
date_created: 2018-12-11T11:49:53Z
date_published: 2011-11-01T00:00:00Z
date_updated: 2021-01-12T06:47:56Z
day: '01'
doi: 10.1140/epjd/e2011-20085-4
extern: '1'
external_id:
arxiv:
- '1102.1793'
intvolume: ' 65'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1102.1793
month: '11'
oa: 1
oa_version: Preprint
page: 243 - 250
publication: European Physical Journal D
publication_status: published
publisher: Springer
publist_id: '6336'
status: public
title: Optimal trapping wavelengths of Cs 2 molecules in an optical lattice
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2011'
...
---
_id: '1053'
abstract:
- lang: eng
text: We perform precision measurements on a Mott-insulator quantum state of ultracold
atoms with tunable interactions. We probe the dependence of the superfluid-to-Mott-insulator
transition on the interaction strength and explore the limits of the standard
Bose-Hubbard model description. By tuning the on-site interaction energies to
values comparable to the interband separation, we are able to quantitatively measure
number-dependent shifts in the excitation spectrum caused by effective multibody
interactions.
acknowledgement: We are indebted to R. Grimm for generous support. We thank D. Boyanovsky,
H. Büchler, P. Johnson, W. Niedenzu, and E. Tiesinga for fruitful discussions. We
gratefully acknowledge funding by the Austrian Science Fund (FWF) within project
I153-N16 and within the framework of the European Science Foundation (ESF) EuroQUASAR
collective research project QuDeGPM.
article_processing_charge: No
arxiv: 1
author:
- first_name: Manfred
full_name: Mark, Manfred
last_name: Mark
- first_name: Elmar
full_name: Haller, Elmar
last_name: Haller
- first_name: Katharina
full_name: Lauber, Katharina
last_name: Lauber
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Andrew
full_name: Daley, Andrew
last_name: Daley
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
citation:
ama: Mark M, Haller E, Lauber K, Danzl JG, Daley A, Nägerl H. Precision measurements
on a tunable Mott insulator of ultracold atoms. Physical Review Letters.
2011;107(17). doi:10.1103/PhysRevLett.107.175301
apa: Mark, M., Haller, E., Lauber, K., Danzl, J. G., Daley, A., & Nägerl, H.
(2011). Precision measurements on a tunable Mott insulator of ultracold atoms.
Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.107.175301
chicago: Mark, Manfred, Elmar Haller, Katharina Lauber, Johann G Danzl, Andrew Daley,
and Hanns Nägerl. “Precision Measurements on a Tunable Mott Insulator of Ultracold
Atoms.” Physical Review Letters. American Physical Society, 2011. https://doi.org/10.1103/PhysRevLett.107.175301.
ieee: M. Mark, E. Haller, K. Lauber, J. G. Danzl, A. Daley, and H. Nägerl, “Precision
measurements on a tunable Mott insulator of ultracold atoms,” Physical Review
Letters, vol. 107, no. 17. American Physical Society, 2011.
ista: Mark M, Haller E, Lauber K, Danzl JG, Daley A, Nägerl H. 2011. Precision measurements
on a tunable Mott insulator of ultracold atoms. Physical Review Letters. 107(17).
mla: Mark, Manfred, et al. “Precision Measurements on a Tunable Mott Insulator of
Ultracold Atoms.” Physical Review Letters, vol. 107, no. 17, American Physical
Society, 2011, doi:10.1103/PhysRevLett.107.175301.
short: M. Mark, E. Haller, K. Lauber, J.G. Danzl, A. Daley, H. Nägerl, Physical
Review Letters 107 (2011).
date_created: 2018-12-11T11:49:54Z
date_published: 2011-10-18T00:00:00Z
date_updated: 2021-01-12T06:47:56Z
day: '18'
doi: 10.1103/PhysRevLett.107.175301
extern: '1'
external_id:
arxiv:
- '1107.1803'
intvolume: ' 107'
issue: '17'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1107.1803
month: '10'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '6337'
status: public
title: Precision measurements on a tunable Mott insulator of ultracold atoms
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 107
year: '2011'
...
---
_id: '1054'
abstract:
- lang: eng
text: We investigate local three-body correlations for bosonic particles in three
dimensions and one dimension as a function of the interaction strength. The three-body
correlation function g(3) is determined by measuring the three-body recombination
rate in an ultracold gas of Cs atoms. In three dimensions, we measure the dependence
of g(3) on the gas parameter in a BEC, finding good agreement with the theoretical
prediction accounting for beyond-mean-field effects. In one dimension, we observe
a reduction of g( 3) by several orders of magnitude upon increasing interactions
from the weakly interacting BEC to the strongly interacting Tonks-Girardeau regime,
in good agreement with predictions from the Lieb-Liniger model for all strengths
of interaction.
acknowledgement: We thank R. Grimm for generous support. We gratefully acknowledge
funding by the Austrian Science Fund (FWF) within Project No. I153-N16 and within
the framework of the European Science Foundation (ESF) EuroQUASAR collective research
project QuDeGPM. G. P. acknowledges funding from the EU through NAME-QUAM and AQUTE.
article_processing_charge: No
arxiv: 1
author:
- first_name: Elmar
full_name: Haller, Elmar
last_name: Haller
- first_name: Mahmoud
full_name: Rabie, Mahmoud
last_name: Rabie
- first_name: Manfred
full_name: Mark, Manfred
last_name: Mark
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Russell
full_name: Hart, Russell
last_name: Hart
- first_name: Katharina
full_name: Lauber, Katharina
last_name: Lauber
- first_name: Guido
full_name: Pupillo, Guido
last_name: Pupillo
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
citation:
ama: Haller E, Rabie M, Mark M, et al. Three-body correlation functions and recombination
rates for bosons in three dimensions and one dimension. Physical Review Letters.
2011;107(23). doi:10.1103/PhysRevLett.107.230404
apa: Haller, E., Rabie, M., Mark, M., Danzl, J. G., Hart, R., Lauber, K., … Nägerl,
H. (2011). Three-body correlation functions and recombination rates for bosons
in three dimensions and one dimension. Physical Review Letters. American
Physical Society. https://doi.org/10.1103/PhysRevLett.107.230404
chicago: Haller, Elmar, Mahmoud Rabie, Manfred Mark, Johann G Danzl, Russell Hart,
Katharina Lauber, Guido Pupillo, and Hanns Nägerl. “Three-Body Correlation Functions
and Recombination Rates for Bosons in Three Dimensions and One Dimension.” Physical
Review Letters. American Physical Society, 2011. https://doi.org/10.1103/PhysRevLett.107.230404.
ieee: E. Haller et al., “Three-body correlation functions and recombination
rates for bosons in three dimensions and one dimension,” Physical Review Letters,
vol. 107, no. 23. American Physical Society, 2011.
ista: Haller E, Rabie M, Mark M, Danzl JG, Hart R, Lauber K, Pupillo G, Nägerl H.
2011. Three-body correlation functions and recombination rates for bosons in three
dimensions and one dimension. Physical Review Letters. 107(23).
mla: Haller, Elmar, et al. “Three-Body Correlation Functions and Recombination Rates
for Bosons in Three Dimensions and One Dimension.” Physical Review Letters,
vol. 107, no. 23, American Physical Society, 2011, doi:10.1103/PhysRevLett.107.230404.
short: E. Haller, M. Rabie, M. Mark, J.G. Danzl, R. Hart, K. Lauber, G. Pupillo,
H. Nägerl, Physical Review Letters 107 (2011).
date_created: 2018-12-11T11:49:54Z
date_published: 2011-12-02T00:00:00Z
date_updated: 2021-01-12T06:47:57Z
day: '02'
doi: 10.1103/PhysRevLett.107.230404
extern: '1'
external_id:
arxiv:
- '1107.4516'
intvolume: ' 107'
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1107.4516
month: '12'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '6335'
status: public
title: Three-body correlation functions and recombination rates for bosons in three
dimensions and one dimension
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 107
year: '2011'
...
---
_id: '12649'
abstract:
- lang: eng
text: Physically based hydrological models describe natural processes more accurately
than conceptual models but require extensive data sets to produce accurate results.
To identify the value of different data sets for improving the performance of
the distributed hydrological model TOPKAPI we combine a multivariable validation
technique with Monte Carlo simulations. The study is carried out in the snow and
ice-dominated Rhonegletscher basin, as these types of mountainous basins are generally
the most critical with respect to data availability and sensitivity to climate
fluctuations. Each observational data set is used individually and in combination
with the other data sets to determine a subset of best parameter combinations
out of 10,000 Monte Carlos runs performed with randomly generated parameter sets.
We validate model results against discharge, glacier mass balance, and satellite
snow cover images for a 14 year time period (1994–2007). While the use of all
data sets combined provides the best overall model performance (defined by the
concurrent best agreement of simulated discharge, snow cover and mass balance
with their respective measurements), the use of one or two variables for constraining
the model results in poorer performance. Using only one data set for constraining
the model glacier mass balance proved to be the most efficient observation leading
to the best overall model performance. Our main result is that a combination of
discharge and satellite snow cover images is best for improving model performance,
since the volumetric information of discharge data and the spatial information
of snow cover images are complementary.
article_number: W07519
article_processing_charge: No
article_type: original
author:
- first_name: David
full_name: Finger, David
last_name: Finger
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: Markus
full_name: Konz, Markus
last_name: Konz
- first_name: Stefan
full_name: Rimkus, Stefan
last_name: Rimkus
- first_name: Paolo
full_name: Burlando, Paolo
last_name: Burlando
citation:
ama: Finger D, Pellicciotti F, Konz M, Rimkus S, Burlando P. The value of glacier
mass balance, satellite snow cover images, and hourly discharge for improving
the performance of a physically based distributed hydrological model. Water
Resources Research. 2011;47(7). doi:10.1029/2010wr009824
apa: Finger, D., Pellicciotti, F., Konz, M., Rimkus, S., & Burlando, P. (2011).
The value of glacier mass balance, satellite snow cover images, and hourly discharge
for improving the performance of a physically based distributed hydrological model.
Water Resources Research. American Geophysical Union. https://doi.org/10.1029/2010wr009824
chicago: Finger, David, Francesca Pellicciotti, Markus Konz, Stefan Rimkus, and
Paolo Burlando. “The Value of Glacier Mass Balance, Satellite Snow Cover Images,
and Hourly Discharge for Improving the Performance of a Physically Based Distributed
Hydrological Model.” Water Resources Research. American Geophysical Union,
2011. https://doi.org/10.1029/2010wr009824.
ieee: D. Finger, F. Pellicciotti, M. Konz, S. Rimkus, and P. Burlando, “The value
of glacier mass balance, satellite snow cover images, and hourly discharge for
improving the performance of a physically based distributed hydrological model,”
Water Resources Research, vol. 47, no. 7. American Geophysical Union, 2011.
ista: Finger D, Pellicciotti F, Konz M, Rimkus S, Burlando P. 2011. The value of
glacier mass balance, satellite snow cover images, and hourly discharge for improving
the performance of a physically based distributed hydrological model. Water Resources
Research. 47(7), W07519.
mla: Finger, David, et al. “The Value of Glacier Mass Balance, Satellite Snow Cover
Images, and Hourly Discharge for Improving the Performance of a Physically Based
Distributed Hydrological Model.” Water Resources Research, vol. 47, no.
7, W07519, American Geophysical Union, 2011, doi:10.1029/2010wr009824.
short: D. Finger, F. Pellicciotti, M. Konz, S. Rimkus, P. Burlando, Water Resources
Research 47 (2011).
date_created: 2023-02-20T08:18:03Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2023-02-20T10:39:57Z
day: '01'
doi: 10.1029/2010wr009824
extern: '1'
intvolume: ' 47'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2010WR009824
month: '07'
oa: 1
oa_version: Published Version
publication: Water Resources Research
publication_identifier:
issn:
- 0043-1397
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: The value of glacier mass balance, satellite snow cover images, and hourly
discharge for improving the performance of a physically based distributed hydrological
model
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2011'
...
---
_id: '12651'
abstract:
- lang: eng
text: Temperature data from three Automatic Weather Stations and twelve Temperature
Loggers are used to investigate the spatiotemporal variability of temperature
over a glacier, its main atmospheric controls, the suitability of extrapolation
techniques and their effect on melt modeling. We use data collected on Juncal
Norte Glacier, central Chile, during one ablation season. We examine temporal
and spatial variability in lapse rates (LRs), together with alternative statistical
interpolation methods. The main control over the glacier thermal regime is the
development of a katabatic boundary layer (KBL). Katabatic wind occurs at night
and in the morning and is eroded in the afternoon. LRs reveal strong diurnal variability,
with steeper LRs during the day when the katabatic wind weakens and shallower
LRs during the night and morning. We suggest that temporally variable LRs should
be used to account for the observed change. They tend to be steeper than equivalent
constant LRs, and therefore result in a reduction in simulated melt compared to
use of constant LRs when extrapolating from lower to higher elevations. In addition
to the temporal variability, the temperature-elevation relationship varies also
in space. Differences are evident between local LRs and including such variability
in melt modeling affects melt simulations. Extrapolation methods based on the
spatial variability of the observations after removal of the elevation trend,
such as Inverse Distance Weighting or Kriging, do not seem necessary for simulations
of gridded temperature data over a glacier.
article_number: D23109
article_processing_charge: No
article_type: original
author:
- first_name: L.
full_name: Petersen, L.
last_name: Petersen
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: 'Petersen L, Pellicciotti F. Spatial and temporal variability of air temperature
on a melting glacier: Atmospheric controls, extrapolation methods and their effect
on melt modeling, Juncal Norte Glacier, Chile. Journal of Geophysical Research:
Atmospheres. 2011;116(D23). doi:10.1029/2011jd015842'
apa: 'Petersen, L., & Pellicciotti, F. (2011). Spatial and temporal variability
of air temperature on a melting glacier: Atmospheric controls, extrapolation methods
and their effect on melt modeling, Juncal Norte Glacier, Chile. Journal of
Geophysical Research: Atmospheres. American Geophysical Union. https://doi.org/10.1029/2011jd015842'
chicago: 'Petersen, L., and Francesca Pellicciotti. “Spatial and Temporal Variability
of Air Temperature on a Melting Glacier: Atmospheric Controls, Extrapolation Methods
and Their Effect on Melt Modeling, Juncal Norte Glacier, Chile.” Journal of
Geophysical Research: Atmospheres. American Geophysical Union, 2011. https://doi.org/10.1029/2011jd015842.'
ieee: 'L. Petersen and F. Pellicciotti, “Spatial and temporal variability of air
temperature on a melting glacier: Atmospheric controls, extrapolation methods
and their effect on melt modeling, Juncal Norte Glacier, Chile,” Journal of
Geophysical Research: Atmospheres, vol. 116, no. D23. American Geophysical
Union, 2011.'
ista: 'Petersen L, Pellicciotti F. 2011. Spatial and temporal variability of air
temperature on a melting glacier: Atmospheric controls, extrapolation methods
and their effect on melt modeling, Juncal Norte Glacier, Chile. Journal of Geophysical
Research: Atmospheres. 116(D23), D23109.'
mla: 'Petersen, L., and Francesca Pellicciotti. “Spatial and Temporal Variability
of Air Temperature on a Melting Glacier: Atmospheric Controls, Extrapolation Methods
and Their Effect on Melt Modeling, Juncal Norte Glacier, Chile.” Journal of
Geophysical Research: Atmospheres, vol. 116, no. D23, D23109, American Geophysical
Union, 2011, doi:10.1029/2011jd015842.'
short: 'L. Petersen, F. Pellicciotti, Journal of Geophysical Research: Atmospheres
116 (2011).'
date_created: 2023-02-20T08:18:14Z
date_published: 2011-12-16T00:00:00Z
date_updated: 2023-02-20T10:29:44Z
day: '16'
doi: 10.1029/2011jd015842
extern: '1'
intvolume: ' 116'
issue: D23
keyword:
- Paleontology
- Space and Planetary Science
- Earth and Planetary Sciences (miscellaneous)
- Atmospheric Science
- Earth-Surface Processes
- Geochemistry and Petrology
- Soil Science
- Water Science and Technology
- Ecology
- Aquatic Science
- Forestry
- Oceanography
- Geophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2011JD01584
month: '12'
oa: 1
oa_version: Published Version
publication: 'Journal of Geophysical Research: Atmospheres'
publication_identifier:
issn:
- 0148-0227
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Spatial and temporal variability of air temperature on a melting glacier:
Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal
Norte Glacier, Chile'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 116
year: '2011'
...
---
_id: '12652'
abstract:
- lang: eng
text: We explore the robustness and transferability of parameterizations of cloud
radiative forcing used in glacier melt models at two sites in the Swiss Alps.
We also look at the rationale behind some of the most commonly used approaches,
and explore the relationship between cloud transmittance and several standard
meteorological variables. The 2 m air-temperature diurnal range is the best predictor
of variations in cloud transmittance. However, linear and exponential parameterizations
can only explain 30–50% of the observed variance in computed cloud transmittance
factors. We examine the impact of modelled cloud transmittance factors on both
solar radiation and ablation rates computed with an enhanced temperature-index
model. The melt model performance decreases when modelled radiation is used, the
reduction being due to an underestimation of incoming solar radiation on clear-sky
days. The model works well under overcast conditions. We also seek alternatives
to the use of in situ ground data. However, outputs from an atmospheric model
(2.2 km horizontal resolution) do not seem to provide an alternative to the parameterizations
of cloud radiative forcing based on observations of air temperature at glacier
automatic weather stations. Conversely, the correct definition of overcast conditions
is important.
article_processing_charge: No
article_type: original
author:
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: Thomas
full_name: Raschle, Thomas
last_name: Raschle
- first_name: Thomas
full_name: Huerlimann, Thomas
last_name: Huerlimann
- first_name: Marco
full_name: Carenzo, Marco
last_name: Carenzo
- first_name: Paolo
full_name: Burlando, Paolo
last_name: Burlando
citation:
ama: 'Pellicciotti F, Raschle T, Huerlimann T, Carenzo M, Burlando P. Transmission
of solar radiation through clouds on melting glaciers: A comparison of parameterizations
and their impact on melt modelling. Journal of Glaciology. 2011;57(202):367-381.
doi:10.3189/002214311796406013'
apa: 'Pellicciotti, F., Raschle, T., Huerlimann, T., Carenzo, M., & Burlando,
P. (2011). Transmission of solar radiation through clouds on melting glaciers:
A comparison of parameterizations and their impact on melt modelling. Journal
of Glaciology. Cambridge University Press. https://doi.org/10.3189/002214311796406013'
chicago: 'Pellicciotti, Francesca, Thomas Raschle, Thomas Huerlimann, Marco Carenzo,
and Paolo Burlando. “Transmission of Solar Radiation through Clouds on Melting
Glaciers: A Comparison of Parameterizations and Their Impact on Melt Modelling.”
Journal of Glaciology. Cambridge University Press, 2011. https://doi.org/10.3189/002214311796406013.'
ieee: 'F. Pellicciotti, T. Raschle, T. Huerlimann, M. Carenzo, and P. Burlando,
“Transmission of solar radiation through clouds on melting glaciers: A comparison
of parameterizations and their impact on melt modelling,” Journal of Glaciology,
vol. 57, no. 202. Cambridge University Press, pp. 367–381, 2011.'
ista: 'Pellicciotti F, Raschle T, Huerlimann T, Carenzo M, Burlando P. 2011. Transmission
of solar radiation through clouds on melting glaciers: A comparison of parameterizations
and their impact on melt modelling. Journal of Glaciology. 57(202), 367–381.'
mla: 'Pellicciotti, Francesca, et al. “Transmission of Solar Radiation through Clouds
on Melting Glaciers: A Comparison of Parameterizations and Their Impact on Melt
Modelling.” Journal of Glaciology, vol. 57, no. 202, Cambridge University
Press, 2011, pp. 367–81, doi:10.3189/002214311796406013.'
short: F. Pellicciotti, T. Raschle, T. Huerlimann, M. Carenzo, P. Burlando, Journal
of Glaciology 57 (2011) 367–381.
date_created: 2023-02-20T08:18:21Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2023-02-20T09:47:00Z
day: '01'
doi: 10.3189/002214311796406013
extern: '1'
intvolume: ' 57'
issue: '202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3189/002214311796406013
month: '03'
oa: 1
oa_version: Published Version
page: 367-381
publication: Journal of Glaciology
publication_identifier:
eissn:
- 1727-5652
issn:
- 0022-1430
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Transmission of solar radiation through clouds on melting glaciers: A comparison
of parameterizations and their impact on melt modelling'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2011'
...
---
_id: '969'
abstract:
- lang: eng
text: We investigate the isotope effect on the London penetration depth of a superconductor
which measures n S/m*, the ratio of superfluid density to effective mass. We use
a simplified model of electrons weakly coupled to a single phonon frequency ω
E, but assume that the energy gap Δ does not have any isotope effect. Nevertheless,
we find an isotope effect for n S/m* which is significant if Δ is sufficiently
large that it becomes comparable to ω E, a regime of interest to high-T c cuprate
superconductors and possibly other families of unconventional superconductors
with relatively high T c. Our model is too simple to describe the cuprates and
it gives the wrong sign of the isotope effect when compared with experiment, but
it is a proof of principle that the isotope effect exists for n S/m* in materials
where the pairing gap and T c are not of phonon origin and have no isotope effect.
author:
- first_name: Maksym
full_name: Maksym Serbyn
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Patrick
full_name: Lee, Patrick
last_name: Lee
citation:
ama: Serbyn M, Lee P. Isotope effect on the superfluid density in conventional and
high-temperature superconductors. Physical Review B - Condensed Matter and
Materials Physics. 2011;83(2). doi:10.1103/PhysRevB.83.024506
apa: Serbyn, M., & Lee, P. (2011). Isotope effect on the superfluid density
in conventional and high-temperature superconductors. Physical Review B - Condensed
Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.83.024506
chicago: Serbyn, Maksym, and Patrick Lee. “Isotope Effect on the Superfluid Density
in Conventional and High-Temperature Superconductors.” Physical Review B -
Condensed Matter and Materials Physics. American Physical Society, 2011. https://doi.org/10.1103/PhysRevB.83.024506.
ieee: M. Serbyn and P. Lee, “Isotope effect on the superfluid density in conventional
and high-temperature superconductors,” Physical Review B - Condensed Matter
and Materials Physics, vol. 83, no. 2. American Physical Society, 2011.
ista: Serbyn M, Lee P. 2011. Isotope effect on the superfluid density in conventional
and high-temperature superconductors. Physical Review B - Condensed Matter and
Materials Physics. 83(2).
mla: Serbyn, Maksym, and Patrick Lee. “Isotope Effect on the Superfluid Density
in Conventional and High-Temperature Superconductors.” Physical Review B -
Condensed Matter and Materials Physics, vol. 83, no. 2, American Physical
Society, 2011, doi:10.1103/PhysRevB.83.024506.
short: M. Serbyn, P. Lee, Physical Review B - Condensed Matter and Materials Physics
83 (2011).
date_created: 2018-12-11T11:49:28Z
date_published: 2011-01-19T00:00:00Z
date_updated: 2021-01-12T08:22:19Z
day: '19'
doi: 10.1103/PhysRevB.83.024506
extern: 1
intvolume: ' 83'
issue: '2'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1009.2429
month: '01'
oa: 1
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
publist_id: '6434'
quality_controlled: 0
status: public
title: Isotope effect on the superfluid density in conventional and high-temperature
superconductors
type: journal_article
volume: 83
year: '2011'
...
---
_id: '9762'
abstract:
- lang: eng
text: Defining population structure and genetic diversity levels is of the utmost
importance for developing efficient conservation strategies. Overfishing has caused
mean annual catches of the European spiny lobster (Palinurus elephas) to decrease
alarmingly along its distribution area. In this context, there is a need for comprehensive
studies to evaluate the genetic health of the exploited populations. The present
work is based on a set of 10 nuclear markers amplified in 331 individuals from
10 different localities covering most of P. elephas distribution area. Samples
from Atlantic and Mediterranean basins showed small but significant differences,
indicating that P. elephas populations do not behave as a single panmictic unit
but form two partially-overlapping groups. Despite intense overfishing, our dataset
did not recover a recent bottleneck signal, and showed a large and stable historical
effective size instead. This result could be accounted for by specific life history
traits (reproduction and longevity) and the limitations of molecular markers in
covering very recent timescales for non temporal samples. Our study emphasizes
the necessity of integrating information on effective population sizes and life
history parameters when evaluating population connectivity levels from genetic
data.
article_processing_charge: No
author:
- first_name: Ferran
full_name: Palero, Ferran
id: 3F0E2A22-F248-11E8-B48F-1D18A9856A87
last_name: Palero
orcid: 0000-0002-0343-8329
- first_name: Pere
full_name: Abello, Pere
last_name: Abello
- first_name: Enrique
full_name: Macpherson, Enrique
last_name: Macpherson
- first_name: Mark
full_name: Beaumont, Mark
last_name: Beaumont
- first_name: Marta
full_name: Pascual, Marta
last_name: Pascual
citation:
ama: 'Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. Data from: Effect
of oceanographic barriers and overfishing on the population genetic structure
of the European spiny lobster (Palinurus elephas). 2011. doi:10.5061/dryad.299h8'
apa: 'Palero, F., Abello, P., Macpherson, E., Beaumont, M., & Pascual, M. (2011).
Data from: Effect of oceanographic barriers and overfishing on the population
genetic structure of the European spiny lobster (Palinurus elephas). IST Austria.
https://doi.org/10.5061/dryad.299h8'
chicago: 'Palero, Ferran, Pere Abello, Enrique Macpherson, Mark Beaumont, and Marta
Pascual. “Data from: Effect of Oceanographic Barriers and Overfishing on the Population
Genetic Structure of the European Spiny Lobster (Palinurus Elephas).” IST Austria,
2011. https://doi.org/10.5061/dryad.299h8.'
ieee: 'F. Palero, P. Abello, E. Macpherson, M. Beaumont, and M. Pascual, “Data from:
Effect of oceanographic barriers and overfishing on the population genetic structure
of the European spiny lobster (Palinurus elephas).” IST Austria, 2011.'
ista: 'Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. 2011. Data from:
Effect of oceanographic barriers and overfishing on the population genetic structure
of the European spiny lobster (Palinurus elephas), IST Austria, 10.5061/dryad.299h8.'
mla: 'Palero, Ferran, et al. Data from: Effect of Oceanographic Barriers and
Overfishing on the Population Genetic Structure of the European Spiny Lobster
(Palinurus Elephas). IST Austria, 2011, doi:10.5061/dryad.299h8.'
short: F. Palero, P. Abello, E. Macpherson, M. Beaumont, M. Pascual, (2011).
date_created: 2021-08-02T07:11:19Z
date_published: 2011-05-12T00:00:00Z
date_updated: 2023-02-23T11:25:25Z
day: '12'
department:
- _id: NiBa
doi: 10.5061/dryad.299h8
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.299h8
month: '05'
oa: 1
oa_version: Published Version
publisher: IST Austria
related_material:
record:
- id: '3395'
relation: used_in_publication
status: public
status: public
title: 'Data from: Effect of oceanographic barriers and overfishing on the population
genetic structure of the European spiny lobster (Palinurus elephas)'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2011'
...
---
_id: '9943'
abstract:
- lang: eng
text: Segmentation is the process of partitioning digital images into meaningful
regions. The analysis of biological high content images often requires segmentation
as a first step. We propose ilastik as an easy-to-use tool which allows the user
without expertise in image processing to perform segmentation and classification
in a unified way. ilastik learns from labels provided by the user through a convenient
mouse interface. Based on these labels, ilastik infers a problem specific segmentation.
A random forest classifier is used in the learning step, in which each pixel's
neighborhood is characterized by a set of generic (nonlinear) features. ilastik
supports up to three spatial plus one spectral dimension and makes use of all
dimensions in the feature calculation. ilastik provides realtime feedback that
enables the user to interactively refine the segmentation result and hence further
fine-tune the classifier. An uncertainty measure guides the user to ambiguous
regions in the images. Real time performance is achieved by multi-threading which
fully exploits the capabilities of modern multi-core machines. Once a classifier
has been trained on a set of representative images, it can be exported and used
to automatically process a very large number of images (e.g. using the CellProfiler
pipeline). ilastik is an open source project and released under the BSD license
at www.ilastik.org.
article_processing_charge: No
author:
- first_name: Christoph M
full_name: Sommer, Christoph M
id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
last_name: Sommer
orcid: 0000-0003-1216-9105
- first_name: Christoph
full_name: Straehle, Christoph
last_name: Straehle
- first_name: Ullrich
full_name: Köthe, Ullrich
last_name: Köthe
- first_name: Fred A.
full_name: Hamprecht, Fred A.
last_name: Hamprecht
citation:
ama: 'Sommer CM, Straehle C, Köthe U, Hamprecht FA. Ilastik: Interactive learning
and segmentation toolkit. In: 2011 IEEE International Symposium on Biomedical
Imaging: From Nano to Micro. Institute of Electrical and Electronics Engineers;
2011. doi:10.1109/isbi.2011.5872394'
apa: 'Sommer, C. M., Straehle, C., Köthe, U., & Hamprecht, F. A. (2011). Ilastik:
Interactive learning and segmentation toolkit. In 2011 IEEE International Symposium
on Biomedical Imaging: from Nano to Micro. Chicago, Illinois, USA: Institute
of Electrical and Electronics Engineers. https://doi.org/10.1109/isbi.2011.5872394'
chicago: 'Sommer, Christoph M, Christoph Straehle, Ullrich Köthe, and Fred A. Hamprecht.
“Ilastik: Interactive Learning and Segmentation Toolkit.” In 2011 IEEE International
Symposium on Biomedical Imaging: From Nano to Micro. Institute of Electrical
and Electronics Engineers, 2011. https://doi.org/10.1109/isbi.2011.5872394.'
ieee: 'C. M. Sommer, C. Straehle, U. Köthe, and F. A. Hamprecht, “Ilastik: Interactive
learning and segmentation toolkit,” in 2011 IEEE International Symposium on
Biomedical Imaging: from Nano to Micro, Chicago, Illinois, USA, 2011.'
ista: 'Sommer CM, Straehle C, Köthe U, Hamprecht FA. 2011. Ilastik: Interactive
learning and segmentation toolkit. 2011 IEEE International Symposium on Biomedical
Imaging: from Nano to Micro. ISBI: International Symposium on Biomedical Imaging.'
mla: 'Sommer, Christoph M., et al. “Ilastik: Interactive Learning and Segmentation
Toolkit.” 2011 IEEE International Symposium on Biomedical Imaging: From Nano
to Micro, Institute of Electrical and Electronics Engineers, 2011, doi:10.1109/isbi.2011.5872394.'
short: 'C.M. Sommer, C. Straehle, U. Köthe, F.A. Hamprecht, in:, 2011 IEEE International
Symposium on Biomedical Imaging: From Nano to Micro, Institute of Electrical and
Electronics Engineers, 2011.'
conference:
end_date: 2011-04-02
location: Chicago, Illinois, USA
name: 'ISBI: International Symposium on Biomedical Imaging'
start_date: 2011-03-30
date_created: 2021-08-19T11:49:58Z
date_published: 2011-06-09T00:00:00Z
date_updated: 2023-02-23T14:13:38Z
day: '09'
department:
- _id: Bio
doi: 10.1109/isbi.2011.5872394
extern: '1'
keyword:
- image segmentation
- biomedical imaging
- three dimensional displays
- neurons
- retina
- observers
- image color analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.researchgate.net/publication/224241106_Ilastik_Interactive_learning_and_segmentation_toolkit
month: '06'
oa: 1
oa_version: Preprint
publication: '2011 IEEE International Symposium on Biomedical Imaging: from Nano to
Micro'
publication_identifier:
eissn:
- 1945-8452
isbn:
- 978-1-4244-4127-3
issn:
- 1945-7928
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
status: public
title: 'Ilastik: Interactive learning and segmentation toolkit'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2011'
...
---
_id: '3345'
abstract:
- lang: eng
text: We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy
parity objectives. In system design, the parity objective is used to encode ω-regular
specifications, and the mean-payoff and energy objectives can be used to model
quantitative resource constraints. The energy condition re- quires that the resource
level never drops below 0, and the mean-payoff condi- tion requires that the limit-average
value of the resource consumption is within a threshold. While these two (energy
and mean-payoff) classical conditions are equivalent for two-player games, we
show that they differ for MDPs. We show that the problem of deciding whether a
state is almost-sure winning (i.e., winning with probability 1) in energy parity
MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable
in polynomial time, improving a recent PSPACE bound.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes.
In: Vol 6907. Springer; 2011:206-218. doi:10.1007/978-3-642-22993-0_21'
apa: 'Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov
Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical
Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity
Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
ieee: 'K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision
Processes,” presented at the MFCS: Mathematical Foundations of Computer Science,
Warsaw, Poland, 2011, vol. 6907, pp. 206–218.'
ista: 'Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision
Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907,
206–218.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity
Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.
short: K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
conference:
end_date: 2011-08-26
location: Warsaw, Poland
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2011-08-22
date_created: 2018-12-11T12:02:48Z
date_published: 2011-09-28T00:00:00Z
date_updated: 2023-02-23T12:23:59Z
day: '28'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22993-0_21
external_id:
arxiv:
- '1104.2909'
intvolume: ' 6907'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2909
month: '09'
oa: 1
oa_version: Preprint
page: 206 - 218
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3276'
quality_controlled: '1'
related_material:
record:
- id: '5387'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Energy and mean-payoff parity Markov Decision Processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6907
year: '2011'
...
---
_id: '3346'
abstract:
- lang: eng
text: We study Markov decision processes (MDPs) with multiple limit-average (or
mean-payoff) functions. We consider two different objectives, namely, expectation
and satisfaction objectives. Given an MDP with k reward functions, in the expectation
objective the goal is to maximize the expected limit-average value, and in the
satisfaction objective the goal is to maximize the probability of runs such that
the limit-average value stays above a given vector. We show that under the expectation
objective, in contrast to the single-objective case, both randomization and memory
are necessary for strategies, and that finite-memory randomized strategies are
sufficient. Under the satisfaction objective, in contrast to the single-objective
case, infinite memory is necessary for strategies, and that randomized memoryless
strategies are sufficient for epsilon-approximation, for all epsilon>;0. We
further prove that the decision problems for both expectation and satisfaction
objectives can be solved in polynomial time and the trade-off curve (Pareto curve)
can be epsilon-approximated in time polynomial in the size of the MDP and 1/epsilon,
and exponential in the number of reward functions, for all epsilon>;0. Our
results also reveal flaws in previous work for MDPs with multiple mean-payoff
functions under the expectation objective, correct the flaws and obtain improved
results.
article_number: '5970225'
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Václav
full_name: Brožek, Václav
last_name: Brožek
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
citation:
ama: 'Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple
mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:10.1109/LICS.2011.10'
apa: 'Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011).
Two views on multiple mean payoff objectives in Markov Decision Processes. Presented
at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10'
chicago: Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and
Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision
Processes.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.10.
ieee: 'T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views
on multiple mean payoff objectives in Markov Decision Processes,” presented at
the LICS: Logic in Computer Science, Toronto, Canada, 2011.'
ista: 'Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on
multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer
Science, 5970225.'
mla: Brázdil, Tomáš, et al. Two Views on Multiple Mean Payoff Objectives in Markov
Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10.
short: T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.
conference:
end_date: 2011-06-24
location: Toronto, Canada
name: 'LICS: Logic in Computer Science'
start_date: 2011-06-21
date_created: 2018-12-11T12:02:48Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2021-01-12T07:42:49Z
day: '21'
department:
- _id: KrCh
doi: 10.1109/LICS.2011.10
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.3489
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3275'
quality_controlled: '1'
scopus_import: 1
status: public
title: Two views on multiple mean payoff objectives in Markov Decision Processes
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3347'
abstract:
- lang: eng
text: 'The class of omega-regular languages provides a robust specification language
in verification. Every omega-regular condition can be decomposed into a safety
part and a liveness part. The liveness part ensures that something good happens
"eventually". Finitary liveness was proposed by Alur and Henzinger as
a stronger formulation of liveness. It requires that there exists an unknown,
fixed bound b such that something good happens within b transitions. In this work
we consider automata with finitary acceptance conditions defined by finitary Buchi,
parity and Streett languages. We study languages expressible by such automata:
we give their topological complexity and present a regular-expression characterization.
We compare the expressive power of finitary automata and give optimal algorithms
for classical decisions questions. We show that the finitary languages are Sigma
2-complete; we present a complete picture of the expressive power of various classes
of automata with finitary and infinitary acceptance conditions; we show that the
languages defined by finitary parity automata exactly characterize the star-free
fragment of omega B-regular languages; and we show that emptiness is NLOGSPACE-complete
and universality as well as language inclusion are PSPACE-complete for finitary
parity and Streett automata.'
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nathanaël
full_name: Fijalkow, Nathanaël
id: A1B5DD72-E997-11E9-8398-E808B6C6ADC0
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226.
doi:10.1007/978-3-642-21254-3_16'
apa: 'Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638,
pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications,
Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26.
Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16.
ieee: 'K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA:
Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638,
pp. 216–226.'
ista: 'Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata
Theory and Applications, LNCS, vol. 6638, 216–226.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages.
Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16.
short: K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.
conference:
end_date: 2011-05-31
location: Tarragona, Spain
name: 'LATA: Language and Automata Theory and Applications'
start_date: 2011-05-26
date_created: 2018-12-11T12:02:48Z
date_published: 2011-06-16T00:00:00Z
date_updated: 2021-01-12T07:42:50Z
day: '16'
department:
- _id: KrCh
doi: 10.1007/978-3-642-21254-3_16
external_id:
arxiv:
- '1101.1727'
intvolume: ' 6638'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1101.1727
month: '06'
oa: 1
oa_version: Preprint
page: 216 - 226
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '3274'
quality_controlled: '1'
scopus_import: 1
status: public
title: Finitary languages
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6638
year: '2011'
...
---
_id: '3348'
abstract:
- lang: eng
text: We study synthesis of controllers for real-time systems, where the objective
is to stay in a given safe set. The problem is solved by obtaining winning strategies
in the setting of concurrent two-player timed automaton games with safety objectives.
To prevent a player from winning by blocking time, we restrict each player to
strategies that ensure that the player cannot be responsible for causing a zeno
run. We construct winning strategies for the controller which require access only
to (1) the system clocks (thus, controllers which require their own internal infinitely
precise clocks are not necessary), and (2) a linear (in the number of clocks)
number of memory bits. Precisely, we show that for safety objectives, a memory
of size (3 · |C|+lg(|C|+1)) bits suffices for winning controller strategies, where
C is the set of clocks of the timed automaton game, significantly improving the
previous known exponential bound. We also settle the open question of whether
winning region controller strategies require memory for safety objectives by showing
with an example the necessity of memory for region strategies to win for safety
objectives.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers
for safety objectives. In: Springer; 2011:221-230. doi:10.1145/1967701.1967734'
apa: 'Chatterjee, K., & Prabhu, V. (2011). Synthesis of memory efficient real
time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid
Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734'
chicago: Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient
Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734.
ieee: 'K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers
for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and
Control, Chicago, USA, 2011, pp. 221–230.'
ista: 'Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers
for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.'
mla: Chatterjee, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient
Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734.
short: K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.
conference:
end_date: 2011-04-14
location: Chicago, USA
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2011-04-12
date_created: 2018-12-11T12:02:49Z
date_published: 2011-01-31T00:00:00Z
date_updated: 2021-01-12T07:42:50Z
day: '31'
department:
- _id: KrCh
doi: 10.1145/1967701.1967734
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1101.5842
month: '01'
oa: 1
oa_version: Submitted Version
page: 221 - 230
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '3273'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesis of memory efficient real time controllers for safety objectives
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3349'
abstract:
- lang: eng
text: 'Games on graphs provide a natural model for reactive non-terminating systems.
In such games, the interaction of two players on an arena results in an infinite
path that describes a run of the system. Different settings are used to model
various open systems in computer science, as for instance turn-based or concurrent
moves, and deterministic or stochastic transitions. In this paper, we are interested
in turn-based games, and specifically in deterministic parity games and stochastic
reachability games (also known as simple stochastic games). We present a simple,
direct and efficient reduction from deterministic parity games to simple stochastic
games: it yields an arena whose size is linear up to a logarithmic factor in size
of the original arena.'
alternative_title:
- EPTCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nathanaël
full_name: Fijalkow, Nathanaël
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic
games. In: Vol 54. EPTCS; 2011:74-86. doi:10.4204/EPTCS.54.6'
apa: 'Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to
simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games,
Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity
Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
ieee: 'K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic
games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification,
Minori, Italy, 2011, vol. 54, pp. 74–86.'
ista: 'Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic
games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54,
74–86.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity
Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6.
short: K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.
conference:
end_date: 2011-06-17
location: Minori, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2011-06-15
date_created: 2018-12-11T12:02:49Z
date_published: 2011-06-04T00:00:00Z
date_updated: 2021-01-12T07:42:51Z
day: '04'
department:
- _id: KrCh
doi: 10.4204/EPTCS.54.6
intvolume: ' 54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1106.1232
month: '06'
oa: 1
oa_version: Submitted Version
page: 74 - 86
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: EPTCS
publist_id: '3272'
scopus_import: 1
status: public
title: A reduction from parity games to simple stochastic games
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2011'
...
---
_id: '3351'
abstract:
- lang: eng
text: In two-player games on graph, the players construct an infinite path through
the game graph and get a reward computed by a payoff function over infinite paths.
Over weighted graphs, the typical and most studied payoff functions compute the
limit-average or the discounted sum of the rewards along the path. Besides their
simple definition, these two payoff functions enjoy the property that memoryless
optimal strategies always exist. In an attempt to construct other simple payoff
functions, we define a class of payoff functions which compute an (infinite) weighted
average of the rewards. This new class contains both the limit-average and the
discounted sum functions, and we show that they are the only members of this class
which induce memoryless optimal strategies, showing that there is essentially
no other simple payoff functions.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: 'Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In:
Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:10.1007/978-3-642-22953-4_13'
apa: 'Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative
objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159).
Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer.
https://doi.org/10.1007/978-3-642-22953-4_13'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless
Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle,
6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
ieee: 'K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,”
presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011,
vol. 6914, pp. 148–159.'
ista: 'Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives.
FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.'
mla: Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives.
Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.
short: K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.),
Springer, 2011, pp. 148–159.
conference:
end_date: 2011-08-25
location: Oslo, Norway
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2011-08-22
date_created: 2018-12-11T12:02:50Z
date_published: 2011-04-16T00:00:00Z
date_updated: 2021-01-12T07:42:52Z
day: '16'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22953-4_13
editor:
- first_name: Olaf
full_name: Owe, Olaf
last_name: Owe
- first_name: Martin
full_name: Steffen, Martin
last_name: Steffen
- first_name: Jan Arne
full_name: Telle, Jan Arne
last_name: Telle
intvolume: ' 6914'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.3211
month: '04'
oa: 1
oa_version: Submitted Version
page: 148 - 159
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3270'
quality_controlled: '1'
scopus_import: 1
status: public
title: On memoryless quantitative objectives
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6914
year: '2011'
...
---
_id: '3353'
abstract:
- lang: eng
text: 'Compositional theories are crucial when designing large and complex systems
from smaller components. In this work we propose such a theory for synchronous
concurrent systems. Our approach follows so-called interface theories, which use
game-theoretic interpretations of composition and refinement. These are appropriate
for systems with distinct inputs and outputs, and explicit conditions on inputs
that must be enforced during composition. Our interfaces model systems that execute
in an infinite sequence of synchronous rounds. At each round, a contract must
be satisfied. The contract is simply a relation specifying the set of valid input/output
pairs. Interfaces can be composed by parallel, serial or feedback composition.
A refinement relation between interfaces is defined, and shown to have two main
properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability,
namely, the ability to replace an interface by another one in any context. Shared
refinement and abstraction operators, corresponding to greatest lower and least
upper bounds with respect to refinement, are also defined. Input-complete interfaces,
that impose no restrictions on inputs, and deterministic interfaces, that produce
a unique output for any legal input, are discussed as special cases, and an interesting
duality between the two classes is exposed. A number of illustrative examples
are provided, as well as algorithms to compute compositions, check refinement,
and so on, for finite-state interfaces.'
article_number: '14'
author:
- first_name: Stavros
full_name: Tripakis, Stavros
last_name: Tripakis
- first_name: Ben
full_name: Lickly, Ben
last_name: Lickly
- 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: Edward
full_name: Lee, Edward
last_name: Lee
citation:
ama: Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational
interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS).
2011;33(4). doi:10.1145/1985342.1985345
apa: Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory
of synchronous relational interfaces. ACM Transactions on Programming Languages
and Systems (TOPLAS). ACM. https://doi.org/10.1145/1985342.1985345
chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory
of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages
and Systems (TOPLAS). ACM, 2011. https://doi.org/10.1145/1985342.1985345.
ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous
relational interfaces,” ACM Transactions on Programming Languages and Systems
(TOPLAS), vol. 33, no. 4. ACM, 2011.
ista: Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational
interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4),
14.
mla: Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”
ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33,
no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.
short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming
Languages and Systems (TOPLAS) 33 (2011).
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2021-01-12T07:42:52Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1145/1985342.1985345
ec_funded: 1
file:
- access_level: open_access
checksum: 5d44a8aa81e33210649beae507602138
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:45Z
date_updated: 2020-07-14T12:46:09Z
file_id: '5235'
file_name: IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf
file_size: 775662
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
intvolume: ' 33'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: ACM Transactions on Programming Languages and Systems (TOPLAS)
publication_status: published
publisher: ACM
publist_id: '3263'
pubrep_id: '85'
quality_controlled: '1'
scopus_import: 1
status: public
title: A theory of synchronous relational interfaces
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2011'
...
---
_id: '3355'
abstract:
- lang: eng
text: Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of
distributed systems. They enable systems to tolerate arbitrary failures in a bounded
number of nodes. BFT protocols are usually proven correct for certain safety and
liveness properties. However, recent studies have shown that the performance of
state-of-the-art BFT protocols decreases drastically in the presence of even a
single malicious node. This motivates a formal quantitative analysis of BFT protocols
to investigate their performance characteristics under different scenarios. We
present HyPerf, a new hybrid methodology based on model checking and simulation
techniques for evaluating the performance of BFT protocols. We build a transition
system corresponding to a BFT protocol and systematically explore the set of behaviors
allowed by the protocol. We associate certain timing information with different
operations in the protocol, like cryptographic operations and message transmission.
After an elaborate state exploration, we use the time information to evaluate
the performance characteristics of the protocol using simulation techniques. We
integrate our framework in Mace, a tool for building and verifying distributed
systems. We evaluate the performance of PBFT using our framework. We describe
two different use-cases of our methodology. For the benign operation of the protocol,
we use the time information as random variables to compute the probability distribution
of the execution times. In the presence of faults, we estimate the worst-case
performance of the protocol for various attacks that can be employed by malicious
nodes. Our results show the importance of hybrid techniques in systematically
analyzing the performance of large-scale systems.
author:
- first_name: Raluca
full_name: Halalai, Raluca
id: 584C6850-E996-11E9-805B-F01764644770
last_name: Halalai
- 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: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols.
In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40'
apa: 'Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation
of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation
of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40'
chicago: Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation
of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.
ieee: 'R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT
protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen,
Germany, 2011, pp. 255–264.'
ista: 'Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols.
QEST: Quantitative Evaluation of Systems, 255–264.'
mla: Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE,
2011, pp. 255–64, doi:10.1109/QEST.2011.40.
short: R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.
conference:
end_date: 2011-09-08
location: Aachen, Germany
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2011-09-05
date_created: 2018-12-11T12:02:51Z
date_published: 2011-10-13T00:00:00Z
date_updated: 2021-01-12T07:42:53Z
day: '13'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1109/QEST.2011.40
file:
- access_level: open_access
checksum: 4dc8750ab7921f51de992000b13d1b01
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:49Z
date_updated: 2020-07-14T12:46:09Z
file_id: '4648'
file_name: IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf
file_size: 272017
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 255 - 264
publication_status: published
publisher: IEEE
publist_id: '3260'
pubrep_id: '84'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative evaluation of BFT protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3356'
abstract:
- lang: eng
text: There is recently a significant effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions, aiming for a general and flexible
framework for quantitative-oriented specifications. In the heart of quantitative
objectives lies the accumulation of values along a computation. It is either the
accumulated summation, as with the energy objectives, or the accumulated average,
as with the mean-payoff objectives. We investigate the extension of temporal logics
with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
a numeric variable of the system, c is a constant rational number, and Sum(v)
and Avg(v) denote the accumulated sum and average of the values of v from the
beginning of the computation up to the current point of time. We also allow the
path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
to the average value along an entire computation. We study the border of decidability
for extensions of various temporal logics. In particular, we show that extending
the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
prefix-accumulation assertions and extending LTL with path-accumulation assertions,
result in temporal logics whose model-checking problem is decidable. The extended
logics allow to significantly extend the currently known energy and mean-payoff
objectives. Moreover, the prefix-accumulation assertions may be refined with "controlled-accumulation",
allowing, for example, to specify constraints on the average waiting time between
a request and a grant. On the negative side, we show that the fragment we point
to is, in a sense, the maximal logic whose extension with prefix-accumulation
assertions permits a decidable model-checking procedure. Extending a temporal
logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
problem undecidable.
article_number: '5970226'
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications
with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33'
apa: 'Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal
specifications with accumulative values. Presented at the LICS: Logic in Computer
Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33'
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
“Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
ieee: 'U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications
with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto,
Canada, 2011.'
ista: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
with accumulative values. LICS: Logic in Computer Science, 5970226.'
mla: Boker, Udi, et al. Temporal Specifications with Accumulative Values.
5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
conference:
end_date: 2011-06-24
location: Toronto, Canada
name: 'LICS: Logic in Computer Science'
start_date: 2011-06-21
date_created: 2018-12-11T12:02:52Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2023-02-23T12:23:54Z
day: '21'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1109/LICS.2011.33
ec_funded: 1
file:
- access_level: open_access
checksum: 792128f5455f0f40f1105f0398e05fa9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:42Z
date_updated: 2020-07-14T12:46:09Z
file_id: '4960'
file_name: IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf
file_size: 225426
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3259'
pubrep_id: '83'
related_material:
record:
- id: '2038'
relation: later_version
status: public
- id: '5385'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Temporal specifications with accumulative values
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3358'
abstract:
- lang: eng
text: The static scheduling problem often arises as a fundamental problem in real-time
systems and grid computing. We consider the problem of statically scheduling a
large job expressed as a task graph on a large number of computing nodes, such
as a data center. This paper solves the large-scale static scheduling problem
using abstraction refinement, a technique commonly used in formal verification
to efficiently solve computationally hard problems. A scheduler based on abstraction
refinement first attempts to solve the scheduling problem with abstract representations
of the job and the computing resources. As abstract representations are generally
small, the scheduling can be done reasonably fast. If the obtained schedule does
not meet specified quality conditions (like data center utilization or schedule
makespan) then the scheduler refines the job and data center abstractions and,
again solves the scheduling problem. We develop different schedulers based on
abstraction refinement. We implemented these schedulers and used them to schedule
task graphs from various computing domains on simulated data centers with realistic
topologies. We compared the speed of scheduling and the quality of the produced
schedules with our abstraction refinement schedulers against a baseline scheduler
that does not use any abstraction. We conclude that abstraction refinement techniques
give a significant speed-up compared to traditional static scheduling heuristics,
at a reasonable cost in the quality of the produced schedules. We further used
our static schedulers in an actual system that we deployed on Amazon EC2 and compared
it against the Hadoop dynamic scheduler for large MapReduce jobs. Our experiments
indicate that there is great potential for static scheduling techniques.
article_processing_charge: No
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: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction
refinement. In: ACM; 2011:329-342. doi:10.1145/1966445.1966476'
apa: 'Henzinger, T. A., Singh, V., Wies, T., & Zufferey, D. (2011). Scheduling
large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys,
Salzburg, Austria: ACM. https://doi.org/10.1145/1966445.1966476'
chicago: Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling
Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/10.1145/1966445.1966476.
ieee: T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs
by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011,
pp. 329–342.
ista: Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by
abstraction refinement. EuroSys, 329–342.
mla: Henzinger, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement.
ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476.
short: T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
conference:
end_date: 2011-04-13
location: Salzburg, Austria
name: EuroSys
start_date: 2011-04-10
date_created: 2018-12-11T12:02:53Z
date_published: 2011-04-10T00:00:00Z
date_updated: 2021-01-12T07:42:55Z
day: '10'
department:
- _id: ToHe
doi: 10.1145/1966445.1966476
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf
month: '04'
oa: 1
oa_version: Published Version
page: 329 - 342
publication_status: published
publisher: ACM
publist_id: '3257'
quality_controlled: '1'
scopus_import: 1
status: public
title: Scheduling large jobs by abstraction refinement
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3360'
abstract:
- lang: eng
text: 'A discounted-sum automaton (NDA) is a nondeterministic finite automaton with
edge weights, which values a run by the discounted sum of visited edge weights.
More precisely, the weight in the i-th position of the run is divided by lambda^i,
where the discount factor lambda is a fixed rational number greater than 1. Discounted
summation is a common and useful measuring scheme, especially for infinite sequences,
which reflects the assumption that earlier weights are more important than later
weights. Determinizing automata is often essential, for example, in formal verification,
where there are polynomial algorithms for comparing two deterministic NDAs, while
the equivalence problem for NDAs is not known to be decidable. Unfortunately,
however, discounted-sum automata are, in general, not determinizable: it is currently
known that for every rational discount factor 1 < lambda < 2, there is an
NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive
news, showing that every NDA with an integral factor is determinizable. We also
complete the picture by proving that the integers characterize exactly the discount
factors that guarantee determinizability: we show that for every non-integral
rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove
that the class of NDAs with integral discount factors enjoys closure under the
algebraic operations min, max, addition, and subtraction, which is not the case
for general NDAs nor for deterministic NDAs. This shows that for integral discount
factors, the class of NDAs forms an attractive specification formalism in quantitative
formal verification. All our results hold equally for automata over finite words
and for automata over infinite words. '
alternative_title:
- LIPIcs
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: 'Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12.
Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82'
apa: 'Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata
(Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway:
Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82'
chicago: Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,”
12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82.
ieee: 'U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented
at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.'
ista: 'Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL:
Computer Science Logic, LIPIcs, vol. 12, 82–96.'
mla: Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata.
Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82.
short: U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
conference:
end_date: 2011-09-15
location: Bergen, Norway
name: 'CSL: Computer Science Logic'
start_date: 2011-09-12
date_created: 2018-12-11T12:02:53Z
date_published: 2011-08-31T00:00:00Z
date_updated: 2021-01-12T07:42:56Z
day: '31'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CSL.2011.82
ec_funded: 1
file:
- access_level: open_access
checksum: 250603c6be8ccad4fbd4d7b24221f0ee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:17Z
date_updated: 2020-07-14T12:46:10Z
file_id: '4803'
file_name: IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf
file_size: 504270
relation: main_file
file_date_updated: 2020-07-14T12:46:10Z
has_accepted_license: '1'
intvolume: ' 12'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 82 - 96
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '3255'
pubrep_id: '82'
quality_controlled: '1'
scopus_import: 1
status: public
title: Determinizing discounted-sum automata
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2011'
...