Mathematical Structures in Computer Science bridges the gap between theoretical computer science and software design. By publishing original perspectives from all areas of computing, the journal stresses applications from logic, algebra, geometry, category theory and other areas of logic and mathematics. Through issues such as this special issue, the journal also plans to play an occasional, but important role in the fields of intelligent computation and automation.

Under a variety of names, and in a more or less explicit form, the concept that we now call ‘probability’ must have taken shape in the mind of human beings since the dawn of thought, as a nuance added to the idea of chance (randomness) or unpredictability, though chance may not be exactly the right word. Some time later, the concepts of what we now describe as ‘statistics’ and ‘statistically stable’, moved away from the idea of ‘chance’ and came closer to something else, which was called ‘probability’ and has been fuzzily conceived as being, in some sense, abstract and ‘ideal’. Throughout history it has been felt that unpredictability can have degrees, and that it can be measured using probabilities.

This special issue of Mathematical Structures in Computer Science is dedicated to structure transformation and contains contributions to two main research areas: extending the constructions that have been developed over nearly forty years for graph transformations to more general structures; and employing these transformations to model the operational and abstract semantics of distributed and mobile systems.

We develop an operational domain theory for treating recursive types with respect to contextual equivalence. The principal approach we take deviates from classical domain theory in that we do not produce the recursive types using the usual inverse limits constructions – we get them for free by working directly with the operational semantics. By extending type expressions to functors between some ‘syntactic’ categories, we establish algebraic compactness. To do this, we rely on an operational version of the minimal invariance property, for which we give a purely operational proof.

We generalise the standard construction of realizability models (specifically, of categories of assemblies) to a wide class of computability structures, which is broad enough to embrace models of computation such as labelled transition systems and process algebras. We consider a general notion of simulation between such computability structures, and show how these simulations correspond precisely to certain functors between the realizability models. Furthermore, we show that our class of computability structures has good closure properties – in particular, it is ‘cartesian closed’ in a slightly relaxed sense. Finally, we investigate some important subclasses of computability structures and of simulations between them. We suggest that our 2-category of computability structures and simulations may offer a useful framework for investigating questions of computational power, abstraction and simulability for a wide range of models.

We introduce a realizability semantics based on interactive learning for full second-order Heyting arithmetic with excluded middle and Skolem axioms over Σ10-formulas. Realizers are written in a classical version of Girard's System $\mathsf{F}$ and can be viewed as programs that learn by interacting with the environment. We show that the realizers of any Π20-formula represent terminating learning processes whose outcomes are numerical witnesses for the existential quantifier of the formula.

In this paper we study approach structures on dcpo's. A dcpo (X, ≤) will be endowed with several other structures: the Scott topology; an approach structure generated by a collection of weightable quasi metrics on X; and a collection of weights corresponding to the quasi metrics. Understanding the interaction between these structures on X will eventually lead to some fixed-point theorems for the morphisms in the category of approach spaces, which are called contractions. Existing fixed-point theorems on both monotone and non-monotone maps are obtained as special cases.

We generalise both the notion of a non-sequential process and the unfolding construction (which was previously developed for concrete formalisms such as Petri nets and graph grammars) to the abstract setting of (single pushout) rewriting of objects in adhesive categories. The main results show that processes are in one-to-one correspondence with switch-equivalent classes of derivations, and that the unfolding construction can be characterised as a coreflection, that is, the unfolding functor arises as the right adjoint to the embedding of the category of occurrence grammars into the category of grammars.

As the unfolding represents potentially infinite computations, we need to work in adhesive categories with ‘well-behaved’ colimits of ω-chains of monos. Compared with previous work on the unfolding of Petri nets and graph grammars, our results apply to a wider class of systems, which is due to the use of a refined notion of grammar morphism.

Raussen (2010) gave the trace space, which corresponds to the executions of parallel non-looped, non-branching processes as a prod-simplicial complex derived from a poset. The connected components represent equivalent executions. For looped processes, the state space is a torus and the trace space is a disjoint union of trace spaces of deloopings. In the current paper, we develop the index poset for the trace space of the deloopings from the once delooped case. When just one process is looped, the index poset is generated as words in a regular language. We also construct a corresponding automaton.

In this paper, I discuss the extent to which Kolmogorov drew upon von Mises' work in addressing the problem of why probability is applicable to events in the real world, which I refer to as the problem of the applicability of probability, or the applicability problem for short. In particular, I highlight the role of randomness in Kolmogorov's account, and I argue that this role differs significantly from the role that randomness plays in von Mises' account.

Previous work has demonstrated that categories are useful and expressive models for databases. In the current paper we build on that model, showing that certain queries and constraints correspond to lifting problems, as found in modern approaches to algebraic topology. In our formulation, each SPARQL graph pattern query corresponds to a category-theoretic lifting problem, whereby the set of solutions to the query is precisely the set of lifts. We interpret constraints within the same formalism, and then investigate some basic properties of queries and constraints. In particular, to any database π, we can associate a certain derived database Qry(π) of queries on π. As an application, we explain how giving users access to certain parts of Qry(π), rather than direct access to π, improves the ability to manage the impact of schema evolution.

The flow shop scheduling problem based on ideal and precise conditions has been a focus of considerable research since the first easy scheduling problem was formulated. In reality, some uncertain factors always restrict the scheduling optimisation problem. In this paper, taking uncertain processing time as an example, we use generalised rough sets theory to transform the rough flow shop scheduling model into the precise scheduling model. We adopt a cooperative co-evolutionary particle swarm optimisation algorithm based on a niche sharing scheme (NCPSO) to minimise the makespan in comparison with the particle swarm optimiser (PSO) and co-evolution particle swarm optimiser (CPSO) algorithms. The new algorithm is characterised by a strengthening of the ability to reserve excellent particles and searching the optimal solution. Experimental results show that the new algorithm is more effective and efficient than the others.

Finitary $\mathcal{M}$-adhesive categories are $\mathcal{M}$-adhesive categories with finite objects only, where $\mathcal{M}$-adhesive categories are a slight generalisation of weak adhesive high-level replacement (HLR) categories. We say an object is finite if it has a finite number of $\mathcal{M}$-subobjects. In this paper, we show that in finitary $\mathcal{M}$-adhesive categories we not only have all the well-known HLR properties of weak adhesive HLR categories, which are already valid for $\mathcal{M}$-adhesive categories, but also all the additional HLR requirements needed to prove classical results including the Local Church-Rosser, Parallelism, Concurrency, Embedding, Extension and Local Confluence Theorems, where the last of these is based on critical pairs. More precisely, we are able to show that finitary $\mathcal{M}$-adhesive categories have a unique $\mathcal{E}$-$\mathcal{M}$ factorisation and initial pushouts, and the existence of an $\mathcal{M}$-initial object implies we also have finite coproducts and a unique $\mathcal{E}$′-$\mathcal{M}$ pair factorisation. Moreover, we can show that the finitary restriction of each $\mathcal{M}$-adhesive category is a finitary $\mathcal{M}$-adhesive category, and finitarity is preserved under functor and comma category constructions based on $\mathcal{M}$-adhesive categories. This means that all the classical results are also valid for corresponding finitary $\mathcal{M}$-adhesive transformation systems including several kinds of finitary graph and Petri net transformation systems. Finally, we discuss how some of the results can be extended to non-$\mathcal{M}$-adhesive categories.

We define a number of stochastic equivalences in the dtsPBC framework, which is a discrete time stochastic extension of finite Petri box calculus (PBC) enriched with iteration. These equivalences allow the identification of stochastic processes that have similar behaviour but are differentiated by the semantics of the calculus. We explain how the equivalences we propose can be used to reduce transition systems of expressions, and demonstrate how to apply the equivalences to compare the stationary behaviour. The equivalences guarantee a coincidence of performance indices for stochastic systems, and can be used for performance analysis simplification. We use a case study to outline a method of modelling, performance evaluation and behaviour preserving reduction of concurrent computing systems, and apply it to the dining philosophers system.

In earlier work we explored the expressiveness and algebraic theory Psi-calculi, which form a parametric framework for extensions of the pi-calculus. In the current paper we consider higher-order psi-calculi through a technically surprisingly simple extension of the framework, and show how an arbitrary psi-calculus can be lifted to its higher-order counterpart in a canonical way. We illustrate this with examples and establish an algebraic theory of higher-order psi-calculi. The formal results are obtained by extending our proof repositories in Isabelle/Nominal.

Wind power projects face an uncertain external environment, they are complex projects in themselves and the capabilities of the designers, erectors and operators are limited. All this makes the identification of investment risks for wind power projects extremely complicated. In this paper, we propose a method for identifying the investment risk scientifically and accurately using a back propagation (BP) neural network. Specifically, we propose a hybrid wavelet transform fuzzy BP neural network (WT-FBPNN) optimisation model based on the construction of a risk evaluating index system. This improved model can not only exploit the time frequency localisation characteristic of wavelet transforms (WT), but also enhance the fit precision and algorithm convergence speed. The simulation results show that this model is reliable, and that this method of identifying the investment risk of wind power projects is feasible.

In this paper we propose a quantum random number generator (QRNG) that uses an entangled photon pair in a Bell singlet state and is certified explicitly by value indefiniteness. While ‘true randomness’ is a mathematical impossibility, the certification by value indefiniteness ensures that the quantum random bits are incomputable in the strongest sense. This is the first QRNG setup in which a physical principle (Kochen–Specker value indefiniteness) guarantees that no single quantum bit that is produced can be classically computed (reproduced and validated), which is the mathematical form of bitwise physical unpredictability.

We discuss the effects of various experimental imperfections in detail: in particular, those related to detector efficiencies, context alignment and temporal correlations between bits. The analysis is very relevant for the construction of any QRNG based on beam-splitters. By measuring the two entangled photons in maximally misaligned contexts and using the fact that two bitstrings, rather than just one, are obtained, more efficient and robust unbiasing techniques can be applied. We propose a robust and efficient procedure based on XORing the bitstrings together – essentially using one as a one-time-pad for the other – to extract random bits in the presence of experimental imperfections, as well as a more efficient modification of the von Neumann procedure for the same task. We also discuss some open problems.

For any partial combinatory algebra (PCA for short) $\mathcal{A}$, the class of $\mathcal{A}$-representable partial functions from $\mathbb{N}$ to $\mathcal{A}$ quotiented by the filter of cofinite sets of $\mathbb{N}$ is a PCA such that the representable partial functions are exactly the limiting partial functions of $\mathcal{A}$-representable partial functions (Akama 2004). The n-times iteration of this construction results in a PCA that represents any n-iterated limiting partial recursive function, and the inductive limit of the PCAs over all n is a PCA that represents any arithmetical partial function. Kleene's realizability interpretation over the former PCA interprets the logical principles of double negation elimination for Σ0n-formulae, and over the latter PCA, it interprets Peano's arithmetic (PA for short). A hierarchy of logical systems between Heyting's arithmetic (HA for short) and PA is used to discuss the prenex normal form theorem, relativised independence-of-premise schemes, and the statement ‘PA is an unbounded extension of HA’.

In this paper we introduce Event Identifier Logic (EIL), which extends Hennessy–Milner logic by the addition of:

1. (1) reverse as well as forward modalities; and

2. (2) identifiers to keep track of events.

In this paper we focus on the synthesis of labelled transition systems (LTSs) for process calculi using Mobile Ambients (MAs) as a testbed. Our proposal is based on a graphical encoding: a process is mapped into a graph equipped with interfaces such that the denotation is fully abstract with respect to the standard structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (BCs), which is an instance of relative pushouts (RPOs). The BC mechanism allows the effective construction of an LTS that has graphs with interfaces as states and labels, and such that the associated bisimilarity is a congruence. We focus here on the analysis of an LTS over processes as graphs with interfaces: we use the LTS on graphs to recover an LTS directly defined over the structure of MA processes and define a set of SOS inference rules capturing the same operational semantics.