Related papers: Concrete Branching Bisimilarity for Processes with…
In this manuscript, we are interested in the long-term behaviour of branching processes with pairwise interactions (BPI-processes). A process in this class behaves as a pure branching process with the difference that competition and…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
We propose a new definition of metastability of Markov processes on countable state spaces. We obtain sufficient conditions for a sequence of processes to be metastable. In the reversible case these conditions are expressed in terms of the…
We present a comprehensive study of the behavioral theory of an untyped $\lambda$-calculus extended with the delimited-control operators shift and reset. To that end, we define a contextual equivalence for this calculus, that we then aim to…
Many dynamical phenomena display a cyclic behavior, in the sense that time can be partitioned into units within which distributional aspects of a process are homogeneous. In this paper, we introduce a class of models - called conjugate…
Pushdown Systems (PDSs) are a natural model for sequential programs with (recursive) procedure calls. In this work, we define the Branching temporal logic of CAlls and RETurns (BCARET) that allows to write branching temporal formulas while…
In this paper I distinguish two (pre)congruence requirements for semantic equivalences and preorders on processes given as closed terms in a system description language with a recursion construct. A lean congruence preserves equivalence…
Power law distributions have been repeatedly observed in a wide variety of socioeconomic, biological and technological areas. In many of the observations, e.g., city populations and sizes of living organisms, the objects of interest evolve…
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…
This paper is a note on the use of Bayesian nonparametric mixture models for continuous time series. We identify a key requirement for such models, and then establish that there is a single type of model which meets this requirement. As it…
Branching bisimilarity on normed Basic Process Algebra (BPA) was claimed to be EXPTIME-hard in previous papers without any explicit proof. Recently it is reminded by Jan\v{c}ar that the claim is not so dependable. In this paper, we develop…
We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed…
We consider a generalization of spatial branching coalescing processes in which the behaviour of individuals is not (necessarily) independent, on the contrary, individuals tend to take simultaneous actions. We show that these processes have…
We put forward an exponential-time algorithm for deciding branching bisimilarity on normed BPA (Bacis Process Algebra) systems. The decidability of branching (or weak) bisimilarity on normed BPA was once a long standing open problem which…
Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude…
This paper introduce the notion of output contraction that expands the contraction notion to the time-varying nonlinear systems with output. It pertains to the systems' property that any pair of outputs from the system converge to each…
Synchronisation and pattern formation have been intensely addressed for systems evolving on static networks. Extending the study to include the inherent ability of the network to adjust over time proved cumbersome and led to conclusions…
(Multi-type) branching processes are a natural and well-studied model for generating random infinite trees. Branching processes feature both nondeterministic and probabilistic branching, generalizing both transition systems and Markov…
Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is equivalent to the behaviour of a (finite) reactive Turing…
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…