65,406 research outputs found
The exit-time problem for a Markov jump process
The purpose of this paper is to consider the exit-time problem for a
finite-range Markov jump process, i.e, the distance the particle can jump is
bounded independent of its location. Such jump diffusions are expedient models
for anomalous transport exhibiting super-diffusion or nonstandard normal
diffusion. We refer to the associated deterministic equation as a
volume-constrained nonlocal diffusion equation. The volume constraint is the
nonlocal analogue of a boundary condition necessary to demonstrate that the
nonlocal diffusion equation is well-posed and is consistent with the jump
process. A critical aspect of the analysis is a variational formulation and a
recently developed nonlocal vector calculus. This calculus allows us to pose
nonlocal backward and forward Kolmogorov equations, the former equation
granting the various moments of the exit-time distribution.Comment: 15 pages, 7 figure
Dynamic Matching and Weaving Semantics in \lambda -Calculus
In this chapter, we present a denotational semantics for aspect matching and weaving in lambda-calculus. The proposed semantics is based on the so-called Continuation-Passing Style (CPS) since this style of semantics provides a precise, accurate, and elegant description of aspect-oriented mechanisms. We first formalize semantics for a core language based on lambda-calculus. Afterwards, we extend the semantics by considering flow-based pointcuts, such as control flow and data flow that are important from a security perspective
The Power of Proofs: New Algorithms for Timed Automata Model Checking (with Appendix)
This paper presents the first model-checking algorithm for an expressive
modal mu-calculus over timed automata, , and reports performance results for an implementation.
This mu-calculus contains extended time-modality operators and can express all
of TCTL. Our algorithmic approach uses an "on-the-fly" strategy based on proof
search as a means of ensuring high performance for both positive and negative
answers to model-checking questions. In particular, a set of proof rules for
solving model-checking problems are given and proved sound and complete; we
encode our algorithm in these proof rules and model-check a property by
constructing a proof (or showing none exists) using these rules. One noteworthy
aspect of our technique is that we show that verification performance can be
improved with \emph{derived rules}, whose correctness can be inferred from the
more primitive rules on which they are based. In this paper, we give the basic
proof rules underlying our method, describe derived proof rules to improve
performance, and compare our implementation of this model checker to the UPPAAL
tool.Comment: This is the preprint of the FORMATS 2014 paper, but this is the full
version, containing the Appendix. The final publication is published from
Springer, and is available at
http://link.springer.com/chapter/10.1007%2F978-3-319-10512-3_9 on the
Springer webpag
- …