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

Program logics for homogeneous meta-programming.

A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros were introduced to Lisp, yet we have little idea how formally to reason about metaprograms. This paper provides the first program logics for homogeneous metaprogramming – using a variant of MiniMLe by Davies and Pfenning as underlying meta-programming language.We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics

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

The star height of reset-free events and strictly locally testable events

An algorithm is presented for determining the star height of reset-free events and strictly locally testable events

Lending Petri nets and contracts

Choreography-based approaches to service composition typically assume that, after a set of services has been found which correctly play the roles prescribed by the choreography, each service respects his role. Honest services are not protected against adversaries. We propose a model for contracts based on a extension of Petri nets, which allows services to protect themselves while still realizing the choreography. We relate this model with Propositional Contract Logic, by showing a translation of formulae into our Petri nets which preserves the logical notion of agreement, and allows for compositional verification

Control in the π-calculus

This paper presents a type-preserving translation from the call-by-value -calculus ( v-calculus) into a typed -calculus, and shows full abstraction up to maximally consistent observational congruences in both calculi. The -calculus has a particularly simple representation as typed mobile processes where a unique stateless replicated input is associated to each name. The corresponding -calculus is a proper subset of the linear -calculus, the latter being able to embed the simplytyped -calculus fully abstractly. Strong normalisability of the v-calculus is an immediate consequence of this correspondence and the strong normalisability of the linear -calculus, using the standard argument based on simulation between the v-calculus and its translation. Full abstraction, our main result, is proved via an inverse transformation from the typed -terms which inhabit the encoded v-types into the v-calculus (the so-called de nability argument), using proof techniques from games semantics and process calculi. A tight operational correspondence assisted by the de nability result opens a possibility to use typed -calculi as a tool to investigate and analyse behaviours of various control operators and associated calculi in a uniform setting, possibly integrated with other language primitives and operational structures

Strong normalisation in the π-calculus

We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed λ-calculi and linear logic with process-theoretic reasoning. It is adaptable to systems involving state, polymorphism and other extensions. Strong normalisation is shown to have significant consequences, including finite axiomatisation of weak bisimilarity, a fully abstract embedding of the simply-typed λ-calculus with products and sums and basic liveness in interaction. Strong normalisability has been extensively studied as a fundamental property in functional calculi, term rewriting and logical systems. This work is one of the first steps to extend theories and proof methods for strong normalisability to the context of name-passing processes

High-field phase diagram of the Haldane-gap antiferromagnet Ni(C5H14N2)2N3(PF6)Ni (C_5 H_{14} N_2)_2 N_3 (PF_6)

We have determined the magnetic phase diagram of the quasi-one-dimensional $S=$ 1 Heisenberg antiferromagnet $Ni (C_5 H_{14} N_2)_2 N_3 (PF_6)$ by specific heat measurements to 150 mK in temperature and 32 T in magnetic field. When field is applied along the spin-chain direction, a new phase appears at $H_{c2}\approx 14$ T. For the previously known phases of field-induced order, accurate determination is made of the power-law exponents of the ordering temperature near the zero-temperature critical field $H_c$, owing to the four-fold improvement of the minimum temperature over the previous work. The results are compared with the predictions based on the Bose-Einstein condensation of triplet excitations. Substituting deuterium for hydrogen is found to slightly reduce the interchain exchange.Comment: 6 pages, 6 figure

Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types

We extend the linear π-calculus with composite and equi-recursive types in a way that enables the sharing of data containing linear values, provided that there is no overlapping access on such values. We show that the extended type system admits a complete type reconstruction algorithm and, as a by-product, we solve the problem of reconstruction for equi-recursive session types

Lateral distribution of high energy hadrons and gamma ray in air shower cores observed with emulsion chambers

A high energy event of a bundle of electrons, gamma rays and hadronic gamma rays in an air shower core were observed. The bundles were detected with an emulsion chamber with thickness of 15 cm lead. This air shower is estimated to be initiated with a proton with energy around 10 to the 17th power to 10 to the 18th power eV at an altitude of around 100 gmc/2. Lateral distributions of the electromagnetic component with energy above 2 TeV and also the hadronic component of energy above 6 TeV of this air shower core were determined. Particles in the bundle are produced with process of the development of the nuclear cascade, the primary energy of each interaction in the cascade which produces these particles is unknown. To know the primary energy dependence of transverse momentum, the average products of energy and distance for various average energies of secondary particles are studied