Related papers: Branching Bisimilarity for Processes with Time-out…
The purpose of this study is to investigate two related spatial branching models with the unbounded branching intensity. The objective is to describe the asymptotic behaviour of the extremal particle.
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Rates of binomial processes are modeled using beta-binomial distributions (for example, from Beta Regression). We treat the offline optimization scenario and then the online one, where we optimize the exploration-exploitation problem. The…
The application considered is mixed-criticality scheduling. The core formal approaches used are Rely-Guarantee conditions and the Timeband framework; these are applied to give a layered description of job scheduling which includes…
Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour executable if, and only if, it is behaviourally equivalent to the behaviour of a reactive Turing…
Complex networks are an important paradigm of modern complex systems sciences which allows quantitatively assessing the structural properties of systems composed of different interacting entities. During the last years, intensive efforts…
We study a continuous time Mutually Catalytic Branching model on the $\mathbb{Z}^{d}$. The model describes the behavior of two different populations of particles, performing random walk on the lattice in the presence of branching, that is,…
A systematic theory for the diffusion--limited reaction processes $A + A \to 0$ and $A \to (m+1) A$ is developed. Fluctuations are taken into account via the field--theoretic dynamical renormalization group. For $m$ even the mean field rate…
We characterise all the quasi-stationary distributions and the Q-process associated with a continuous state branching process that explodes in finite time. We also provide a rescaling for the continuous state branching process conditioned…
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…
Linear fractional Galton-Watson branching processes in i.i.d.~random environment are, on the quenched level, intimately connected to random difference equations by the evolution of the random parameters of their linear fractional marginals.…
In this note, we recall the definition of the binary branching model with Moran type interactions (BBMMI) introduced in [8]. In this interacting particle system, particles evolve, reproduce and die independently and, with a probability that…
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such…
Timed automata are a widely used formalism for specifying the discrete-state/continuous-time behavior of time-critical reactive systems. For the fundamental verification problem of comparing two timed automata, it has been shown that timed…
Whereas standard treatments of temporal logic are adequate for closed systems, having no run-time interactions with their environment, they fall short for reactive systems, interacting with their environments through synchronisation of…
When two Markov operators commute, it suggests that we can couple two copies of one of the corresponding processes. We explicitly construct a number of couplings of this type for a commuting family of Markov processes on the set of…
This paper shows that, even at the most basic level, the parallel, countable branching and uncountable branching recurrences of Computability Logic (see http://www.cis.upenn.edu/~giorgi/cl.html) validate different principles.
We generalize the notion of the submartingale property and Doob's inequality. Furthermore, we show how the latter leads to new inequalities for several stochastic processes: certain time series, Levy processes, random walks, processes with…
Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number…
The $\pi$-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable behavioural equivalences in cases when more disciplined…