Related papers: Modelling Mutual Exclusion in a Process Algebra wi…
We formulate a modular approach to the design and analysis of a particular class of mutual exclusion algorithms for shared memory multiprocessor systems. Specifically, we consider algorithms that organize waiting processes into a queue.…
This paper considers differential problems with random switching, with specific applications to the motion of cells and centrally coordinated motion. Starting with a differential-equation model of cell motion that was proposed previously,…
In the present work, a new time-dependent exchange theory is presented wherein the symmetry constraints, on a multi-electron wavefunction, are properly accounted for. In so doing, the equations of motion, incorporating the required…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
Empirical process theory for i.i.d. observations has emerged as a ubiquitous tool for understanding the generalization properties of various statistical problems. However, in many applications where the data exhibit temporal dependencies…
In a model free discrete time financial market, we prove the superhedging duality theorem, where trading is allowed with dynamic and semi-static strategies. We also show that the initial cost of the cheapest portfolio that dominates a…
This paper presents an algebraic theory of instruction sequences with instructions for a random access machine (RAM) as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction…
We present a new data-driven model of fairness that, unlike existing static definitions of individual or group fairness is guided by the unfairness complaints received by the system. Our model supports multiple fairness criteria and takes…
We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix a minimal session calculus and systematically take into account all known…
Designing networks capable of attaining better performance with an increased inference budget is important to facilitate generalization to harder problem instances. Recent efforts have shown promising results in this direction by making use…
Temporal point processes are the dominant paradigm for modeling sequences of events happening at irregular intervals. The standard way of learning in such models is by estimating the conditional intensity function. However, parameterizing…
We consider the simple exclusion process in the integer segment $ [1, N]$ with $k\le N/2$ particles and spatially inhomogenous jumping rates. A particle at site $x\in [ 1, N]$ jumps to site $x-1$ (if $x\ge 2$) at rate $1-\omega_x$ and to…
Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…
We propose a multivariate framework for modeling dependent default times that extends the classical Cox process by incorporating both common and idiosyncratic shocks. Our construction uses c\`adl\`ag, increasing processes to model…
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits…
The exclusion of freeriders from common privileges or public acceptance is widely found in the real world. Current models on the evolution of cooperation with incentives mostly assume peer sanctioning, whereby a punisher imposes penalties…
One limitation of the most statistical/machine learning-based variable selection approaches is their inability to control the false selections. A recently introduced framework, model-x knockoffs, provides that to a wide range of models but…
An important property of concurrent objects is whether they support progress -a special case of liveness-guarantees, which ensure the termination of individual method calls under system fairness assumptions. Liveness properties have been…
In this paper we present and analyse a simple two populations model with migrations among two different environments. The populations interact by competing for resources. Equilibria are investigated. A proof for the boundedness of the…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and…