Higher-Order Concurrency: Expressiveness and Decidability Results

Higher-order process calculi are formalisms for concurrency in which processes can be passed around in communications. Higher-order (or process-passing) concurrency is often presented as an alternative paradigm to the first order (or name-passing) concurrency of the pi-calculus for the description of mobile systems. These calculi are inspired by, and formally close to, the lambda-calculus, whose basic computational step ---beta-reduction--- involves term instantiation. The theory of higher-order process calculi is more complex than that of first-order process calculi. This shows up in, for instance, the definition of behavioral equivalences. A long-standing approach to overcome this burden is to define encodings of higher-order processes into a first-order setting, so as to transfer the theory of the first-order paradigm to the higher-order one. While satisfactory in the case of calculi with basic (higher-order) primitives, this indirect approach falls short in the case of higher-order process calculi featuring constructs for phenomena such as, e.g., localities and dynamic system reconfiguration, which are frequent in modern distributed systems. Indeed, for higher-order process calculi involving little more than traditional process communication, encodings into some first-order language are difficult to handle or do not exist. We then observe that foundational studies for higher-order process calculi must be carried out directly on them and exploit their peculiarities. This dissertation contributes to such foundational studies for higher-order process calculi. We concentrate on two closely interwoven issues in process calculi: expressiveness and decidability. Surprisingly, these issues have been little explored in the higher-order setting. Our research is centered around a core calculus for higher-order concurrency in which only the operators strictly necessary to obtain higher-order communication are retained. We develop the basic theory of this core calculus and rely on it to study the expressive power of issues universally accepted as basic in process calculi, namely synchrony, forwarding, and polyadic communication.

The Devil’s Calculus: Mathematical Models of Civil War

In spite of the movement to turn political science into a real science, various mathematical methods that are now the staples of physics, biology, and even economics are thoroughly uncommon in political science, especially the study of civil war. This study seeks to apply such methods - specifically, ordinary differential equations (ODEs) - to model civil war based on what one might dub the capabilities school of thought, which roughly states that civil wars end only when one side’s ability to make war falls far enough to make peace truly attractive. I construct several different ODE-based models and then test them all to see which best predicts the instantaneous capabilities of both sides of the Sri Lankan civil war in the period from 1990 to 1994 given parameters and initial conditions. The model that the tests declare most accurate gives very accurate predictions of state military capabilities and reasonable short term predictions of cumulative deaths. Analysis of the model reveals the scale of the importance of rebel finances to the sustainability of insurgency, most notably that the number of troops required to put down the Tamil Tigers is reduced by nearly a full order of magnitude when Tiger foreign funding is stopped. The study thus demonstrates that accurate foresight may come of relatively simple dynamical models, and implies the great potential of advanced and currently unconventional non-statistical mathematical methods in political science.

Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order

We derive by program transformation Pierre Crégut s full-reducing Krivine machine KN from the structural operational semantics of the normal order reduction strategy in a closure-converted pure lambda calculus. We thus establish the correspondence between the strategy and the machine, and showcase our technique for deriving full-reducing abstract machines. Actually, the machine we obtain is a slightly optimised version that can work with open terms and may be used in implementations of proof assistants.

Estimating and forecasting generalized fractional Long memory stochastic volatility models

In recent years fractionally differenced processes have received a great deal of attention due to its flexibility in financial applications with long memory. This paper considers a class of models generated by Gegenbauer polynomials, incorporating the long memory in stochastic volatility (SV) components in order to develop the General Long Memory SV (GLMSV) model. We examine the statistical properties of the new model, suggest using the spectral likelihood estimation for long memory processes, and investigate the finite sample properties via Monte Carlo experiments. We apply the model to three exchange rate return series. Overall, the results of the out-of-sample forecasts show the adequacy of the new GLMSV model.

Local probe of fractional edge states of S=1 Heisenberg spin chains

Spin chains are among the simplest physical systems in which electron-electron interactions induce novel states of matter. Here we propose to combine atomic scale engineering and spectroscopic capabilities of state of the art scanning tunnel microscopy to probe the fractionalized edge states of individual atomic scale S=1 spin chains. These edge states arise from the topological order of the ground state in the Haldane phase. We also show that the Haldane gap and the spin-spin correlation length can be measured with the same technique.

Axiomatisation of an Interval Calculus for Theorem Proving

We provide an axiomatisation of the Timed Interval Calculus, a set-theoretic notation for expressing properties of time intervals. We implement the axiomatisation in the Ergo theorem prover in order to allow the machine-checked proof of laws for reasoning about predicates expressed using interval operators. These laws can be then used in the machine-assisted verification of real-time applications.

Refinement of higher-order logic programs

A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we extend the refinement calculus for logic programs to include higher-order programming capabilities in specifications and programs, such as procedures as terms and lambda abstraction. We use a higher-order type and term system to describe programs, and provide a semantics for the higher-order language and refinement. The calculus is illustrated by refinement examples.

Vector Combinatorial Problems in a Space of Combinations with Linear Fractional Functions of Criteria

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

An Algorithm for Fresnel Diffraction Computing Based on Fractional Fourier Transform

The fractional Fourier transform (FrFT) is used for the solution of the diffraction integral in optics. A scanning approach is proposed for finding the optimal FrFT order. In this way, the process of diffraction computing is speeded up. The basic algorithm and the intermediate results at each stage are demonstrated.

Powers and Logarithms

There are applied power mappings in algebras with logarithms induced by a given linear operator D in order to study particular properties of powers of logarithms. Main results of this paper will be concerned with the case when an algebra under consideration is commutative and has a unit and the operator D satisfies the Leibniz condition, i.e. D(xy) = xDy + yDx for x, y ∈ dom D. Note that in the Number Theory there are well-known several formulae expressed by means of some combinations of powers of logarithmic and antilogarithmic mappings or powers of logarithms and antilogarithms (cf. for instance, the survey of Schinzel S[1].

An Expansion Formula for Fractional Derivatives and its Application

An expansion formula for fractional derivatives given as in form of a series involving function and moments of its k-th derivative is derived. The convergence of the series is proved and an estimate of the reminder is given. The form of the fractional derivative given here is especially suitable in deriving restrictions, in a form of internal variable theory, following from the second law of thermodynamics, when applied to linear viscoelasticity of fractional derivative type.

Weighted Theorems on Fractional Integrals in the Generalized Hölder Spaces via Indices mω and Mω

Mathematics Subject Classification: 26A16, 26A33, 46E15.

Linear Fractional PDE, Uniqueness of Global Solutions

Mathematics Subject Classification: 26A33, 47A60, 30C15.

On Multi-Dimensional Random Walk Models Approximating Symmetric Space-Fractional Diffusion Processes

Mathematics Subject Classification: 26A33, 47B06, 47G30, 60G50, 60G52, 60G60.

Fractional Derivatives and Fractional Powers as Tools in Understanding Wentzell Boundary Value Problems for Pseudo-Differential Operators Generating Markov Processes

Mathematics Subject Classification: 26A33, 31C25, 35S99, 47D07.