Related papers: Branching Bisimilarity for Processes with Time-out…
This paper contributes to the solution of the problem of transforming a process model with an arbitrary topology into an equivalent structured process model. In particular, this paper addresses the subclass of process models that have no…
In Zanardo, 1998, the Peircean semantics for branching-time logics is enriched with a notion of indistinguishability at a moment t between histories passing through t. Trees with indistinguishability relations provide a semantics for a…
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the…
We extend truly concurrent process algebra APTC with timing related properties. Just like ACP with timing, APTC with timing also has four parts: discrete relative timing, discrete absolute timing, continuous relative timing and continuous…
We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…
In this paper, a special sequence of controlled branching processes is considered. We provide a simple set of sufficient conditions for the weak convergence of such processes to a weak solution to a kind of continuous branching processes…
An ever-increasing number of critical infrastructures rely heavily on the assumption that security protocols satisfy a wealth of requirements. Hence, the importance of certifying e.g., privacy properties using methods that are better at…
For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…
We establish limit theorems for re-scaled occupation time fluctuations of a sequence of branching particle systems in $\R^d$ with anisotropic space motion and weakly degenerate splitting ability. In the case of large dimensions, our limit…
A new method, called the method of self-similar approximants, and its recent developments are described. The method is based on the ideas of renormalization group theory and optimal control theory. It allows for the effective extrapolation…
Studying the behaviour of Markov processes at boundary points of the state space has a long history, dating back all the way to William Feller. With different motivations in mind entrance and exit questions have been explored for different…
In this paper we consider two related stochastic models. The first one is a branching system consisting of particles moving according to a Markov family in R^d and undergoing subcritical branching with a constant rate of V>0. New particles…
In this short note, we are concerned with the fairness condition "A and B hold almost equally often", which is important for specifying and verifying the correctness of non-terminating processes and protocols. We introduce the logic of…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
When integrating hard, soft and non-real-time tasks in general purpose operating systems, it is necessary to provide temporal isolation so that the timing properties of one task do not depend on the behaviour of the others. However, strict…
It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of…
This paper presents an alternative approach of analyzing possibly multitype point patterns in space and space-time that occur on network structures, and introduces several different graph-related intensity measures. The proposed formalism…
We use point processes theory to describe the asymptotic distribution of all upper order statistics for observations collected at renewal times. As a corollary, we obtain limiting theorems for corresponding extremal processes.
In this paper, we prove several new results that give new insights into bilinear systems. We discuss conditions for asymptotic stability using probabilistic arguments. Moreover, we provide a global characterization of reachability in…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…