Related papers: Modelling Mutual Exclusion in a Process Algebra wi…

We propose a continuous time model for financial markets with proportional transactions costs and a continuum of risky assets. This is motivated by bond markets in which the continuum of assets corresponds to the continuum of possible…

The tradeoff between accuracy and speed is considered fundamental to individual and collective decision-making. In this paper, we focus on collective estimation as an example of collective decision-making. The task is to estimate the…

In many learning tasks, certain requirements on the processing of individual data samples should arguably be formalized as strict constraints in the underlying optimization problem, rather than by means of arbitrary penalties. We show that,…

Liveness properties, such as termination, of even the simplest shared-memory concurrent programs under sequential consistency typically require some fairness assumptions about the scheduler. Under weak memory models, we observe that the…

In this paper we prove that all the existing conditional event algebras embed into a three-valued extension of temporal logic of discrete past time, which the authors of this paper have proposed in anothe paper as a general model of…

In concurrent systems, some form of synchronisation is typically needed to achieve data-race freedom, which is important for correctness and safety. In actor-based systems, messages are exchanged concurrently but executed sequentially by…

We study the parameter estimation problem in mixture models with observational nonidentifiability: the full model (also containing hidden variables) is identifiable, but the marginal (observed) model is not. Hence global maxima of the…

We study three classes of continuous time Markov processes (inclusion process, exclusion process, independent walkers) and a family of interacting diffusions (Brownian energy process). For each model we define a boundary driven process…

Real-time systems increasingly use multicore processors in order to satisfy thermal, power, and computational requirements. To exploit the architectural parallelism offered by the multicore processors, parallel task models, scheduling…

This paper presents a new model for characterising temporal dependence in exceedances above a threshold. The model is based on the class of trawl processes, which are stationary, infinitely divisible stochastic processes. The model for…

Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these…

A model-free measure of coupling between dynamical variables is built from time series embedding principle. The approach described does not require a mathematical form for the dynamics to be assumed. The approach also does not require…

We present principles of algebraic diversity (AD), a group-theoretic approach to signal processing exploiting signal symmetry to extract more information per observation, complementing classical methods that use temporal and spatial…

Asynchronous programming has appeared as a programming style that overcomes undesired properties of concurrent programming. Typically in asynchronous models of programming, methods are posted into a post list for latter execution. The order…

Mutual exclusion (ME) is one of the most commonly used techniques to handle conflicts in concurrent systems. Traditionally, mutual exclusion algorithms have been designed under the assumption that a process does not fail while…

Parallel tempering, also known as replica exchange sampling, is an important method for simulating complex systems. In this algorithm simulations are conducted in parallel at a series of temperatures, and the key feature of the algorithm is…

The behaviour of extended particles with exclusion interaction on a one-dimensional lattice is investigated. The basic model is called $\ell$-ASEP as a generalization of the asymmetric exclusion process (ASEP) to particles of arbitrary…

The paper gives a detailed presentation of a framework, embedded into the simply typed higher-order logic and aimed at the support of sound and structured reasoning about various properties of models of imperative programs with interleaved…

The correctness of most randomized distributed algorithms is expressed by a statement of the form ``some predicate of the executions holds with high probability, regardless of the order in which actions are scheduled''. In this paper, we…

Algorithms for mutual exclusion aim to isolate potentially concurrent accesses to the same shared resources. Motivated by distributed computing research on programmable matter and population protocols where interactions among entities are…