Model Checking Probabilistic Pushdown Automata

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model checking for this class of properties and pPDA is decidable. Then we show that model checking for the qualitative fragment of the logic PCTL and pPDA is also decidable. Moreover, we develop an error-tolerant model checking algorithm for PCTL and the subclass of stateless pPDA. Finally, we consider the class of omega-regular properties and show that both qualitative and quantitative model checking for pPDA is decidable

Upper ocean climate of the Eastern Mediterranean Sea during the Holocene Insolation Maximum – a model study

ine thousand years ago (9 ka BP), the Northern Hemisphere experienced enhanced seasonality caused by an orbital configuration close to the minimum of the precession index. To assess the impact of this "Holocene Insolation Maximum" (HIM) on the Mediterranean Sea, we use a regional ocean general circulation model forced by atmospheric input derived from global simulations. A stronger seasonal cycle is simulated by the model, which shows a relatively homogeneous winter cooling and a summer warming with well-defined spatial patterns, in particular, a subsurface warming in the Cretan and western Levantine areas. The comparison between the SST simulated for the HIM and a reconstruction from planktonic foraminifera transfer functions shows a poor agreement, especially for summer, when the vertical temperature gradient is strong. As a novel approach, we propose a reinterpretation of the reconstruction, to consider the conditions throughout the upper water column rather than at a single depth. We claim that such a depth-integrated approach is more adequate for surface temperature comparison purposes in a situation where the upper ocean structure in the past was different from the present-day. In this case, the depth-integrated interpretation of the proxy data strongly improves the agreement between modelled and reconstructed temperature signal with the subsurface summer warming being recorded by both model and proxies, with a small shift to the south in the model results. The mechanisms responsible for the peculiar subsurface pattern are found to be a combination of enhanced downwelling and wind mixing due to strengthened Etesian winds, and enhanced thermal forcing due to the stronger summer insolation in the Northern Hemisphere. Together, these processes induce a stronger heat transfer from the surface to the subsurface during late summer in the western Levantine; this leads to an enhanced heat piracy in this region, a process never identified before, but potentially characteristic of time slices with enhanced insolation

Arithmetic complexity via effective names for random sequences

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr, and Kurtz random sets, weakly 1-generics and their complementary classes, we find that there exist characterizations of the third and fourth levels of the arithmetic hierarchy purely in terms of these notions. More generally, there exists an equivalence between arithmetic complexity and existence of numberings for classes of left-r.e. sets with shift-persistent elements. While some classes (such as Martin-L\"{o}f randoms and Kurtz non-randoms) have left-r.e. numberings, there is no canonical, or acceptable, left-r.e. numbering for any class of left-r.e. randoms. Finally, we note some fundamental differences between left-r.e. numberings for sets and reals

Tableaux for Policy Synthesis for MDPs with PCTL* Constraints

Markov decision processes (MDPs) are the standard formalism for modelling sequential decision making in stochastic environments. Policy synthesis addresses the problem of how to control or limit the decisions an agent makes so that a given specification is met. In this paper we consider PCTL*, the probabilistic counterpart of CTL*, as the specification language. Because in general the policy synthesis problem for PCTL* is undecidable, we restrict to policies whose execution history memory is finitely bounded a priori. Surprisingly, no algorithm for policy synthesis for this natural and expressive framework has been developed so far. We close this gap and describe a tableau-based algorithm that, given an MDP and a PCTL* specification, derives in a non-deterministic way a system of (possibly nonlinear) equalities and inequalities. The solutions of this system, if any, describe the desired (stochastic) policies. Our main result in this paper is the correctness of our method, i.e., soundness, completeness and termination.Comment: This is a long version of a conference paper published at TABLEAUX 2017. It contains proofs of the main results and fixes a bug. See the footnote on page 1 for detail

Priming Older Adults and People with Alzheimer’s Disease Analogical Problem Solving with True and False Memories

We investigated the extent to which activation of specific information in associative networks during a memory task could facilitate subsequent analogical problem solving in healthy older adults as well as those with early onset Alzheimer’s disease. We also examined whether these priming effects were stronger when the activation of the critical solution term during the memory task occurred when the item was actually presented (true memories) or when this item arose due to spreading activation to a related but nonpresented item (false memory). Older adult controls (OACs) and people with Alzheimer’s disease (AD) were asked to solve 9 verbal proportional analogies, 3 of which had been primed by Deese/Roediger-McDermott lists where the critical lure (and problem solution) was presented as a word in the list (true memory), 3 of which were primed by DRM lists whose critical lures were spontaneously activated during list presentation (false memory), and 3 of which were unprimed. As expected, OACs were better (both in terms of speed and accuracy) at solving problems than people with AD and both groups were better when false memories were primes than when true memories were primes or there were no primes. There were no reliable differences between unprimed and true prime problems. These findings demonstrate that (a) priming of problem solutions extends to verbal proportional analogies in OACs and people with AD, (b) false memories are more effective at priming problem solutions than true memories, and (c) there are clear positive consequences to the production of false memories

Universal fluctuations in subdiffusive transport

Subdiffusive transport in tilted washboard potentials is studied within the fractional Fokker-Planck equation approach, using the associated continuous time random walk (CTRW) framework. The scaled subvelocity is shown to obey a universal law, assuming the form of a stationary Levy-stable distribution. The latter is defined by the index of subdiffusion alpha and the mean subvelocity only, but interestingly depends neither on the bias strength nor on the specific form of the potential. These scaled, universal subvelocity fluctuations emerge due to the weak ergodicity breaking and are vanishing in the limit of normal diffusion. The results of the analytical heuristic theory are corroborated by Monte Carlo simulations of the underlying CTRW

A note on the differences of computably enumerable reals

We show that given any non-computable left-c.e. real α there exists a left-c.e. real β such that α≠β+γ for all left-c.e. reals and all right-c.e. reals γ. The proof is non-uniform, the dichotomy being whether the given real α is Martin-Loef random or not. It follows that given any universal machine U, there is another universal machine V such that the halting probability of U is not a translation of the halting probability of V by a left-c.e. real. We do not know if there is a uniform proof of this fact

Magnetoresistance of a two-dimensional electron gas with spatially periodic lateral modulations: Exact consequences of Boltzmann's equation

On the basis of Boltzmann's equation, and including anisotropic scattering in the collision operator, we investigate the effect of one-dimensional superlattices on two-dimensional electron systems. In addition to superlattices defined by static electric and magnetic fields, we consider mobility superlattices describing a spatially modulated density of scattering centers. We prove that magnetic and electric superlattices in $x$-direction affect only the resistivity component $\rho_{xx}$ if the mobility is homogeneous, whereas a mobility lattice in $x$-direction in the absence of electric and magnetic modulations affects only $\rho_{yy}$. Solving Boltzmann's equation numerically, we calculate the positive magnetoresistance in weak magnetic fields and the Weiss oscillations in stronger fields within a unified approach.Comment: submitted to PR