Related papers: Concrete Branching Bisimilarity for Processes with…
A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs.…
A basic class of two-type continuous-state branching processes in varying environments are constructed by solving the backward equation determining the cumulant semigroup. The parameters of the process are allowed to be c\`adl\`ag in time…
Recently, alternating transition systems are adopted to describe control systems with disturbances and their finite abstract systems. In order to capture the equivalence relation between these systems, a notion of alternating approximate…
Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…
Branching-stable processes have recently appeared as counterparts of stable subordinators, when addition of real variables is replaced by branching mechanism for point processes. Here, we are interested in their domains of attraction and…
We introduce a bisimulation learning algorithm for non-deterministic transition systems. We generalise bisimulation learning to systems with bounded branching and extend its applicability to model checking branching-time temporal logic,…
This paper demonstrates a new regeneration processes technology making use of positive stable distributions. We study the asymptotic behavior of branching processes with a randomly controlled migration component. Using the new method, we…
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the…
In this study, replication of a period-doubling cascade in coupled systems with delay is rigorously proved under certain assumptions, which guarantee the existence of bounded solutions and replication of sensitivity. A novel definition for…
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…
We demonstrate that continuous time quantum walks on several types of branching graphs, including graphs with loops, are identical to quantum walks on simpler linear chain graphs. We also show graph types for which such equivalence does not…
We consider random processes that are history-dependent, in the sense that the distribution of the next step of the process at any time depends upon the entire past history of the process. In general, therefore, the Markov property cannot…
Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…
Motivated by applications in databases, this paper considers various fragments of the calculus of binary relations. The fragments are obtained by leaving out, or keeping in, some of the standard operators, along with some derived operators…
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive…
Consider the mutually catalytic branching process with finite branching rate $\gamma$. We show that as $\gamma\to\infty$, this process converges in finite-dimensional distributions (in time) to a certain discontinuous process. We give…
We observe the continuous-time Markov Branching Process without high-order moments and allowing Immigration. Limit properties of transition functions and their convergence to invariant measures are investigated. Main mathematical tool is…
Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…