82,494 research outputs found
On the Economic Value and Price-Responsiveness of Ramp-Constrained Storage
The primary concerns of this paper are twofold: to understand the economic
value of storage in the presence of ramp constraints and exogenous electricity
prices, and to understand the implications of the associated optimal storage
management policy on qualitative and quantitative characteristics of storage
response to real-time prices. We present an analytic characterization of the
optimal policy, along with the associated finite-horizon time-averaged value of
storage. We also derive an analytical upperbound on the infinite-horizon
time-averaged value of storage. This bound is valid for any achievable
realization of prices when the support of the distribution is fixed, and
highlights the dependence of the value of storage on ramp constraints and
storage capacity. While the value of storage is a non-decreasing function of
price volatility, due to the finite ramp rate, the value of storage saturates
quickly as the capacity increases, regardless of volatility. To study the
implications of the optimal policy, we first present computational experiments
that suggest that optimal utilization of storage can, in expectation, induce a
considerable amount of price elasticity near the average price, but little or
no elasticity far from it. We then present a computational framework for
understanding the behavior of storage as a function of price and the amount of
stored energy, and for characterization of the buy/sell phase transition region
in the price-state plane. Finally, we study the impact of market-based
operation of storage on the required reserves, and show that the reserves may
need to be expanded to accommodate market-based storage
Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures
This paper concerns branching simulation for weighted Kripke structures with
parametric weights. Concretely, we consider a weighted extension of branching
simulation where a single transitions can be matched by a sequence of
transitions while preserving the branching behavior. We relax this notion to
allow for a small degree of deviation in the matching of weights, inducing a
directed distance on states. The distance between two states can be used
directly to relate properties of the states within a sub-fragment of weighted
CTL. The problem of relating systems thus changes to minimizing the distance
which, in the general parametric case, corresponds to finding suitable
parameter valuations such that one system can approximately simulate another.
Although the distance considers a potentially infinite set of transition
sequences we demonstrate that there exists an upper bound on the length of
relevant sequences, thereby establishing the computability of the distance.Comment: In Proceedings Cassting'16/SynCoP'16, arXiv:1608.0017
Compositional bisimulation metric reasoning with Probabilistic Process Calculi
We study which standard operators of probabilistic process calculi allow for
compositional reasoning with respect to bisimulation metric semantics. We argue
that uniform continuity (generalizing the earlier proposed property of
non-expansiveness) captures the essential nature of compositional reasoning and
allows now also to reason compositionally about recursive processes. We
characterize the distance between probabilistic processes composed by standard
process algebra operators. Combining these results, we demonstrate how
compositional reasoning about systems specified by continuous process algebra
operators allows for metric assume-guarantee like performance validation
Ergodicity versus non-ergodicity for Probabilistic Cellular Automata on rooted trees
In this article we study a class of shift-invariant and positive rate
probabilistic cellular automata (PCA) on rooted d-regular trees .
In a first result we extend the results of [10] on trees, namely we prove
that to every stationary measure of the PCA we can associate a space-time
Gibbs measure on
. Under certain assumptions on the dynamics
the converse is also true.
A second result concerns proving sufficient conditions for ergodicity and
non-ergodicity of our PCA on d-ary trees for and
characterizing the invariant product Bernoulli measures.Comment: 17 page
Measure, Topology and Probabilistic Reasoning in Cosmology
I explain the difficulty of making various concepts of and relating to
probability precise, rigorous and physically significant when attempting to
apply them in reasoning about objects (e.g., spacetimes) living in
infinite-dimensional spaces, working through many examples from cosmology. I
focus on the relation of topological to measure-theoretic notions of and
relating to probability, how they diverge in unpleasant ways in the
infinite-dimensional case, and are difficult to work with on their own as well
in that context. Even in cases where an appropriate family of spacetimes is
finite-dimensional, however, and so admits a measure of the relevant sort, it
is always the case that the family is not a compact topological space, and so
does not admit a physically significant, well behaved probability measure.
Problems of a different but still deeply troubling sort plague arguments about
likelihood in that context, which I also discuss. I conclude that most standard
forms of argument used in cosmology to estimate the likelihood of the
occurrence of various properties or behaviors of spacetimes have serious
mathematical, physical and conceptual problems.Comment: 26 page
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
Cellular automata (CAs) are dynamical systems which exhibit complex global
behavior from simple local interaction and computation. Since the inception of
cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention
of several researchers over various backgrounds and fields for modelling
different physical, natural as well as real-life phenomena. Classically, CAs
are uniform. However, non-uniformity has also been introduced in update
pattern, lattice structure, neighborhood dependency and local rule. In this
survey, we tour to the various types of CAs introduced till date, the different
characterization tools, the global behaviors of CAs, like universality,
reversibility, dynamics etc. Special attention is given to non-uniformity in
CAs and especially to non-uniform elementary CAs, which have been very useful
in solving several real-life problems.Comment: 43 pages; Under review in Natural Computin
- …