Asynchronous Games over Tree Architectures

We consider the task of controlling in a distributed way a Zielonka asynchronous automaton. Every process of a controller has access to its causal past to determine the next set of actions it proposes to play. An action can be played only if every process controlling this action proposes to play it. We consider reachability objectives: every process should reach its set of final states. We show that this control problem is decidable for tree architectures, where every process can communicate with its parent, its children, and with the environment. The complexity of our algorithm is l-fold exponential with l being the height of the tree representing the architecture. We show that this is unavoidable by showing that even for three processes the problem is EXPTIME-complete, and that it is non-elementary in general

Numerical and experimental verification of a theoretical model of ripple formation in ice growth under supercooled water film flow

Little is known about morphological instability of a solidification front during the crystal growth of a thin film of flowing supercooled liquid with a free surface: for example, the ring-like ripples on the surface of icicles. The length scale of the ripples is nearly 1 cm. Two theoretical models for the ripple formation mechanism have been proposed. However, these models lead to quite different results because of differences in the boundary conditions at the solid-liquid interface and liquid-air surface. The validity of the assumption used in the two models is numerically investigated and some of the theoretical predictions are compared with experiments.Comment: 30 pages, 9 figure

On the number of simple arrangements of five double pseudolines

We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangements, proved in this paper. Counting results derived from an implementation of our algorithm are also reported.Comment: 24 pages, 16 figures, 6 table

Robustness of the European power grids under intentional attack

The power grid defines one of the most important technological networks of our times and sustains our complex society. It has evolved for more than a century into an extremely huge and seemingly robust and well understood system. But it becomes extremely fragile as well, when unexpected, usually minimal, failures turn into unknown dynamical behaviours leading, for example, to sudden and massive blackouts. Here we explore the fragility of the European power grid under the effect of selective node removal. A mean field analysis of fragility against attacks is presented together with the observed patterns. Deviations from the theoretical conditions for network percolation (and fragmentation) under attacks are analysed and correlated with non topological reliability measures.Comment: 7 pages, 4 figure

Phonon Squeezed States Generated by Second Order Raman Scattering

We study squeezed states of phonons, which allow a reduction in the quantum fluctuations of the atomic displacements to below the zero-point quantum noise level of coherent phonon states. We investigate the generation of squeezed phonon states using a second order Raman scattering process. We calculate the expectation values and fluctuations of both the atomic displacement and the lattice amplitude operators, as well as the effects of the phonon squeezed states on macroscopically measurable quantities, such as changes in the dielectric constant. These results are compared with recent experiments.Comment: 4 pages, REVTE

Structural Synthesis for GXW Specifications

We define the GXW fragment of linear temporal logic (LTL) as the basis for synthesizing embedded control software for safety-critical applications. Since GXW includes the use of a weak-until operator we are able to specify a number of diverse programmable logic control (PLC) problems, which we have compiled from industrial training sets. For GXW controller specifications, we develop a novel approach for synthesizing a set of synchronously communicating actor-based controllers. This synthesis algorithm proceeds by means of recursing over the structure of GXW specifications, and generates a set of dedicated and synchronously communicating sub-controllers according to the formula structure. In a subsequent step, 2QBF constraint solving identifies and tries to resolve potential conflicts between individual GXW specifications. This structural approach to GXW synthesis supports traceability between requirements and the generated control code as mandated by certification regimes for safety-critical software. Synthesis for GXW specifications is in PSPACE compared to 2EXPTIME-completeness of full-fledged LTL synthesis. Indeed our experimental results suggest that GXW synthesis scales well to industrial-sized control synthesis problems with 20 input and output ports and beyond.Comment: The long (including appendix) version being reviewed by CAV'16 program committee. Compared to the submitted version, one author (out of her wish) is moved to the Acknowledgement. (v2) Corrected typos. (v3) Add an additional remark over environment assumption and easy corner case

Short Subjects: When Archivist Meets Architect

Most archivists are better prepared to file and retrieve blueprints than to read them, more comfortable with COM (Computer Output Microfiche) than CAD (Computer Assisted Design), and better prepared to discuss linear feet of documents than square feet of floor space. Yet archival repositories do not spring up full-blown, and if the space an archival facility is to occupy is going to be utilitarian and provide for the various specialized needs of an archives, the archivist must become involved with the design process. In practical fact this means working with an architect either to design new space or to refurbish old space. This can be done, even if the archivist is untrained in construction methodology, mechanical engineering, or quantum physics

Using Strategy Improvement to Stay Alive

We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy -- depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice