Near-Optimal Scheduling for LTL with Future Discounting

We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the unit interval [0, 1]). The precise problem we study---it naturally arises e.g. in search for a scheduler that recovers from an internal error state as soon as possible---is the following: given a Kripke frame, a formula and a number in [0, 1] called a margin, find a path of the Kripke frame that is optimal with respect to the formula up to the prescribed margin (a truly optimal path may not exist). We present an algorithm for the problem; it works even in the extended setting with propositional quality operators, a setting where (threshold) model-checking is known to be undecidable

Discounting in LTL

In recent years, there is growing need and interest in formalizing and reasoning about the quality of software and hardware systems. As opposed to traditional verification, where one handles the question of whether a system satisfies, or not, a given specification, reasoning about quality addresses the question of \emph{how well} the system satisfies the specification. One direction in this effort is to refine the "eventually" operators of temporal logic to {\em discounting operators}: the satisfaction value of a specification is a value in $[0,1]$, where the longer it takes to fulfill eventuality requirements, the smaller the satisfaction value is. In this paper we introduce an augmentation by discounting of Linear Temporal Logic (LTL), and study it, as well as its combination with propositional quality operators. We show that one can augment LTL with an arbitrary set of discounting functions, while preserving the decidability of the model-checking problem. Further augmenting the logic with unary propositional quality operators preserves decidability, whereas adding an average-operator makes some problems undecidable. We also discuss the complexity of the problem, as well as various extensions

Containment and equivalence of weighted automata: Probabilistic and max-plus cases

This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps from words to real values. Given two weighted automata, the equivalence problem asks whether their semantics are the same, and the containment problem whether one is point-wise smaller than the other one. These problems have been studied intensively and this paper will review some techniques used to show (un)decidability and state a list of open questions that still remain

A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details

Today’s compilers have a plethora of optimizations-transformations to choose from, and the correct choice, order as well parameters of transformations have a significant/large impact on performance; choosing the correct order and parameters of optimizations has been a long standing problem in compilation research, which until now remains unsolved; the separate sub-problems optimization gives a different schedule/binary for each sub-problem and these schedules cannot coexist, as by refining one degrades the other. Researchers try to solve this problem by using iterative compilation techniques but the search space is so big that it cannot be searched even by using modern supercomputers. Moreover, compiler transformations do not take into account the hardware architecture details and data reuse in an efficient way. In this paper, a new iterative compilation methodology is presented which reduces the search space of six compiler transformations by addressing the above problems; the search space is reduced by many orders of magnitude and thus an efficient solution is now capable to be found. The transformations are the following: loop tiling (including the number of the levels of tiling), loop unroll, register allocation, scalar replacement, loop interchange and data array layouts. The search space is reduced (a) by addressing the aforementioned transformations together as one problem and not separately, (b) by taking into account the custom hardware architecture details (e.g., cache size and associativity) and algorithm characteristics (e.g., data reuse). The proposed methodology has been evaluated over iterative compilation and gcc/icc compilers, on both embedded and general purpose processors; it achieves significant performance gains at many orders of magnitude lower compilation time

The Semialgebraic Orbit Problem

The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the problem comprises a dimension d in N, a square matrix A in Q^{d x d}, and semialgebraic source and target sets S,T subseteq R^d. The question is whether there exists x in S and n in N such that A^nx in T. The main result of this paper is that the Semialgebraic Orbit Problem is decidable for dimension d <= 3. Our decision procedure relies on separation bounds for algebraic numbers as well as a classical result of transcendental number theory - Baker's theorem on linear forms in logarithms of algebraic numbers. We moreover argue that our main result represents a natural limit to what can be decided (with respect to reachability) about the orbit of a single matrix. On the one hand, semialgebraic sets are arguably the largest general class of subsets of R^d for which membership is decidable. On the other hand, previous work has shown that in dimension d=4, giving a decision procedure for the special case of the Orbit Problem with singleton source set S and polytope target set T would entail major breakthroughs in Diophantine approximation.</p

Prompt interval temporal logic

Interval temporal logics are expressive formalisms for temporal representation and reasoning, which use time intervals as primitive temporal entities. They have been extensively studied for the past two decades and successfully applied in AI and computer science. Unfortunately, they lack the ability of expressing promptness conditions, as it happens with the commonly-used temporal logics, e.g., LTL: whenever we deal with a liveness request, such as \u201csomething good eventually happens\u201d, there is no way to impose a bound on the delay with which it is fulfilled. In the last years, such an issue has been addressed in automata theory, game theory, and temporal logic. In this paper, we approach it in the interval temporal logic setting. First, we introduce PROMPT-PNL, a prompt extension of the well-studied interval temporal logic PNL, and we prove the undecidability of its satisfiability problem; then, we show how to recover decidability (NEXPTIME-completeness) by imposing a natural syntactic restriction on it

Kinetic regulation of multi-ligand binding proteins

Background: Second messengers, such as calcium, regulate the activity of multisite binding proteins in a concentration-dependent manner. For example, calcium binding has been shown to induce conformational transitions in the calcium-dependent protein calmodulin, under steady state conditions. However, intracellular concentrations of these second messengers are often subject to rapid change. The mechanisms underlying dynamic ligand-dependent regulation of multisite proteins require further elucidation. Results: In this study, a computational analysis of multisite protein kinetics in response to rapid changes in ligand concentrations is presented. Two major physiological scenarios are investigated: i) Ligand concentration is abundant and the ligand-multisite protein binding does not affect free ligand concentration, ii) Ligand concentration is of the same order of magnitude as the interacting multisite protein concentration and does not change. Therefore, buffering effects significantly influence the amounts of free ligands. For each of these scenarios the influence of the number of binding sites, the temporal effects on intermediate apo- and fully saturated conformations and the multisite regulatory effects on target proteins are investigated. Conclusions: The developed models allow for a novel and accurate interpretation of concentration and pressure jump-dependent kinetic experiments. The presented model makes predictions for the temporal distribution of multisite protein conformations in complex with variable numbers of ligands. Furthermore, it derives the characteristic time and the dynamics for the kinetic responses elicited by a ligand concentration change as a function of ligand concentration and the number of ligand binding sites. Effector proteins regulated by multisite ligand binding are shown to depend on ligand concentration in a highly nonlinear fashion

Historical perspectives on pastoralism and land tenure transformation in Ngamiland, Botswana: What are the policy and institutional lessons?

Pastoral societies in dryland Africa continue to face changes to their pastoral systems. These systems are influenced by a range of historical factors but little use is made of this information to design policies that suit pastoralists’ landscapes. This article provides a synthesis of historical perspectives on pastoral land use and tenure transformations in Ngamiland, south of the Okavango Delta, Botswana. Little documentation of herders’ historical perspectives exists and less is known about how past experiences can be applied to sustainable pastoralism policies. In this article, current land use pressing issues are examined and analysed within the context of past experiences. We use a series of oral histories with key informants, focus group discussions, expert interviews and rangelands field observations. Ngamiland historical perspectives depict a pastoral landscape that has been shaped by a variety of factors; livestock diseases, Human-wildlife-conflicts, droughts, land tenure transformations associated with rangeland policies and the pastoral identity of the Ovaherero/Ovambanderu ethnic groups. Pastoralists have followed unique trajectories, specific to their rangeland conditions and socio-cultural context. Resilience to climate shocks and diseases has been weakened by inequitable patterns of control over rangeland resources. We recommend institutional diversity such that from experiences of the past, lessons can be drawn of the sort of processes and institutions required for pastoralism policies including targeted pastoralists’ adaptations. Using pastoralists to provide information, especially in the area of indigenous knowledge, strategies can be developed to link conservation of wildlife and rangelands with pastoral production by developing ecologically-sensitive low-volume tourism that pastoral communities can tap in to diversify their livelihoods

Sedimentology, Provenance and Radiometric Dating of the Silante Formation: Implications for the Cenozoic Evolution of the Western Andes of Ecuador

The Silante Formation is a thick series of continental deposits, exposed along a trench-parallel distance of approximately 300 km within the Western Cordillera of Ecuador. The origin, tectonic setting, age and stratigraphic relationships are poorly known, although these are key to understand the Cenozoic evolution of the Ecuadorian Andes. We present new sedimentological, stratigraphic, petrographic, radiometric and provenance data from the Silante Formation and underlying rocks. The detailed stratigraphic analysis shows that the Silante Formation unconformably overlies Paleocene submarine fan deposits of the Pilalo Formation, which was coeval with submarine tholeiitic volcanism. The lithofacies of the Silante Formation suggest that the sediments were deposited in a debris flow dominated alluvial fan. Provenance analysis including heavy mineral assemblages and detrital zircon U-Pb ages indicate that sediments of the Silante Formation were derived from the erosion of a continental, calc-alkaline volcanic arc, pointing to the Oligocene to Miocene San Juan de Lachas volcanic arc. Thermochronological data and regional correlations suggest that deposition of the Silante Formation was coeval with regional rock and surface uplift of the Andean margin that deposited alluvial fans in intermontane and back-arc domains