Related papers: Concrete Branching Bisimilarity for Processes with…
We propose a variant of the CCS process algebra with new features aiming at allowing multiscale modelling of biological systems. In the usual semantics of process algebras for modelling biological systems actions are instantaneous. When…
Earlier we presented a method to decompose modal formulas for processes with the internal action $\tau$, and congruence formats for branching and $\eta$-bisimilarity were derived on the basis of this decomposition method. The idea is that a…
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…
This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mechanisms that allow to explicitly account for the possibility…
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…
This paper concentrates on the limit behavior of discrete-time branching process with circular mechanism. Three types of limit behaviour of discrete-time branching process with circular mechanism are given explicitly under various moment…
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…
We propose a new formulation of time-dependent coupled cluster with adaptive basis functions and division of the one-particle space into active and secondary subspaces. The formalism is fully bivariational in the sense of a real-valued…
Consider the continuous-time Markov Branching Process. In critical case we consider a situation when the generating function of intensity of transformation of particles has the infinite second moment, but its tail regularly varies in sense…
An explicit solution of non-critical time-homogeneous branching processes is described.
This survey aims at collecting and presenting results for one-type, discrete time branching processes with random control functions. In particular, the subclass of critical migration processes with different regimes of immigration and…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and…
We establish a sufficient condition for the tightness of a sequence of stochastic processes. Our condition makes it possible to study processes with accumulations of fixed times of discontinuity. Our motivation comes from the study of…
In this paper, it is presented a methodology for implementing arbitrarily constructed time-homogenous Markov chains with biochemical systems. Not only discrete but also continuous-time Markov chains are allowed to be computed. By employing…
We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic…
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…
It is well-known that conditioning a supercritical (multi-type) branching process on the event that it eventually becomes extinct yields a subcritical branching process. We study the corresponding inverse problem: given a subcritical…
Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that…
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 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…