Related papers: Unique Parallel Decomposition for the Pi-calculus
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of…
Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical…
In present paper we propose seemingly new method for finding solutions of some types of nonlinear PDEs in closed form. The method is based on decomposition of nonlinear operators on sequence of operators of lower orders. It is shown that…
We propose an automated method for proving termination of $\pi$-calculus processes, based on a reduction to termination of sequential programs: we translate a $\pi$-calculus process to a sequential program, so that the termination of the…
This paper deals mainly with some aspects of the adjointable operators on Hilbert $C^*$-modules. A new tool called the generalized polar decomposition for each adjointable operator is introduced and clarified. As an application, the general…
We prove boundedness and regularity estimates for weak solutions to a class of linear nonlocal equations involving integro-differential operators with almost no order of differentiability. In particular, we show that bounded weak solutions…
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…
This paper presents a new, significantly simpler proof of one of the main results of applied pi-calculus: the theorem that the concepts of observational and labeled equivalence of extended processes in applied pi-calculus coincide.
Let $F$ be an algebraically closed field and consider the Lie algebra ${\mathfrak g}=\langle x\rangle\ltimes {\mathfrak a}$, where $\mathrm{ad}\, x$ acts diagonalizably on the abelian Lie algebra ${\mathfrak a}$. Refer to a ${\mathfrak…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…
For insight into the parallel composition for true concurrency, we recall the axiomatization of the parallel composition modulo truly concurrent behavioral equivalences as the sidelights of truly concurrent process algebra APTC. We prove…
We suggest that the canonical parallel operation of processes is composition in a well-supported compact closed category of spans of reflexive graphs. We present the parallel operations of classical process algebras as derived operations…
We propose a method for the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics. The purpose is to reduce the satisfaction problem of a formula for a process to…
On compact Riemannian manifolds, we prove a decomposition theorem for arbitrarily bounded energy sequence of solutions of a singular elliptic equation.
The classes of depth-bounded and name-bounded processes are fragments of the pi-calculus for which some of the decision problems that are undecidable for the full calculus become decidable. P is depth-bounded at level k if every reduction…
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…
This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs. Multiple equivalent definitions are procured, along with a modal characterisation and a proof of its congruence property for a standard process…
This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss…
Introducing parallelism and exploring its use is still a fundamental challenge for the computer algebra community. In high performance numerical simulation, on the other hand, transparent environments for distributed computing which follow…