On Asynchronous Session Semantics

This paper studies a behavioural theory of the π-calculus with session types under the fundamental principles of the practice of distributed computing — asynchronous communication which is order-preserving inside each connection (session), augmented with asynchronous inspection of events (message arrivals). A new theory of bisimulations is introduced, distinct from either standard asynchronous or synchronous bisimilarity, accurately capturing the semantic nature of session-based asynchronously communicating processes augmented with event primitives. The bisimilarity coincides with the reduction-closed barbed congruence. We examine its properties and compare them with existing semantics. Using the behavioural theory, we verify that the program transformation of multithreaded into event-driven session based processes, using Lauer-Needham duality, is type and semantic preserving

An Introduction to Pervasive Interface Automata

Pervasive systems are often context-dependent, component based systems in which components expose interfaces and offer one or more services. These systems may evolve in unpredictable ways, often through component replacement. We present pervasive interface automata as a formalism for modelling components and their composition. Pervasive interface automata are based on the interface automata of Henzinger et al, with several significant differences. We expand their notion of input and output actions to combinations of input, output actions, and callable methods and method calls. Whereas interfaces automata have a refinement relation, we argue the crucial relation in pervasive systems is component replacement, which must include consideration of the services offered by a component and assumptions about the environment. We illustrate pervasive interface autmotata and component replacement with a small case study of a pervasive application for sports predictions

Covariation Among Vowel Height Effects on Acoustic Measures

Covariation among vowel height effects on vowel intrinsic fundamental frequency (IF0), voice onset time (VOT), and voiceless interval duration (VID) is analyzed to assess the plausibility of a common physiological mechanism underlying variation in these measures. Phrases spoken by 20 young adults, containing words composed of initial voiceless stops or /s/ and high or low vowels, were produced in habitual and voluntarily increased F0 conditions. High vowels were associated with increased IF0 and longer VIDs. VOT and VID exhibited significant covariation with IF0 only for males at habitua

A new type of solution of the Schr\"odinger equation on a self-similar fractal potential

Scattering a quantum particle by a self-similar fractal potential on a Cantor set is investigated. We present a new type of solution of the functional equation for the transfer matrix of this potential, which was derived earlier from the Schr\"odinger equation.Comment: Latex, 4 pages, 7 eps-figures; the old figures are renewed and new ones are adde

Fluidic Proportional Thruster System Final Report

Fluidic proportional thrust control system with vortex valve

Nucleosynthesis Modes in the High-Entropy-Wind of Type II Supernovae: Comparison of Calculations with Halo-Star Observations

While the high-entropy wind (HEW) of Type II supernovae remains one of the more promising sites for the rapid neutron-capture (r-) process, hydrodynamic simulations have yet to reproduce the astrophysical conditions under which the latter occurs. We have performed large-scale network calculations within an extended parameter range of the HEW, seeking to identify or to constrain the necessary conditions for a full reproduction of all r-process residuals N_{r,\odot}=N_{\odot}-N_{s,\odot} by comparing the results with recent astronomical observations. A superposition of weighted entropy trajectories results in an excellent reproduction of the overall N_{r,\odot}-pattern beyond Sn. For the lighter elements, from the Fe-group via Sr-Y-Zr to Ag, our HEW calculations indicate a transition from the need for clearly different sources (conditions/sites) to a possible co-production with r-process elements, provided that a range of entropies are contributing. This explains recent halo-star observations of a clear non-correlation of Zn and Ge and a weak correlation of Sr - Zr with heavier r-process elements. Moreover, new observational data on Ru and Pd seem to confirm also a partial correlation with Sr as well as the main r-process elements (e.g. Eu).Comment: 15 pages, 1 table, 4 figures; To be published in the Astrophysical Journal Letter

On Global Types and Multi-Party Session

Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessions obtained projecting our global types enjoy a liveness property in addition to the traditional progress and are shown to be sound and complete with respect to the set of traces of the originating global type. Our notion of completeness is less demanding than the classical ones, allowing a multi-party session to leave out redundant traces from an underspecified global type. In addition to the technical content, we discuss some limitations of our language of global types and provide an extensive comparison with related specification languages adopted in different communities

The Paths to Choreography Extraction

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification (e.g., Multiparty Session Types) and synthesis of correct-by-construction software (Choreographic Programming). They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most existing software does not come with choreographies yet, which prevents their application. To attack this problem, we propose a novel methodology (called choreography extraction) that, given a set of programs or protocol specifications, automatically constructs a choreography that describes their behavior. The key to our extraction is identifying a set of paths in a graph that represents the symbolic execution of the programs of interest. Our method improves on previous work in several directions: we can now deal with programs that are equipped with a state and internal computation capabilities; time complexity is dramatically better; we capture programs that are correct but not necessarily synchronizable, i.e., they work because they exploit asynchronous communication

Half-ordered state in the anisotropic Haldane-gap antiferromagnet NDMAP

Neutron diffraction experiments performed on the Haldane gap material NDMAP in high magnetic fields applied at an angle to the principal anisotropy axes reveal two consecutive field-induced phase transitions. The low-field phase is the gapped Haldane state, while at high fields the system exhibits 3-dimensional long-range Neel order. In a peculiar phase found at intermediate fields only half of all the spin chains participate in the long-range ordering, while the other half remains disordered and gapped.Comment: 4 pages, 2 figures, submitted to Phys. Rev.

Implementing Session Centered Calculi

Recently, specific attention has been devoted to the development of service oriented process calculi. Besides the foundational aspects, it is also interesting to have prototype implementations for them in order to assess usability and to minimize the gap between theory and practice. Typically, these implementations are done in Java taking advantage of its mechanisms supporting network applications. However, most of the recurrent features of service oriented applications are re-implemented from scratch. In this paper we show how to implement a service oriented calculus, CaSPiS (Calculus of Services with Pipelines and Sessions) using the Java framework IMC, where recurrent mechanisms for network applications are already provided. By using the session oriented and pattern matching communication mechanisms provided by IMC, it is relatively simple to implement in Java all CaSPiS abstractions and thus to easily write the implementation in Java of a CaSPiS process