TY - CONF
AB - Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Edelsbrunner, Herbert
AU - Henzinger, Thomas A
AU - Rannou, Philippe
ID - 3853
TI - Mean-payoff automaton expressions
VL - 6269
ER -
TY - JOUR
AB - Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). The uniformization technique is an efficient method to compute probability distributions of a CTMC if the number of states is manageable. However, the size of a CTMC that represents a biochemical reaction network is usually far beyond what is feasible. In this paper we present an on-the-fly variant of uniformization, where we improve the original algorithm at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks.
AU - Didier, Frédéric
AU - Henzinger, Thomas A
AU - Mateescu, Maria
AU - Wolf, Verena
ID - 3842
IS - 6
JF - IET Systems Biology
TI - Fast adaptive uniformization of the chemical master equation
VL - 4
ER -
TY - CONF
AB - We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Gimbert, Hugo
AU - Henzinger, Thomas A
ID - 3856
TI - Randomness for free
VL - 6281
ER -
TY - CONF
AB - We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have com- plete view of the game). We survey the complexity results for the problem of de- ciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
ID - 3858
TI - The complexity of partial-observation parity games
VL - 6397
ER -
TY - CONF
AB - In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
AU - Raskin, Jean
ID - 3860
TI - Generalized mean-payoff and energy games
VL - 8
ER -
TY - CONF
AB - Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
AU - Singh, Rohit
ID - 3864
TI - Measuring and synthesizing systems in probabilistic environments
VL - 6174
ER -
TY - CONF
AB - Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.
AU - Bloem, Roderick
AU - Chatterjee, Krishnendu
AU - Greimel, Karin
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
ED - Touili, Tayssir
ED - Cook, Byron
ED - Jackson, Paul
ID - 3866
TI - Robustness in the presence of liveness
VL - 6174
ER -
TY - JOUR
AB - Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of the language-inclusion problem remains open for some classes of weighted automata, we introduce a notion of quantitative simulation that is decidable and implies language inclusion. We also give a complete characterization of the expressive power of the various classes of weighted automata. In particular, we show that most classes of weighted automata cannot be determinized.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 3862
IS - 4
JF - ACM Transactions on Computational Logic (TOCL)
TI - Quantitative languages
VL - 11
ER -
TY - JOUR
AB - We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to acontinuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can bevisualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchicalalgorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, thedual complexes are geometrically realized in $R^3$ and can thus be used to construct level and interlevel sets. We apply these tools tostudy 3-dimensional images of plant root systems.
AU - Bendich, Paul
AU - Edelsbrunner, Herbert
AU - Kerber, Michael
ID - 3901
IS - 6
JF - IEEE Transactions of Visualization and Computer Graphics
TI - Computing robustness and persistence for images
VL - 16
ER -
TY - JOUR
AB - Social organisms are constantly exposed to infectious agents via physical contact with conspecifics. While previous work has shown that disease susceptibility at the individual and group level is influenced by gen- etic diversity within and between group members, it remains poorly understood how group-level resistance to pathogens relates directly to individual physiology, defence behaviour and social interactions. We investigated the effects of high versus low genetic diversity on both the individual and collective disease defences in the ant Cardiocondyla obscurior. We compared the antiseptic behaviours (grooming and hygienic behaviour) of workers from genetically homogeneous and diverse colonies after exposure of their brood to the entomopathogenic fungus Metarhizium anisopliae. While workers from diverse colonies performed intensive allogrooming and quickly removed larvae covered with live fungal spores from the nest, workers from homogeneous colonies only removed sick larvae late after infection. This difference was not caused by a reduced repertoire of antiseptic behaviours or a generally decreased brood care activity in ants from homogeneous colonies. Our data instead suggest that reduced genetic diversity compromises the ability of Cardiocondyla colonies to quickly detect or react to the presence of pathogenic fungal spores before an infection is established, thereby affecting the dynamics of social immunity in the colony.
AU - Ugelvig, Line V
AU - Kronauer, Daniel
AU - Schrempf, Alexandra
AU - Heinze, Jürgen
AU - Cremer, Sylvia
ID - 3904
IS - 1695
JF - Proceedings of the Royal Society of London Series B Biological Sciences
TI - Rapid anti-pathogen response in ant societies relies on high genetic diversity
VL - 277
ER -
TY - JOUR
AB - Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative mu-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n(4)) for both turn-based games and MDPs; improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance be tween states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time complexity, improving the previously known reduction, which yielded O(vertical bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms can be iterated to approximate the metrics using binary search
AU - Chatterjee, Krishnendu
AU - De Alfaro, Luca
AU - Majumdar, Ritankar
AU - Raman, Vishwanath
ID - 3868
IS - 3
JF - Logical Methods in Computer Science
TI - Algorithms for game metrics
VL - 6
ER -
TY - JOUR
AB - We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs.
AU - Berwanger, Dietmar
AU - Chatterjee, Krishnendu
AU - De Wulf, Martin
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 3863
IS - 10
JF - Information and Computation
TI - Strategy construction for parity games with imperfect information
VL - 208
ER -
TY - JOUR
AB - We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Piterman, Nir
ID - 3861
IS - 6
JF - Information and Computation
TI - Strategy logic
VL - 208
ER -
TY - JOUR
AB - When lymphocytes follow chemotactic cues, they can adopt different migratory modes depending on the geometry and molecular composition of their extracellular environment. In this issue of The EMBO Journal, Klemke et al (2010) describe a novel Ras-dependent chemokine receptor signalling pathway that leads to activation of cofilin, which in turn amplifies actin turnover. This signalling module is exclusively required for lymphocyte migration in three-dimensional (3D) environments, but not for locomotion on two-dimensional (2D) surfaces.
AU - Michele Weber
AU - Michael Sixt
ID - 3960
IS - 17
JF - EMBO Journal
TI - MEK signalling tunes actin treadmilling for interstitial lymphocyte migration
VL - 29
ER -
TY - JOUR
AB - Integrin- and cadherin-mediated adhesion is central for cell and tissue morphogenesis, allowing cells and tissues to change shape without loosing integrity. Studies predominantly in cell culture showed that mechanosensation through adhesion structures is achieved by force-mediated modulation of their molecular composition. The specific molecular composition of adhesion sites in turn determines their signalling activity and dynamic reorganization. Here, we will review how adhesion sites respond to mecanical stimuli, and how spatially and temporally regulated signalling from different adhesion sites controls cell migration and tissue morphogenesis.
AU - Papusheva, Ekaterina
AU - Heisenberg, Carl-Philipp J
ID - 4157
IS - 16
JF - EMBO Journal
TI - Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis
VL - 29
ER -
TY - GEN
AB - More and more libraries starting semantic web projects. The question about the license of the data
is not discussed or the discussion is deferred to the end of project. in this paper is discussed why
the question of the license is so important in context of the semantic web that is should be one of the
first aspects in a semantic web project. Also it will be shown why a public domain weaver is the
only solution that fulfill the the special requirements of the semantic web and that guaranties the
reuseablitly of semantic library data for a sustainability of the projects.
AU - Danowski, Patrick
ID - 4340
T2 - European Library Automation Group (ELAG) 2010
TI - Open bibliographic data
ER -
TY - BOOK
AB - With the term "Library 2.0" the editors mean an institution which applies the principles of the Web 2.0 such as openness, re-use, collaboration and interaction in the entire organization. Libraries are extending their service offerings and work processes to include the potential of Web 2.0 technologies. This changes the job description and self-image of librarians. The collective volume offers a complete overview of the topic Library 2.0 and the current state of developments from a technological, sociological, information theoretical and practice-oriented perspective.
AU - Danowski, Patrick
AU - Bergmann, Julia
ID - 4346
TI - Handbuch Bibliothek 2.0
ER -
TY - CONF
AB - Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems.
AU - Wies, Thomas
AU - Zufferey, Damien
AU - Henzinger, Thomas A
ED - Ong, Luke
ID - 4361
TI - Forward analysis of depth-bounded processes
VL - 6014
ER -
TY - CONF
AB - In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting.
AU - Nickovic, Dejan
AU - Piterman, Nir
ED - Henzinger, Thomas A.
ED - Chatterjee, Krishnendu
ID - 4369
TI - From MTL to deterministic timed automata
VL - 6246
ER -
TY - CONF
AB - Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures. To automate the proofs of such formulas we propose a logic (a “calculus”) of such data structures. We build the calculus by starting from decidable logics of individual data structures, and connecting them through functions and sets, in ways that go beyond the frameworks such as Nelson-Oppen. The result are new decidable logics that can simultaneously specify properties of different kinds of data structures and overcome the limitations of the individual logics. Several of our decidable logics include abstraction functions that map a data structure into its more abstract view (a tree into a multiset, a multiset into a set), into a numerical quantity (the size or the height), or into the truth value of a candidate data structure invariant (sortedness, or the heap property). For algebraic data types, we identify an asymptotic many-to-one condition on the abstraction function that guarantees the existence of a decision procedure. In addition to the combination based on abstraction functions, we can combine multiple data structure theories if they all reduce to the same data structure logic. As an instance of this approach, we describe a decidable logic whose formulas are propositional combinations of formulas in: weak monadic second-order logic of two successors, two-variable logic with counting, multiset algebra with Presburger arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the logic of algebraic data types with the set content function. The subformulas in this combination can share common variables that refer to sets of objects along with the common set algebra operations. Such sound and complete combination is possible because the relations on sets definable in the component logics are all expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic and its new extensions play an important role in our decidability results. In several cases, when we combine logics that belong to NP, we can prove the satisfiability for the combined logic is still in NP.
AU - Kuncak, Viktor
AU - Piskac, Ruzica
AU - Suter, Philippe
AU - Wies, Thomas
ED - Barthe, Gilles
ED - Hermenegildo, Manuel
ID - 4378
TI - Building a calculus of data structures
VL - 5944
ER -
TY - JOUR
AB - The formal specification component of verification can be exported to simulation through the idea of property checkers. The essence of this approach is the automatic construction of an observer from the specification in the form of a program that can be interfaced with a simulator and alert the user if the property is violated by a simulation trace. Although not complete, this lighter approach to formal verification has been effectively used in software and digital hardware to detect errors. Recently, the idea of property checkers has been extended to analog and mixed-signal systems.
In this paper, we apply the property-based checking methodology to an industrial and realistic example of a DDR2 memory interface. The properties describing the DDR2 analog behavior are expressed in the formal specification language stl/psl in form of assertions. The simulation traces generated from an actual DDR2 interface design are checked with respect to the stl/psl assertions using the amt tool. The focus of this paper is on the translation of the official (informal and descriptive) specification of two non-trivial DDR2 properties into stl/psl assertions. We study both the benefits and the current limits of such approach.
AU - Jones, Kevin D
AU - Konrad,Victor
AU - Dejan Nickovic
ID - 4379
IS - 2
JF - Formal Methods in System Design
TI - Analog property checkers: a DDR2 case study
VL - 36
ER -
TY - JOUR
AB - We investigate a new model for populations evolving in a spatial continuum. This model can be thought of as a spatial version of the Lambda-Fleming-Viot process. It explicitly incorporates both small scale reproduction events and large scale extinction-recolonisation events. The lineages ancestral to a sample from a population evolving according to this model can be described in terms of a spatial version of the Lambda-coalescent. Using a technique of Evans (1997), we prove existence and uniqueness in law for the model. We then investigate the asymptotic behaviour of the genealogy of a finite number of individuals sampled uniformly at random (or more generally `far enough apart') from a two-dimensional torus of sidelength L as L tends to infinity. Under appropriate conditions (and on a suitable timescale) we can obtain as limiting genealogical processes a Kingman coalescent, a more general Lambda-coalescent or a system of coalescing Brownian motions (with a non-local coalescence mechanism).
AU - Barton, Nicholas H
AU - Etheridge, Alison
AU - Véber, Amandine
ID - 4243
IS - 7
JF - Electronic Journal of Probability
TI - A new model for evolution in a spatial continuum
VL - 15
ER -
TY - CHAP
AB - Mit diesem Buch möchten wir einen Überblick der aktuellen Diskussion zum Thema Bibliothek 2.0 geben und den Stand der tatsächlichen Umsetzung der Web 2.0-Ansätze in deutschsprachigen Bibliotheken beleuchten. An dieser Stelle ist die Frage erlaubt, warum es zu einer Zeit, in der es bereits die ersten "Web 3.0"- Konferenzen gibt, eines Handbuches der Bibliothek 2.0 noch bedarf. Und warum es überhaupt ein deutschsprachiges Handbuch zur Bibliothek 2.0 braucht, wo es doch bereits verschiedenste Publikationen zu diesem Thema aus anderen Ländern, insbesondere des angloamerikanischen Raums gibt. Ist dazu nicht bereits alles gesagt?
AU - Bergmann, Julia
AU - Danowski, Patrick
ED - Bergmann, Julia
ED - Danowski, Patrick
ID - 4339
T2 - Handbuch Bibliothek 2.0
TI - Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch
ER -
TY - CONF
AB - Shape analysis is a promising technique to prove program properties about recursive data structures. The challenge is to automatically determine the data-structure type, and to supply the shape analysis with the necessary information about the data structure. We present a stepwise approach to the selection of instrumentation predicates for a TVLA-based shape analysis, which takes us a step closer towards the fully automatic verification of data structures. The approach uses two techniques to guide the refinement of shape abstractions: (1) during program exploration, an explicit heap analysis collects sample instances of the heap structures, which are used to identify the data structures that are manipulated by the program; and (2) during abstraction refinement along an infeasible error path, we consider different possible heap abstractions and choose the coarsest one that eliminates the infeasible path. We have implemented this combined approach for automatic shape refinement as an extension of the software model checker BLAST. Example programs from a data-structure library that manipulate doubly-linked lists and trees were successfully verified by our tool.
AU - Beyer, Dirk
AU - Henzinger, Thomas A
AU - Théoduloz, Grégory
AU - Zufferey, Damien
ED - Rosenblum, David
ED - Taenzer, Gabriele
ID - 4396
TI - Shape refinement through explicit heap analysis
VL - 6013
ER -
TY - CONF
AB - Cloud computing is an emerging paradigm aimed to offer users pay-per-use computing resources, while leaving the burden of managing the computing infrastructure to the cloud provider. We present a new programming and pricing model that gives the cloud user the flexibility of trading execution speed and price on a per-job basis. We discuss the scheduling and resource management challenges for the cloud provider that arise in the implementation of this model. We argue that techniques from real-time and embedded software can be useful in this context.
AU - Henzinger, Thomas A
AU - Tomar, Anmol
AU - Singh, Vasu
AU - Wies, Thomas
AU - Zufferey, Damien
ID - 4380
TI - A marketplace for cloud resources
ER -
TY - CONF
AB - Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We claim that, in order to realize the full potential of cloud computing, the user must be presented with a pricing model that offers flexibility at the requirements level, such as a choice between different degrees of execution speed and the cloud provider must be presented with a programming model that offers flexibility at the execution level, such as a choice between different scheduling policies. In such a flexible framework, with each job, the user purchases a virtual computer with the desired speed and cost characteristics, and the cloud provider can optimize the utilization of resources across a stream of jobs from different users. We designed a flexible framework to test our hypothesis, which is called FlexPRICE (Flexible Provisioning of Resources in a Cloud Environment) and works as follows. A user presents a job to the cloud. The cloud finds different schedules to execute the job and presents a set of quotes to the user in terms of price and duration for the execution. The user then chooses a particular quote and the cloud is obliged to execute the job according to the chosen quote. FlexPRICE thus hides the complexity of the actual scheduling decisions from the user, but still provides enough flexibility to meet the users actual demands. We implemented FlexPRICE in a simulator called PRICES that allows us to experiment with our framework. We observe that FlexPRICE provides a wide range of execution options-from fast and expensive to slow and cheap-- for the whole spectrum of data-intensive and computation-intensive jobs. We also observe that the set of quotes computed by FlexPRICE do not vary as the number of simultaneous jobs increases.
AU - Henzinger, Thomas A
AU - Tomar, Anmol
AU - Singh, Vasu
AU - Wies, Thomas
AU - Zufferey, Damien
ID - 4381
TI - FlexPRICE: Flexible provisioning of resources in a cloud environment
ER -
TY - CONF
AB - Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of TM executions have been proposed. Many of these definitions assumed that accesses to shared data are solely performed through transactions. In practice, due to legacy code and concurrency libraries, transactions in a TM have to share data with non-transactional operations. The semantics of such interaction, while widely discussed by practitioners, lacks a clear formal specification. Those interactions can vary, sometimes in subtle ways, between TM implementations and underlying memory models. We propose a correctness condition for TMs, parametrized opacity, to formally capture the now folklore notion of strong atomicity by stipulating the two following intuitive requirements: first, every transaction appears as if it is executed instantaneously with respect to other transactions and non-transactional operations, and second, non-transactional operations conform to the given underlying memory model. We investigate the inherent cost of implementing parametrized opacity. We first prove that parametrized opacity requires either instrumenting non-transactional operations (for most memory models) or writing to memory by transactions using potentially expensive read-modify-write instructions (such as compare-and-swap). Then, we show that for a class of practical relaxed memory models, parametrized opacity can indeed be implemented with constant-time instrumentation of non-transactional writes and no instrumentation of non-transactional reads. We show that, in practice, parametrizing the notion of correctness allows developing more efficient TM implementations.
AU - Guerraoui, Rachid
AU - Henzinger, Thomas A
AU - Kapalka, Michal
AU - Singh, Vasu
ID - 4382
TI - Transactions in the jungle
ER -
TY - CONF
AB - Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environment. This environment cannot be entirely captured and can provide inaccurate input data to the component. It is thus important for digital components to have a robust behavior, i.e. the presence of a small change in the input sequences should not result in a drastic change in the output sequences. In this paper, we study a notion of robustness for sequential circuits. However, since sequential circuits may have parts that are naturally discontinuous (e.g., digital controllers with switching behavior), we need a flexible framework that accommodates this fact and leaves discontinuous parts of the circuit out from the robustness analysis. As a consequence, we consider sequential circuits that have their input variables partitioned into two disjoint sets: control and disturbance variables. Our contributions are (1) a definition of robustness for sequential circuits as a form of continuity with respect to disturbance variables, (2) the characterization of the exact class of sequential circuits that are robust according to our definition, (3) an algorithm to decide whether a sequential circuit is robust or not.
AU - Doyen, Laurent
AU - Henzinger, Thomas A
AU - Legay, Axel
AU - Nickovic, Dejan
ID - 4389
TI - Robustness of sequential circuits
ER -
TY - CONF
AB - Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of "regular" transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions.
AU - Alur, Rajeev
AU - Cerny, Pavol
ID - 488
TI - Expressiveness of streaming string transducers
VL - 8
ER -
TY - CONF
AB - Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies.
AU - Cristau, Julien
AU - David, Claire
AU - Horn, Florian
ID - 489
T2 - Proceedings of GandALF 2010
TI - How do we remember the past in randomised strategies?
VL - 25
ER -
TY - GEN
AB - Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable.
AU - Cerny, Pavol
AU - Radhakrishna, Arjun
AU - Zufferey, Damien
AU - Chaudhuri, Swarat
AU - Alur, Rajeev
ID - 5391
SN - 2664-1690
TI - Model checking of linearizability of concurrent list implementations
ER -
TY - GEN
AB - The class of ω regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider the finitary parity and Streett (fairness) conditions. We present the topological, automata-theoretic and logical characterization of finitary languages defined by finitary parity and Streett conditions. We (a) show that the finitary parity and Streett languages are Σ2-complete; (b) present a complete characterization of the expressive power of various classes of automata with finitary and infinitary conditions (in particular we show that non-deterministic finitary parity and Streett automata cannot be determinized to deterministic finitary parity or Streett automata); and (c) show that the languages defined by non-deterministic finitary parity automata exactly characterize the star-free fragment of ωB-regular languages.
AU - Chatterjee, Krishnendu
AU - Fijalkow, Nathanaël
ID - 5390
SN - 2664-1690
TI - Topological, automata-theoretic and logical characterization of finitary languages
ER -
TY - CONF
AB - Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.
AU - Cerny, Pavol
AU - Henzinger, Thomas A
AU - Radhakrishna, Arjun
ID - 4393
TI - Simulation distances
VL - 6269
ER -
TY - CONF
AB - Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each vertex stores an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free implementation and proved that the corrected version is linearizable.
AU - Cerny, Pavol
AU - Radhakrishna, Arjun
AU - Zufferey, Damien
AU - Chaudhuri, Swarat
AU - Alur, Rajeev
ID - 4390
TI - Model checking of linearizability of concurrent list implementations
VL - 6174
ER -
TY - GEN
AB - We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.
We show that for worst-case performance, the problem can be modeled
as a 2-player graph game with quantitative (limit-average) objectives, and
for average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.
We have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements.
AU - Chatterjee, Krishnendu
AU - Cerny, Pavol
AU - Henzinger, Thomas A
AU - Radhakrishna, Arjun
AU - Singh, Rohit
ID - 5388
SN - 2664-1690
TI - Quantitative synthesis for concurrent programs
ER -
TY - GEN
AB - Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.
AU - Cerny, Pavol
AU - Henzinger, Thomas A
AU - Radhakrishna, Arjun
ID - 5389
SN - 2664-1690
TI - Simulation distances
ER -
TY - CONF
AB - We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 3855
TI - Qualitative analysis of partially-observable Markov Decision Processes
VL - 6281
ER -
TY - CONF
AB - GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
AU - Radhakrishna, Arjun
ID - 4388
TI - GIST: A solver for probabilistic games
VL - 6174
ER -
TY - JOUR
AB - It is not well understood how the human Mediator complex, transcription factor IIH and RNA polymerase II (Pol II) work together with activators to initiate transcription. Activator binding alters Mediator structure, yet the functional consequences of such structural shifts remain unknown. The p53 C terminus and its activation domain interact with different Mediator subunits, and we find that each interaction differentially affects Mediator structure; strikingly, distinct p53-Mediator structures differentially affect Pol II activity. Only the p53 activation domain induces the formation of a large pocket domain at the Mediator-Pol II interaction site, and this correlates with activation of stalled Pol II to a productively elongating state. Moreover, we define a Mediator requirement for TFIIH-dependent Pol II C-terminal domain phosphorylation and identify substantial differences in Pol II C-terminal domain processing that correspond to distinct p53-Mediator structural states. Our results define a fundamental mechanism by which p53 activates transcription and suggest that Mediator structural shifts trigger activation of stalled Pol II complexes.
AU - Meyer, Krista
AU - Lin, Shih
AU - Bernecky, Carrie A
AU - Gao, Yuefeng
AU - Taatjes, Dylan
ID - 598
IS - 6
JF - Nature Structural and Molecular Biology
TI - P53 activates transcription by directing structural shifts in Mediator
VL - 17
ER -
TY - JOUR
AB - Defining the mutational landscape when individuals of a species grow separately and diverge over many generations can provide insights into trait evolution. A specific example of this involves studying changes associated with domestication where different lines of the same wild stock have been cultivated independently in different standard environments. Whole genome sequence comparison of such lines permits estimation of mutation rates, inference of genes' ancestral states and ancestry of existing strains, and correction of sequencing errors in genome databases. Here we study domestication of the C. elegans Bristol strain as a model, and report the genome sequence of LSJ1 (Bristol), a sibling of the standard C. elegans reference wild type N2 (Bristol). The LSJ1 and N2 lines were cultivated separately from shortly after the Bristol strain was isolated until methods to freeze C. elegans were developed. We find that during this time the two strains have accumulated 1208 genetic differences. We describe phenotypic variation between N2 and LSJ1 in the rate at which embryos develop, the rate of production of eggs, the maturity of eggs at laying, and feeding behavior, all the result of post-isolation changes. We infer the ancestral alleles in the original Bristol isolate and highlight 2038 likely sequencing errors in the original N2 reference genome sequence. Many of these changes modify genome annotation. Our study provides a starting point to further investigate genotype-phenotype association and offers insights into the process of selection as a result of laboratory domestication.
AU - Weber, Katherine P.
AU - De, Subhajyoti
AU - Kozarewa, Iwanka
AU - Turner, Daniel J.
AU - Babu, M. Madan
AU - de Bono, Mario
ID - 6142
IS - 11
JF - PLoS ONE
SN - 1932-6203
TI - Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans
VL - 5
ER -
TY - JOUR
AB - We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over ℚ.
AU - Bretèche, Régis de la
AU - Browning, Timothy D
ID - 6320
IS - 646
JF - Crelles Journal
TI - Le problème des diviseurs pour des formes binaires de degré 4
VL - 2010
ER -
TY - JOUR
AB - We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction, magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate that our Bridgman-grown single crystals have a p-type carrier concentration of 3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3. Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K, the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature of 294 K. For each sample type, three-terminal capacitive dilatometry measurements detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on SnTe show elastic hardening near the structural transition, pointing to co-elastic behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening, pointing to ferroelastic behavior. Effective Debye temperature, θD, values of SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In addition, a precursor softening extending over approximately 100 K anticipates this collapse at the critical temperature and quantitative analysis over three decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02, a value indicating a three-dimensional softening of phonon branches at a temperature T0∼75 K, considerably below Tc. We suggest that the differences in these two types of elastic behaviors lie in the absence of elastic domain-wall motion in the one case and their nucleation in the other.
AU - Salje, E. K. H.
AU - Safarik, D. J.
AU - Modic, Kimberly A
AU - Gubernatis, J. E.
AU - Cooley, J. C.
AU - Taylor, R. D.
AU - Mihaila, B.
AU - Saxena, A.
AU - Lookman, T.
AU - Smith, J. L.
AU - Fisher, R. A.
AU - Pasternak, M.
AU - Opeil, C. P.
AU - Siegrist, T.
AU - Littlewood, P. B.
AU - Lashley, J. C.
ID - 7078
IS - 18
JF - Physical Review B
SN - 1098-0121
TI - Tin telluride: A weakly co-elastic metal
VL - 82
ER -
TY - JOUR
AB - One possible way to produce ultra-cold, high-phase-space-density quantum gases of molecules in the rovibronic ground state is given by molecule association from quantum-degenerate atomic gases on a Feshbach resonance and subsequent coherent optical multi-photon transfer into the rovibronic ground state. In ultra-cold samples of Cs2 molecules, we observe two-photon dark resonances that connect the intermediate rovibrational level |v=73,J=2 with the rovibrational ground state |v=0,J=0 of the singlet X 1 ∑ g + ground-state potential. For precise dark resonance spectroscopy we exploit the fact that it is possible to efficiently populate the level |v=73,J=2 by two-photon transfer from the dissociation threshold with the stimulated Raman adiabatic passage (STIRAP) technique. We find that at least one of the two-photon resonances is sufficiently strong to allow future implementation of coherent STIRAP transfer of a molecular quantum gas to the rovibrational ground state |v=0,J=0.
AU - Mark, Manfred
AU - Danzl, Johann G
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Bouloufa, Nadia
AU - Dulieu, Olivier
AU - Salami, Houssam
AU - Bergeman, Thomas
AU - Ritsch, Helmut
AU - Hart, Russell
AU - Nägerl, Hanns
ID - 1038
IS - 2
JF - Applied Physics B: Lasers and Optics
TI - Dark resonances for ground-state transfer of molecular quantum gases
VL - 95
ER -
TY - JOUR
AB - Ultracold atomic physics offers myriad possibilities to study strongly correlated many-body systems in lower dimensions. Typically, only ground-state phases are accessible. Using a tunable quantum gas of bosonic cesium atoms, we realized and controlled in one-dimensional geometry a highly excited quantum phase that is stabilized in the presence of attractive interactions by maintaining and strengthening quantum correlations across a confinement-induced resonance. We diagnosed the crossover from repulsive to attractive interactions in terms of the stiffness and energy of the system. Our results open up the experimental study of metastable, excited, many-body phases with strong correlations and their dynamical properties.
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Mark, Manfred
AU - Danzl, Johann G
AU - Hart, Russell
AU - Pupillo, Guido
AU - Nägerl, Hanns
ID - 1040
IS - 5945
JF - Science
TI - Realization of an excited, strongly correlated quantum gas Phase
VL - 325
ER -
TY - JOUR
AB - We demonstrate efficient transfer of ultracold molecules into a deeply bound rovibrational level of the singlet ground state potential in the presence of an optical lattice. The overall molecule creation efficiency is 25%, and the transfer efficiency to the rovibrational level |v = 73, J = 2) is above 80%. We find that the molecules in |v = 73, J = 2) are trapped in the optical lattice, and that the lifetime in the lattice is limited by optical excitation by the lattice light. The molecule trapping time for a lattice depth of 15 atomic recoil energies is about 20 ms. We determine the trapping frequency by the lattice phase and amplitude modulation technique. It will now be possible to transfer the molecules to the rovibrational ground state |v = 0, J = 0) in the presence of the optical lattice.
AU - Danzl, Johann G
AU - Mark, Manfred
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Hart, Russell
AU - Liem, Andreas
AU - Zellmer, Holger
AU - Nägerl, Hanns
ID - 1041
JF - New Journal of Physics
TI - Deeply bound ultracold molecules in an optical lattice
VL - 11
ER -
TY - JOUR
AB - One possibility for the creation of ultracold, high phase space density quantum gases of molecules in the rovibronic ground state relies on first associating weakly-bound molecules from quantum-degenerate atomic gases on a Feshbach resonance and then transferring the molecules via several steps of coherent two-photon stimulated Raman adiabatic passage (STIRAP) into the rovibronic ground state. Here, in ultracold samples of Cs2 Feshbach molecules produced out of ultracold samples of Cs atoms, we observe several optical transitions to deeply-bound rovibrational levels of the excited 0 u+ molecular potentials with high resolution. At least one of these transitions, although rather weak, allows efficient STIRAP transfer into the deeply-bound vibrational level v = 73> of the singlet X 1Σg+ ground state potential, as recently demonstrated (J. G. Danzl, E. Haller, M. Gustavsson, M. J. Mark, R. Hart, N. Bouloufa, O. Dulieu, H. Ritsch, and H.-C. Nägerl, Science, 2008, 321, 1062). From this level, the rovibrational ground state v = 0, J = 0> can be reached with one more transfer step. In total, our results show that coherent ground state transfer for Cs2 is possible using a maximum of two successive two-photon STIRAP processes or one single four-photon STIRAP process.
AU - Danzl, Johann G
AU - Mark, Manfred
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Bouloufa, Nadia
AU - Dulieu, Olivier
AU - Ritsch, Helmut
AU - Hart, Russell
AU - Nägerl, Hanns
ID - 1043
JF - Faraday Discussions
TI - Precision molecular spectroscopy for ground state transfer of molecular quantum gases
VL - 142
ER -
TY - CHAP
AB - Let g be a cubic polynomial with integer coefficients and n>9 variables, and assume that the congruence g=0 modulo p^k is soluble for all prime powers p^k. We show that the equation g=0 has infinitely many integer solutions when the cubic part of g defines a projective hypersurface with singular locus of dimension <n-10. The proof is based on the Hardy-Littlewood circle method.
AU - Browning, Timothy D
AU - Heath Brown, Roger
ID - 164
T2 - Analytic Number Theory: Essays in honour of Klaus Roth
TI - Integral points on cubic hypersurfaces
ER -
TY - JOUR
AB - We demonstrate the time-resolved driving of two-photon blue sideband transitions between superconducting qubits and a transmission line resonator. As an example of using these sideband transitions for a two-qubit operation, we implement a pulse sequence that first entangles one qubit with the resonator and subsequently distributes the entanglement between two qubits. We show the generation of 75% fidelity Bell states by this method. The full density matrix of the two-qubit system is extracted using joint measurement and quantum state tomography and shows close agreement with numerical simulation.
AU - Leek, Peter J
AU - Filipp, Stefan
AU - Maurer, Patrick
AU - Baur, Matthias P
AU - Bianchetti, R
AU - Johannes Fink
AU - Göppl, M
AU - Steffen, L. Kraig
AU - Wallraff, Andreas
ID - 1766
IS - 18
JF - Physical Review B - Condensed Matter and Materials Physics
TI - Using sideband transitions for two-qubit operations in superconducting circuits
VL - 79
ER -
TY - JOUR
AB - We present spectroscopic measurements of the Autler-Townes doublet and the sidebands of the Mollow triplet in a driven superconducting qubit. The ground to first excited state transition of the qubit is strongly pumped while the resulting dressed qubit spectrum is probed with a weak tone. The corresponding transitions are detected using dispersive readout of the qubit coupled off resonantly to a microwave transmission line resonator. The observed frequencies of the Autler-Townes and Mollow spectral lines are in good agreement with a dispersive Jaynes-Cummings model taking into account higher excited qubit states and dispersive level shifts due to off-resonant drives.
AU - Baur, Matthias P
AU - Filipp, Stefan
AU - Bianchetti, R
AU - Johannes Fink
AU - Göppl, M
AU - Steffen, L. Kraig
AU - Leek, Peter J
AU - Blais, Alexandre
AU - Wallraff, Andreas
ID - 1767
IS - 24
JF - Physical Review Letters
TI - Measurement of autler-townes and mollow transitions in a strongly driven superconducting qubit
VL - 102
ER -
TY - JOUR
AB - Quantum state tomography is an important tool in quantum information science for complete characterization of multiqubit states and their correlations. Here we report a method to perform a joint simultaneous readout of two superconducting qubits dispersively coupled to the same mode of a microwave transmission line resonator. The nonlinear dependence of the resonator transmission on the qubit state dependent cavity frequency allows us to extract the full two-qubit correlations without the need for single-shot readout of individual qubits. We employ standard tomographic techniques to reconstruct the density matrix of two-qubit quantum states.
AU - Filipp, Stefan
AU - Maurer, Patrick
AU - Leek, Peter J
AU - Baur, Matthias P
AU - Bianchetti, R
AU - Johannes Fink
AU - Göppl, M
AU - Steffen, L. Kraig
AU - Gambetta, Jay M
AU - Blais, Alexandre
AU - Wallraff, Andreas
ID - 1768
IS - 20
JF - Physical Review Letters
TI - Two-qubit state tomography using a joint dispersive readout
VL - 102
ER -
TY - JOUR
AB - We present an ideal realization of the Tavis-Cummings model in the absence of atom number and coupling fluctuations by embedding a discrete number of fully controllable superconducting qubits at fixed positions into a transmission line resonator. Measuring the vacuum Rabi mode splitting with one, two, and three qubits strongly coupled to the cavity field, we explore both bright and dark dressed collective multiqubit states and observe the discrete N scaling of the collective dipole coupling strength. Our experiments demonstrate a novel approach to explore collective states, such as the W state, in a fully globally and locally controllable quantum system. Our scalable approach is interesting for solid-state quantum information processing and for fundamental multiatom quantum optics experiments with fixed atom numbers.
AU - Johannes Fink
AU - Bianchetti, R
AU - Baur, Matthias P
AU - Göppl, M
AU - Steffen, L. Kraig
AU - Filipp, Stefan
AU - Leek, Peter J
AU - Blais, Alexandre
AU - Wallraff, Andreas
ID - 1769
IS - 8
JF - Physical Review Letters
TI - Dressed collective qubit states and the Tavis-Cummings model in circuit QED
VL - 103
ER -
TY - JOUR
AB - The quantum state of a superconducting qubit nonresonantly coupled to a transmission line resonator can be determined by measuring the quadrature amplitudes of an electromagnetic field transmitted through the resonator. We present experiments in which we analyze in detail the dynamics of the transmitted field as a function of the measurement frequency for both weak continuous and pulsed measurements. We find excellent agreement between our data and calculations based on a set of Bloch-type differential equations for the cavity field derived from the dispersive Jaynes-Cummings Hamiltonian including dissipation. We show that the measured system response can be used to construct a measurement operator from which the qubit population can be inferred accurately. Such a measurement operator can be used in tomographic methods to reconstruct single and multiqubit states in ensemble-averaged measurements.
AU - Bianchetti, R
AU - Filipp, Stefan
AU - Baur, Matthias P
AU - Johannes Fink
AU - Göppl, M
AU - Leek, Peter J
AU - Steffen, L. Kraig
AU - Blais, Alexandre
AU - Wallraff, Andreas
ID - 1770
IS - 4
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Dynamics of dispersive single-qubit readout in circuit quantum electrodynamics
VL - 80
ER -
TY - JOUR
AB - The exceptionally strong coupling realizable between superconducting qubits and photons stored in an on-chip microwave resonator allows for the detailed study of matter-light interactions in the realm of circuit quantum electrodynamics (QED). Here we investigate the resonant interaction between a single transmon-type multilevel artificial atom and weak thermal and coherent fields. We explore up to three photon dressed states of the coupled system in a linear response heterodyne transmission measurement. The results are in good quantitative agreement with a generalized Jaynes-Cummings model. Our data indicate that the role of thermal fields in resonant cavity QED can be studied in detail using superconducting circuits.
AU - Johannes Fink
AU - Baur, Matthias P
AU - Bianchetti, R
AU - Filipp, Stefan
AU - Göppl, M
AU - Leek, Peter J
AU - Steffen, L. Kraig
AU - Blais, Alexandre
AU - Wallraff, Andreas
ID - 1771
JF - Physica Scripta T
TI - Thermal excitation of multi-photon dressed states in circuit quantum electrodynamics
VL - T137
ER -
TY - JOUR
AB - Many membrane channels and receptors exhibit adaptive, or desensitized, response to a strong sustained input stimulus. A key mechanism that underlies this response is the slow, activity-dependent removal of responding molecules to a pool which is unavailable to respond immediately to the input. This mechanism is implemented in different ways in various biological systems and has traditionally been studied separately for each. Here we highlight the common aspects of this principle, shared by many biological systems, and suggest a unifying theoretical framework. We study theoretically a class of models which describes the general mechanism and allows us to distinguish its universal from system-specific features. We show that under general conditions, regardless of the details of kinetics, molecule availability encodes an averaging over past activity and feeds back multiplicatively on the system output. The kinetics of recovery from unavailability determines the effective memory kernel inside the feedback branch, giving rise to a variety of system-specific forms of adaptive response—precise or input-dependent, exponential or power-law—as special cases of the same model.
AU - Tamar Friedlander
AU - Brenner, Naama
ID - 1825
IS - 52
JF - PNAS
TI - Adaptive response by state-dependent inactivation
VL - 106
ER -
TY - JOUR
AB - Let (E, H, μ) be an abstract Wiener space and let DV : = V D, where D denotes the Malliavin derivative and V is a closed and densely defined operator from H into another Hilbert space under(H, {combining low line}). Given a bounded operator B on under(H, {combining low line}), coercive on the range over(R (V), -), we consider the operators A : = V* B V in H and under(A, {combining low line}) : = V V* B in under(H, {combining low line}), as well as the realisations of the operators L : = DV* B DV and under(L, {combining low line}) : = DV DV* B in Lp (E, μ) and Lp (E, μ ; under(H, {combining low line})) respectively, where 1 < p < ∞. Our main result asserts that the following four assertions are equivalent: (1)D (sqrt(L)) = D (DV) with {norm of matrix} sqrt(L) f {norm of matrix}p {minus tilde} {norm of matrix} DV f {norm of matrix}p for f ∈ D (sqrt(L));(2)under(L, {combining low line}) admits a bounded H∞-functional calculus on over(R (DV), -);(3)D (sqrt(A)) = D (V) with {norm of matrix} sqrt(A) h {norm of matrix} {minus tilde} {norm of matrix} V h {norm of matrix} for h ∈ D (sqrt(A));(4)under(A, {combining low line}) admits a bounded H∞-functional calculus on over(R (V), -). Moreover, if these conditions are satisfied, then D (L) = D (DV2) ∩ D (DA). The equivalence (1)-(4) is a non-symmetric generalisation of the classical Meyer inequalities of Malliavin calculus (where under(H, {combining low line}) = H, V = I, B = frac(1, 2) I). A one-sided version of (1)-(4), giving Lp-boundedness of the Riesz transform DV / sqrt(L) in terms of a square function estimate, is also obtained. As an application let -A generate an analytic C0-contraction semigroup on a Hilbert space H and let -L be the Lp-realisation of the generator of its second quantisation. Our results imply that two-sided bounds for the Riesz transform of L are equivalent with the Kato square root property for A. The boundedness of the Riesz transform is used to obtain an Lp-domain characterisation for the operator L.
AU - Jan Maas
AU - van Neerven, Jan M
ID - 2119
IS - 8
JF - Journal of Functional Analysis
TI - Boundedness of Riesz transforms for elliptic operators on abstract Wiener spaces
VL - 257
ER -
TY - JOUR
AB - Relying on the quantization rule of Raab and Friedrich [Phys. Rev. A (2009) in press], we derive simple and accurate formulae for the number of rotational states supported by a weakly bound vibrational level of a diatomic molecular ion. We also provide analytic estimates of the rotational constants of any such levels up to threshold for dissociation and obtain a criterion for determining whether a given weakly bound vibrational level is rotationless. The results depend solely on the long-range part of the molecular potential.
AU - Mikhail Lemeshko
AU - Frierich, Bretislav
ID - 2137
IS - 1
JF - Journal of Atomic and Molecular Sciences
TI - Rotational structure of weakly bound molecular ions
VL - 1
ER -
TY - JOUR
AB - We investigate the effects of a magnetic field on the dynamics of rotationally inelastic collisions of open-shell molecules (Σ2, Σ3, and Π2) with closed-shell atoms. Our treatment makes use of the Fraunhofer model of matter wave scattering and its recent extension to collisions in electric [M. Lemeshko and B. Friedrich, J. Chem. Phys. 129, 024301 (2008)] and radiative fields [M. Lemeshko and B. Friedrich, Int. J. Mass. Spec. 280, 19 (2009)]. A magnetic field aligns the molecule in the space-fixed frame and thereby alters the effective shape of the diffraction target. This significantly affects the differential and integral scattering cross sections. We exemplify our treatment by evaluating the magnetic-field-dependent scattering characteristics of the He-CaH (XΣ+2), He-O2 (XΣ–3), and He-OH (XΠΩ2) systems at thermal collision energies. Since the cross sections can be obtained for different orientations of the magnetic field with respect to the relative velocity vector, the model also offers predictions about the frontal-versus-lateral steric asymmetry of the collisions. The steric asymmetry is found to be almost negligible for the He-OH system, weak for the He-CaH collisions, and strong for the He-O2. While odd ΔM transitions dominate the He-OH [J=3/2,f→J′,e/f] integral cross sections in a magnetic field parallel to the relative velocity vector, even ΔM transitions prevail in the case of the He-CaH (X2Σ+) and He-O2 (XΣ−3) collision systems. For the latter system, the magnetic field opens inelastic channels that are closed in the absence of the field. These involve the transitions N=1,J=0→N′, J′ with J′=N′.
AU - Mikhail Lemeshko
AU - Friedrich, Břetislav
ID - 2149
IS - 1
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Collisions of paramagnetic molecules in magnetic fields: An analytic model based on Fraunhofer diffraction of matter waves
VL - 79
ER -
TY - JOUR
AB - We examine the effects of a linearly polarized nonresonant radiative field on the dynamics of rotationally inelastic Na+ + N2 collisions at eV collision energies. Our treatment is based on the Fraunhofer model of matter wave scattering and its recent extension to collisions in electric fields [M. Lemeshko, B. Friedrich, J. Chem. Phys. 129 (2008) 024301]. The nonresonant radiative field changes the effective shape of the target molecule by aligning it in the space-fixed frame. This markedly alters the differential and integral scattering cross-sections. As the cross-sections can be evaluated for a polarization of the radiative field collinear or perpendicular to the relative velocity vector, the model also offers predictions about steric asymmetry of the collisions.
AU - Mikhail Lemeshko
AU - Friedrich, Břetislav
ID - 2150
IS - 1-3
JF - International Journal of Mass Spectrometry
TI - The effect of a nonresonant radiative field on low-energy rotationally inelastic Na+ + N2 collisions
VL - 280
ER -
TY - JOUR
AB - By making use of the quantization rule of Raab and Friedrich [Phys. Rev. A 78, 022707 (2008)], we derive simple and accurate formulae for the number of rotational states supported by a weakly bound vibrational level of a diatomic molecule and the rotational constants of any such levels up to the threshold, and provide a criterion for determining whether a given weakly bound vibrational level is rotationless. The results depend solely on the long-range part of the molecular potential and are applicable to halo molecules.
AU - Mikhail Lemeshko
AU - Friedrich, Břetislav
ID - 2191
IS - 5
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Rotational and rotationless states of weakly bound molecules
VL - 79
ER -
TY - JOUR
AB - We develop an analytic model of thermal state-to-state rotationally inelastic collisions of asymmetric-top molecules with closed-shell atoms in electric fields and apply it to the Ar-H2O collision system. The predicted cross sections as well as the steric asymmetry of the collisions show at fields up to 150 kV/cm characteristic field-dependent features which can be experimentally tested. Particularly suitable candidates for such tests are the 000 → 220 and 101→ 221 channels, arising from the relaxation of the field-free selection rules due to the hybridization of J states by the field. Averaging over the M' product channels is found to largely obliterate the orientation effects brought about by the field.
AU - Mikhail Lemeshko
AU - Friedrich, Břetislav
ID - 2192
IS - 52
JF - Journal of Physical Chemistry A
TI - Model analysis of rotationally inelastic Ar + H2O scattering in an electric field
VL - 113
ER -
TY - JOUR
AB - We show that weakly bound molecules can be probed by "shaking" in a pulsed nonresonant laser field. The field introduces a centrifugal term which expels the highest vibrational level from the potential that binds it. Our numerical simulations applied to the Rb2 and KRb Feshbach molecules indicate that shaking by feasible laser pulses can be used to accurately recover the square of the vibrational wave function and, by inversion, also the long-range part of the molecular potential.
AU - Mikhail Lemeshko
AU - Friedrich, Břetislav
ID - 2193
IS - 5
JF - Physical Review Letters
TI - Probing weakly bound molecules with nonresonant light
VL - 103
ER -
TY - JOUR
AB - An upper bound of the expected order of magnitude is established for the number of ℚ-rational points of bounded height on Châtelet surfaces defined over ℚ.
AU - Timothy Browning
ID - 229
IS - 1
JF - Mathematische Annalen
TI - Linear growth for Châtelet surfaces
VL - 346
ER -
TY - JOUR
AB - Let X be a projective non-singular quartic hypersurface of dimension 39 or more, which is defined over . We show that X() is non-empty provided that X() is non-empty and X has p-adic points for every prime p.
AU - Timothy Browning
AU - Heath-Brown, Roger
ID - 228
IS - 629
JF - Journal fur die Reine und Angewandte Mathematik
TI - Rational points on quartic hypersurfaces
ER -
TY - JOUR
AB - We prove the Lee-Huang-Yang formula for the ground state energy of the 3D Bose gas with repulsive interactions described by the exponential function, in a simultaneous limit of weak coupling and high density. In particular, we show that the Bogoliubov approximation is exact in an appropriate parameter regime, as far as the ground state energy is concerned.
AU - Giuliani, Alessandro
AU - Robert Seiringer
ID - 2384
IS - 5-6
JF - Journal of Statistical Physics
TI - The ground state energy of the weakly interacting Bose gas at high density
VL - 135
ER -
TY - JOUR
AB - We consider an ultracold rotating Bose gas in a harmonic trap close to the critical angular velocity, so that the system can be considered to be confined to the lowest Landau level. With this assumption we prove that the Gross-Pitaevskii energy functional accurately describes the ground-state energy of the corresponding N -body Hamiltonian with contact interaction provided the total angular momentum L is much less than N2. While the Gross-Pitaevskii energy is always an obvious variational upper bound to the ground-state energy, a more refined analysis is needed to establish it as an exact lower bound. We also discuss the question of Bose-Einstein condensation in the parameter range considered. Coherent states together with inequalities in spaces of analytic functions are the main technical tools.
AU - Lieb, Élliott H
AU - Robert Seiringer
AU - Yngvason, Jakob
ID - 2385
IS - 6
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Yrast line of a rapidly rotating Bose gas: Gross-Pitaevskii regime
VL - 79
ER -
TY - JOUR
AB - We prove exponential decay of the off-diagonal correlation function in the two-dimensional homogeneous Bose gas when a2 ρ is small and the temperature T satisfies T> 4πρ ln | ln (a2 ρ) |. Here, a is the scattering length of the repulsive interaction potential and ρ is the density. To the leading order in a2 ρ, this bound agrees with the expected critical temperature for superfluidity. In the three-dimensional Bose gas, exponential decay is proved when T- Tc (0) Tc (0) >5 a ρ1/3, where Tc (0) is the critical temperature of the ideal gas. While this condition is not expected to be sharp, it gives a rigorous upper bound on the critical temperature for Bose-Einstein condensation.
AU - Robert Seiringer
AU - Ueltschi, Daniel
ID - 2386
IS - 1
JF - Physical Review B - Condensed Matter and Materials Physics
TI - Rigorous upper bound on the critical temperature of dilute Bose gases
VL - 80
ER -
TY - JOUR
AB - We consider a system of trapped spinless bosons interacting with a repulsive potential and subject to rotation. In the limit of rapid rotation and small scattering length, we rigorously show that the ground state energy converges to that of a simplified model Hamiltonian with contact interaction projected onto the Lowest Landau Level. This effective Hamiltonian models the bosonic analogue of the Fractional Quantum Hall Effect (FQHE). For a fixed number of particles, we also prove convergence of states; in particular, in a certain regime we show convergence towards the bosonic Laughlin wavefunction. This is the first rigorous justification of the effective FQHE Hamiltonian for rapidly rotating Bose gases. We review previous results on this effective Hamiltonian and outline open problems.
AU - Lewin, Mathieu
AU - Robert Seiringer
ID - 2387
IS - 5
JF - Journal of Statistical Physics
TI - Strongly correlated phases in rapidly rotating Bose gases
VL - 137
ER -
TY - JOUR
AB - This paper provides self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem recapitulates insights achieved by other investigators, and clarifies the connection of coherence and proper scoring rules to Bregman divergence.
AU - Predd, Joel B
AU - Robert Seiringer
AU - Lieb, Élliott H
AU - Osherson, Daniel N
AU - Poor, Harold V
AU - Kulkarni, Sanjeev R
ID - 2388
IS - 10
JF - IEEE Transactions on Information Theory
TI - Probabilistic coherence and proper scoring rules
VL - 55
ER -
TY - CONF
AB - Let EMBEDk→d be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into ℝd? Known results easily imply polynomiality of EMBEDk→2 (k = 1, 2; the case k = 1, d = 2 is graph planarity) and of EMBEDk→2k for all k ≥ 3 (even if k is not considered fixed). We show that the celebrated result of Novikov on the algorithmic unsolvability of recognizing the 5-sphere implies that EMBED d→d and EMBED(d-1)→d are undecidable for each d ≥ 5. Our main result is NP-hardness of EMBED2→4 and, more generally, of EMBEDk→d for all k, d with d ≥ 4 and d ≥ k ≥ (2d - 2)/3.
AU - Matoušek, Jiří
AU - Martin Tancer
AU - Uli Wagner
ID - 2433
TI - Hardness of embedding simplicial complexes in ℝd
ER -
TY - JOUR
AB - G protein-coupled receptors (GPCRs) have critical functions in intercellular communication. Although a wide range of different receptors have been identified in the same cells, the mechanism by which signals are integrated remains elusive. The ability of GPCRs to form dimers or larger hetero-oligomers is thought to generate such signal integration. We examined the molecular mechanisms responsible for the GABAB receptor-mediated potentiation of the mGlu receptor signalling reported in Purkinje neurons. We showed that this effect does not require a physical interaction between both receptors. Instead, it is the result of a more general mechanism in which the βγ subunits produced by the Gi-coupled GABAB receptor enhance the mGlu-mediated Gq response. Most importantly, this mechanism could be generally applied to other pairs of Gi- and Gq-coupled receptors and the signal integration varied depending on the time delay between activation of each receptor. Such a mechanism helps explain specific properties of cells expressing two different Gi- and Gq-coupled receptors activated by a single transmitter, or properties of GPCRs naturally coupled to both types of the G protein.
AU - Rives, Marie L
AU - Vol, Claire
AU - Fukazawa, Yugo
AU - Tinel, Norbert
AU - Trinquet, Eric
AU - Ayoub, Mohammed A
AU - Ryuichi Shigemoto
AU - Pin, Jean-Philippe
AU - Prezèau, Laurent
ID - 2499
IS - 15
JF - EMBO Journal
TI - Crosstalk between GABAB and mGlu1a receptors reveals new insight into GPCR signal integration
VL - 28
ER -
TY - JOUR
AU - Weijers, Dolf
AU - Friml, Jirí
ID - 3051
IS - 6
JF - Cell
TI - SnapShot: Auxin signaling and transport
VL - 136
ER -
TY - JOUR
AB - The dynamic, differential distribution of the hormone auxin within plant tissues controls an impressive variety of developmental processes, which tailor plant growth and morphology to environmental conditions. Various environmental and endogenous signals can be integrated into changes in auxin distribution through their effects on local auxin biosynthesis and intercellular auxin transport. Individual cells interpret auxin largely by a nuclear signaling pathway that involves the F box protein TIR1 acting as an auxin receptor. Auxin-dependent TIR1 activity leads to ubiquitination-based degradation of transcriptional repressors and complex transcriptional reprogramming. Thus, auxin appears to be a versatile trigger of preprogrammed developmental changes in plant cells.
AU - Vanneste, Steffen
AU - Friml, Jirí
ID - 3052
IS - 6
JF - Cell
TI - Auxin: A trigger for change in plant development
VL - 136
ER -
TY - JOUR
AB - The differential distribution of the plant signaling molecule auxin is required for many aspects of plant development. Local auxin maxima and gradients arise as a result of local auxin metabolism and, predominantly, from directional cell-to-cell transport. In this primer, we discuss how the coordinated activity of several auxin influx and efflux systems, which transport auxin across the plasma membrane, mediates directional auxin flow. This activity crucially contributes to the correct setting of developmental cues in embryogenesis, organogenesis, vascular tissue formation and directional growth in response to environmental stimuli.
AU - Petrášek, Jan
AU - Friml, Jirí
ID - 3057
IS - 16
JF - Development
TI - Auxin transport routes in plant development
VL - 136
ER -
TY - JOUR
AB - The PIN-FORMED (PIN) proteins are secondary transporters acting in the efflux of the plant signal molecule auxin from cells. They are asymmetrically localized within cells and their polarity determines the directionality of intercellular auxin flow. PIN genes are found exclusively in the genomes of multicellular plants and play an important role in regulating asymmetric auxin distribution in multiple developmental processes, including embryogenesis, organogenesis, tissue differentiation and tropic responses. All PIN proteins have a similar structure with amino- and carboxy-terminal hydrophobic, membrane-spanning domains separated by a central hydrophilic domain. The structure of the hydrophobic domains is well conserved. The hydrophilic domain is more divergent and it determines eight groups within the protein family. The activity of PIN proteins is regulated at multiple levels, including transcription, protein stability, subcellular localization and transport activity. Different endogenous and environmental signals can modulate PIN activity and thus modulate auxin-distribution-dependent development. A large group of PIN proteins, including the most ancient members known from mosses, localize to the endoplasmic reticulum and they regulate the subcellular compartmentalization of auxin and thus auxin metabolism. Further work is needed to establish the physiological importance of this unexpected mode of auxin homeostasis regulation. Furthermore, the evolution of PIN-based transport, PIN protein structure and more detailed biochemical characterization of the transport function are important topics for further studies.
AU - Křeček, Pavel
AU - Skůpa, Petr
AU - Libus, Jiří
AU - Naramoto, Satoshi
AU - Tejos, Ricardo
AU - Friml, Jirí
AU - Zažímalová, Eva
ID - 3061
IS - 12
JF - Genome Biology
TI - The PIN-FORMED (PIN) protein family of auxin transporters
VL - 10
ER -
TY - JOUR
AB - The problem of obtaining the maximum a posteriori estimate of a general discrete Markov random field (i.e., a Markov random field defined using a discrete set of labels) is known to be NP-hard. However, due to its central importance in many applications, several approximation algorithms have been proposed in the literature. In this paper, we present an analysis of three such algorithms based on convex relaxations: (i) LP-S: the linear programming (LP) relaxation proposed by Schlesinger (1976) for a special case and independently in Chekuri et al. (2001), Koster et al. (1998), and Wainwright et al. (2005) for the general case; (ii) QP-RL: the quadratic programming (QP) relaxation of Ravikumar and Lafferty (2006); and (iii) SOCP-MS: the second order cone programming (SOCP) relaxation first proposed by Muramatsu and Suzuki (2003) for two label problems and later extended by Kumar et al. (2006) for a general label set.
We show that the SOCP-MS and the QP-RL relaxations are equivalent. Furthermore, we prove that despite the flexibility in the form of the constraints/objective function offered by QP and SOCP, the LP-S relaxation strictly dominates (i.e., provides a better approximation than) QP-RL and SOCP-MS. We generalize these results by defining a large class of SOCP (and equivalent QP) relaxations which is dominated by the LP-S relaxation. Based on these results we propose some novel SOCP relaxations which define constraints using random variables that form cycles or cliques in the graphical model representation of the random field. Using some examples we show that the new SOCP relaxations strictly dominate the previous approaches.
AU - Kumar, M Pawan
AU - Vladimir Kolmogorov
AU - Torr, Philip H
ID - 3197
JF - Journal of Machine Learning Research
TI - An analysis of convex relaxations for MAP estimation of discrete MRFs
VL - 10
ER -
TY - CONF
AB - We give polynomial-time algorithms for computing the values of Markov decision processes (MDPs) with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path in the MDP is the limsup (resp. liminf) of all rewards along the path. The value of an MDP is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the MDP. Using our result on MDPs, we show that turn-based stochastic games with limsup and liminf objectives can be solved in NP ∩ coNP.
AU - Krishnendu Chatterjee
AU - Thomas Henzinger
ID - 3503
TI - Probabilistic systems with limsup and liminf objectives
VL - 5489
ER -
TY - CONF
AB - Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights.
We introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the first player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata.
For quantitative languages L 1 and L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1, and the sum L 1 + L 2. We establish the closure properties of all classes of alternating weighted automata with respect to these four operations.
We next compare the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words. In particular, for limit average and discounted sum, we show that alternation brings more expressive power than nondeterminism.
Finally, we present decidability results and open questions for the quantitative extension of the classical decision problems in automata theory: emptiness, universality, language inclusion, and language equivalence.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 4542
TI - Alternating weighted automata
VL - 5699
ER -
TY - CONF
AB - We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. We present in this paper a strategy improvement algorithm for computing the value of a concurrent safety game, that is, the maximal probability with which player 1 can enforce the safety objective. The algorithm yields a sequence of player-1 strategies which ensure probabilities of winning that converge monotonically to the value of the safety game. Our result is significant because the strategy improvement algorithm provides, for the first time, a way to approximate the value of a concurrent safety game from below. Since a value iteration algorithm, or a strategy improvement algorithm for reachability games, can be used to approximate the same value from above, the combination of both algorithms yields a method for computing a converging sequence of upper and lower bounds for the values of concurrent reachability and safety games. Previous methods could approximate the values of these games only from one direction, and as no rates of convergence are known, they did not provide a practical way to solve these games.
AU - Krishnendu Chatterjee
AU - de Alfaro, Luca
AU - Thomas Henzinger
ID - 4544
TI - Termination criteria for solving concurrent safety and reachability games
ER -
TY - CONF
AB - A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 4545
TI - A survey of stochastic games with limsup and liminf objectives
VL - 5556
ER -
TY - CONF
AB - Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the “goodness” of an implementation. Using games with corresponding quantitative objectives, we can synthesize “optimal” implementations, which are preferred among the set of possible implementations that satisfy a given specification.
In particular, we show how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems. In this framework, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and the solution of games with both lexicographic mean-payoff and parity objectives (for liveness requirements). We present algorithms for solving both kinds of novel graph games.
AU - Bloem, Roderick
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
ID - 4569
TI - Better quality in synthesis through quantitative objectives
VL - 5643
ER -
TY - CONF
AB - Alpaga is a solver for two-player parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs a winning strategy. The tool provides a symbolic implementation of a recent algorithm based on antichains.
AU - Berwanger, Dietmar
AU - Krishnendu Chatterjee
AU - De Wulf, Martin
AU - Doyen, Laurent
AU - Thomas Henzinger
ID - 4580
TI - Alpaga: A tool for solving parity games with imperfect information
VL - 5505
ER -
TY - GEN
AB - Ising models with pairwise interactions are the least structured, or maximum-entropy, probability distributions that exactly reproduce measured pairwise correlations between spins. Here we use this equivalence to construct Ising models that describe the correlated spiking activity of populations of 40 neurons in the salamander retina responding to natural movies. We show that pairwise interactions between neurons account for observed higher-order correlations, and that for groups of 10 or more neurons pairwise interactions can no longer be regarded as small perturbations in an independent system. We then construct network ensembles that generalize the network instances observed in the experiment, and study their thermodynamic behavior and coding capacity. Based on this construction, we can also create synthetic networks of 120 neurons, and find that with increasing size the networks operate closer to a critical point and start exhibiting collective behaviors reminiscent of spin glasses. We examine closely two such behaviors that could be relevant for neural code: tuning of the network to the critical point to maximize the ability to encode diverse stimuli, and using the metastable states of the Ising Hamiltonian as neural code words.
AU - Gasper Tkacik
AU - Schneidman, Elad
AU - Berry, Michael J
AU - Bialek, William S
ID - 3732
T2 - ArXiv
TI - Spin glass models for a network of real neurons
VL - q-bio.NC
ER -
TY - JOUR
AB - There is a close analogy between statistical thermodynamics and the evolution of allele frequencies under mutation, selection and random drift. Wright's formula for the stationary distribution of allele frequencies is analogous to the Boltzmann distribution in statistical physics. Population size, 2N, plays the role of the inverse temperature, 1/kT, and determines the magnitude of random fluctuations. Log mean fitness, View the MathML source, tends to increase under selection, and is analogous to a (negative) energy; a potential function, U, increases under mutation in a similar way. An entropy, SH, can be defined which measures the deviation from the distribution of allele frequencies expected under random drift alone; the sum View the MathML source gives a free fitness that increases as the population evolves towards its stationary distribution. Usually, we observe the distribution of a few quantitative traits that depend on the frequencies of very many alleles. The mean and variance of such traits are analogous to observable quantities in statistical thermodynamics. Thus, we can define an entropy, SΩ, which measures the volume of allele frequency space that is consistent with the observed trait distribution. The stationary distribution of the traits is View the MathML source; this applies with arbitrary epistasis and dominance. The entropies SΩ, SH are distinct, but converge when there are so many alleles that traits fluctuate close to their expectations. Populations tend to evolve towards states that can be realised in many ways (i.e., large SΩ), which may lead to a substantial drop below the adaptive peak; we illustrate this point with a simple model of genetic redundancy. This analogy with statistical thermodynamics brings together previous ideas in a general framework, and justifies a maximum entropy approximation to the dynamics of quantitative traits.
AU - Barton, Nicholas H
AU - Coe, Jason
ID - 3775
IS - 2
JF - Journal of Theoretical Biology
TI - On the application of statistical physics to evolutionary biology
VL - 259
ER -
TY - JOUR
AB - Why are sinistral snails so rare? Two main hypotheses are that selection acts against the establishment of new coiling morphs, because dextral and sinistral snails have trouble mating, or else a developmental constraint prevents the establishment of sinistrals. We therefore used an isolate of the snail Lymnaea stagnalis, in which sinistrals are rare, and populations of Partula suturalis, in which sinistrals are common, as well as a mathematical model, to understand the circumstances by which new morphs evolve. The main finding is that the sinistral genotype is associated with reduced egg viability in L. stagnalis, but in P. suturalis individuals of sinistral and dextral genotype appear equally fecund, implying a lack of a constraint. As positive frequency-dependent selection against the rare chiral morph in P. suturalis also operates over a narrow range (< 3%), the results suggest a model for chiral evolution in snails in which weak positive frequency-dependent selection may be overcome by a negative frequency-dependent selection, such as reproductive character displacement. In snails, there is not always a developmental constraint. As the direction of cleavage, and thus the directional asymmetry of the entire body, does not generally vary in other Spiralia (annelids, echiurans, vestimentiferans, sipunculids and nemerteans), it remains an open question as to whether this is because of a constraint and/or because most taxa do not have a conspicuous external asymmetry (like a shell) upon which selection can act.
AU - Davison, Angus
AU - Barton, Nicholas H
AU - Clarke, Bryan
ID - 3780
IS - 8
JF - Journal of Evolutionary Biology
TI - The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails
VL - 22
ER -
TY - CONF
AB - In this paper we extend the work of Alfaro, Henzinger et al. on interface theories for component-based design. Existing interface theories often fail to capture functional relations between the inputs and outputs of an interface. For example, a simple synchronous interface that takes as input a number n ≥ 0 and returns, at the same time, as output n + 1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports synchronous interfaces, both stateless and stateful. It includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions.
AU - Tripakis, Stavros
AU - Lickly, Ben
AU - Henzinger, Thomas A
AU - Lee, Edward
ID - 3837
T2 - EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
TI - On relational interfaces
ER -
TY - CONF
AB - We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model.
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
AU - Wolf, Verena
ID - 3841
TI - Formalisms for specifying Markovian population models
VL - 5797
ER -
TY - CONF
AB - Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous- time Markov chain (CTMC).
Standard Uniformization (SU) is an efficient method for the transient analysis of CTMCs. For systems with very different time scales, such as biochemical reaction networks, SU is computationally expensive. In these cases, a variant of SU, called adaptive uniformization (AU), is known to reduce the large number of iterations needed by SU. The additional difficulty of AU is that it requires the solution of a birth process.
In this paper we present an on-the-fly variant of AU, where we improve the original algorithm for AU at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks.
AU - Didier, Frédéric
AU - Henzinger, Thomas A
AU - Mateescu, Maria
AU - Wolf, Verena
ID - 3843
IS - 6
TI - Fast adaptive uniformization of the chemical master equation
VL - 4
ER -
TY - CONF
AB - The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety (schedulability of host computation). We present a modular abstract syntax and semantics for HTL, modular checks of well-formedness, race freedom, and transmission safety, and modular code distribution. Our contributions here complement previous results on HTL time safety and modular code generation. Modularity in HTL can be utilized in easy program composition as well as fast program analysis and code generation, but also in so-called runtime patching, where program components may be modified at runtime.
AU - Henzinger, Thomas A
AU - Kirsch, Christoph
AU - Marques, Eduardo
AU - Sokolova, Ana
ID - 3844
TI - Distributed, modular HTL
ER -
TY - JOUR
AB - We compare anti-parasite defences at the level of multicellular organisms and insect societies, and find that selection by parasites at these two organisational levels is often very similar and has created a number of parallel evolutionary solutions in the host's immune response. The defence mechanisms of both individuals and insect colonies start with border defences to prevent parasite intake and are followed by soma defences that prevent the establishment and spread of the parasite between the body's cells or the social insect workers. Lastly, germ line defences are employed to inhibit infection of the reproductive tissue of organisms or the reproductive individuals in colonies. We further find sophisticated self/non-self-recognition systems operating at both levels, which appear to be vital in maintaining the integrity of the body or colony as a reproductive entity. We then expand on the regulation of immune responses and end with a contemplation of how evolution may shape the different immune components, both within and between levels. The aim of this review is to highlight common evolutionary principles acting in disease defence at the level of both individual organisms and societies, thereby linking the fields of physiological and ecological immunology.
AU - Cremer, Sylvia
AU - Sixt, Michael K
ID - 3946
IS - 1513
JF - Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences
TI - Analogies in the evolution of individual and social immunity
VL - 364
ER -
TY - JOUR
AB - Games on graphs with omega-regular objectives provide a model for the control and synthesis of reactive systems. Every omega-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Buchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Horn, Florian
ID - 3870
IS - 1
JF - ACM Transactions on Computational Logic (TOCL)
TI - Finitary winning in omega-regular games
VL - 11
ER -
TY - CONF
AB - Nondeterministic weighted automata are finite automata with numerical weights oil transitions. They define quantitative languages 1, that assign to each word v; a real number L(w). The value of ail infinite word w is computed as the maximal value of all runs over w, and the value of a run as the supremum, limsup liminf, limit average, or discounted sum of the transition weights. We introduce probabilistic weighted antomata, in which the transitions are chosen in a randomized (rather than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics), the value of a word v) is the largest real v such that the runs over w have value at least v with probability I (resp. positive probability). We study the classical questions of automata theory for probabilistic weighted automata: emptiness and universality, expressiveness, and closure under various operations oil languages. For quantitative languages, emptiness university axe defined as whether the value of some (resp. every) word exceeds a given threshold. We prove some, of these questions to he decidable, and others undecidable. Regarding expressive power, we show that probabilities allow its to define a wide variety of new classes of quantitative languages except for discounted-sum automata, where probabilistic choice is no more expressive than nondeterminism. Finally we live ail almost complete picture of the closure of various classes of probabilistic weighted automata for the following, provide, is operations oil quantitative languages: maximum, sum. and numerical complement.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 3871
TI - Probabilistic weighted automata
VL - 5710
ER -
TY - CONF
AB - We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in image processing but is closer to its mathematical roots, which are Morse theory and homological algebra. It allows for the implicit treatment of an underlying mesh, thus combining the structural integrity of its mathematical foundations with the computational efficiency of image processing.
AU - Edelsbrunner, Herbert
AU - Harer, John
ID - 3968
TI - The persistent Morse complex segmentation of a 3-manifold
VL - 5903
ER -
TY - JOUR
AB - Populations living in a spatially and temporally changing environment can adapt to the changing optimum and/or migrate toward favorable habitats. Here we extend previous analyses with a static optimum to allow the environment to vary in time as well as in space. The model follows both population dynamics and the trait mean under stabilizing selection, and the outcomes can be understood by comparing the loads due to genetic variance, dispersal, and temporal change. With fixed genetic variance, we obtain two regimes: (1) adaptation that is uniform along the environmental gradient and that responds to the moving optimum as expected for panmictic populations and when the spatial gradient is sufficiently steep, and (2) a population with limited range that adapts more slowly than the environmental optimum changes in both time and space; the population therefore becomes locally extinct and migrates toward suitable habitat. We also use a population‐genetic model with many loci to allow genetic variance to evolve, and we show that the only solution now has uniform adaptation.
AU - Polechova, Jitka
AU - Barton, Nicholas H
AU - Marion, Glenn
ID - 4136
IS - 5
JF - American Naturalist
TI - Species' range: Adaptation in space and time
VL - 174
ER -
TY - JOUR
AB - Felsenstein distinguished two ways by which selection can directly strengthen isolation. First, a modifier that strengthens prezygotic isolation can be favored everywhere. This fits with the traditional view of reinforcement as an adaptation to reduce deleterious hybridization by strengthening assortative mating. Second, selection can favor association between different incompatibilities, despite recombination. We generalize this “two allele” model to follow associations among any number of incompatibilities, which may include both assortment and hybrid inviability. Our key argument is that this process, of coupling between incompatibilities, may be quite different from the usual view of reinforcement: strong isolation can evolve through the coupling of any kind of incompatibility, whether prezygotic or postzygotic. Single locus incompatibilities become coupled because associations between them increase the variance in compatibility, which in turn increases mean fitness if there is positive epistasis. Multiple incompatibilities, each maintained by epistasis, can become coupled in the same way. In contrast, a single-locus incompatibility can become coupled with loci that reduce the viability of haploid hybrids because this reduces harmful recombination. We obtain simple approximations for the limits of tight linkage, and strong assortment, and show how assortment alleles can invade through associations with other components of reproductive isolation.
AU - Barton, Nicholas H
AU - De Cara, Maria
ID - 4242
IS - 5
JF - Evolution; International Journal of Organic Evolution
TI - The evolution of strong reproductive isolation
VL - 63
ER -
TY - CONF
AB - Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We present RML, a new high-level language for expressing concurrent algorithms with a hardware-level atomicity of instructions, and whose semantics is parametrized by various relaxed memory models. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order.
AU - Guerraoui, Rachid
AU - Thomas Henzinger
AU - Vasu Singh
ID - 4383
TI - Software transactional memory on relaxed memory models
VL - 5643
ER -
TY - CONF
AB - For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words.
AU - Alur, Rajeev
AU - Cerny, Pavol
AU - Weinstein, Scott
ID - 4403
TI - Algorithmic analysis of array-accessing programs
VL - 5771
ER -
TY - CONF
AB - We present an on-the-fly abstraction technique for infinite-state continuous -time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play an important role in the stochastic modeling of biological systems. We approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models, each depending on the previous one. Each abstract model is a finite Markov chain that represents the behavior of the original, infinite chain during a specific time interval. Our approach provides complete information about probability distributions, not just about individual parameters like the mean. The error of each abstraction can be computed, and the precision of the abstraction refined when desired. We implemented the algorithm and demonstrate its usefulness and efficiency on several case studies from systems biology.
AU - Thomas Henzinger
AU - Maria Mateescu
AU - Wolf, Verena
ID - 4453
TI - Sliding-window abstraction for infinite Markov chains
VL - 5643
ER -
TY - GEN
AB - Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides efficient implementations of several reduction based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
AU - Radhakrishna, Arjun
ID - 5393
SN - 2664-1690
TI - Gist: A solver for probabilistic games
ER -
TY - GEN
AB - We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Horn, Florian
ID - 5394
SN - 2664-1690
TI - Improved lower bounds for request-response and finitary Streett games
ER -
TY - GEN
AB - We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observa- tions. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDPs with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDPs with parity objectives and its subclasses.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 5395
SN - 2664-1690
TI - Qualitative analysis of partially-observable Markov decision processes
ER -