559 research outputs found

    Determinising Parity Automata

    Full text link
    Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a small constant. Moreover, the lower bound refers to the more liberal Streett acceptance. We thus show that determinisation to Streett would not lead to better bounds than determinisation to parity. As a side-result, this optimality extends to the determinisation of B\"uchi automata

    Sparse Positional Strategies for Safety Games

    Full text link
    We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning strategy for one of the players is used as a certificate or as an artefact for further processing in the application. Small such certificates, i.e., strategies that can be written down very compactly, are typically preferred. For safety games, we only need to consider positional strategies. These map game positions of a player onto a move that is to be taken by the player whenever the play enters that position. For representing positional strategies compactly, a common goal is to minimize the number of positions for which a winning player's move needs to be defined such that the game is still won by the same player, without visiting a position with an undefined next move. We call winning strategies in which the next move is defined for few of the player's positions sparse. Unfortunately, even roughly approximating the density of the sparsest strategy for a safety game has been shown to be NP-hard. Thus, to obtain sparse strategies in practice, one either has to apply some heuristics, or use some exhaustive search technique, like ILP (integer linear programming) solving. In this paper, we perform a comparative study of currently available methods to obtain sparse winning strategies for the safety player in safety games. We consider techniques from common knowledge, such as using ILP or SAT (satisfiability) solving, and a novel technique based on iterative linear programming. The results of this paper tell us if current techniques are already scalable enough for practical use.Comment: In Proceedings SYNT 2012, arXiv:1207.055

    Land Use Problems and Conflicts in the U.S.

    Get PDF
    Land Use Problems and Conflicts in the U.S

    Reviews, Critiques, and Annotations

    Get PDF

    Special issue on Temporal Representation and Reasoning (TIME 2017)

    Get PDF
    peer reviewe

    Polymodal activation of the TREK-2 K2P channel produces structurally distinct open states.

    Get PDF
    The TREK subfamily of two-pore domain (K2P) K+ channels exhibit polymodal gating by a wide range of physical and chemical stimuli. Crystal structures now exist for these channels in two main states referred to as the “up” and “down” conformations. However, recent studies have resulted in contradictory and mutually exclusive conclusions about the functional (i.e., conductive) status of these two conformations. To address this problem, we have used the state-dependent TREK-2 inhibitor norfluoxetine that can only bind to the down state, thereby allowing us to distinguish between these two conformations when activated by different stimuli. Our results reconcile these previously contradictory gating models by demonstrating that activation by pressure, temperature, voltage, and pH produce more than one structurally distinct open state and reveal that channel activation does not simply involve switching between the up and down conformations. These results also highlight the diversity of structural mechanisms that K2P channels use to integrate polymodal gating signals

    Groundwater depletion embedded in international food trade

    Get PDF
    Recent hydrological modelling1 and Earth observations2,3 have located and quantified alarming rates of groundwater depletion worldwide. This depletion is primarily due to water withdrawals for irrigation1,2,4, but its connection with the main driver of irrigation, global food consumption, has not yet been explored. Here we show that approximately eleven per cent of non-renewable groundwater use for irrigation is embedded in international food trade, of which two-thirds are exported by Pakistan, the USA and India alone. Our quantification of groundwater depletion embedded in the world’s food trade is based on a combination of global, cropspecific estimates of non-renewable groundwater abstraction and international food trade data. A vast majority of the world’s population lives in countries sourcing nearly all their staple crop imports from partners who deplete groundwater to produce these crops, highlighting risks for global food and water security. Some countries, such as the USA, Mexico, Iran and China, are particularly exposed to these risks because they both produce and import food irrigated from rapidly depleting aquifers. Our results could help to improve the sustainability of global food production and groundwater resource management by identifying priority regions and agricultural products at risk as well as the end consumers of these products
    corecore