Related papers: Unique Parallel Decomposition for the Pi-calculus
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
Mueller polarimetry involves a variety of instruments and technologies whose importance and scope of applications are rapidly increasing. The exploitation of these powerful resources depends strongly on the mathematical models that underlie…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
We introduce the stable module $\infty$-category for groups of type $\Phi$ as an enhancement of the stable category defined by N. Mazza and P. Symonds. For groups of type $\Phi$ which act on a tree, we show that the stable module…
Let $A$ be an associative algebra over an algebraically closed field $K$ of characteristic 0. A decomposition $A=A_1\oplus\cdots \oplus A_r$ of $A$ into a direct sum of $r$ vector subspaces is called a \textsl{regular decomposition} if, for…
We study a new class of pseudo differential operators whose symbols satisfy the differential inequality with a mixture of homogeneities. On the other hand, by taking singular integral realization, it can be equivalently defined by kernels…
In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…
We consider a parallel computational model that consists of $P$ processors, each with a fast local ephemeral memory of limited size, and sharing a large persistent memory. The model allows for each processor to fault with bounded…
Decoupling approach presents a novel solution/alternative to the highly time-consuming fluid-thermal-structural simulation procedures when thermal effects and resultant displacements on machine tools are analyzed. Using high dimensional…
Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…
Unique continuation principles are fundamental properties of elliptic partial differential equations, giving conditions that guarantee that the solution to an elliptic equation must be uniformly zero. Since finite-element discretizations…
A simple method for improving cache efficiency of serial and parallel explicit finite procedure with application to casting solidification simulation over three-dimensional complex geometries is presented. The method is based on division of…
Process algebra ACP based on the interleaving semantics can not be reversed. We design a reversible version of APTC called RAPTC. It has algebraic laws of reversible choice, sequence, parallelism, communication, silent step and abstraction,…
We propose a new Kalikow decomposition for continuous time multivariate counting processes, on potentially infinite networks. We prove the existence of such a decomposition in various cases. This decomposition allows us to derive simulation…
We show that the techniques for resource control that have been developed in the so-called "light logics" can be fruitfully applied also to process algebras. In particular, we present a restriction of Higher-Order pi-calculus inspired by…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
In this paper we study the discrete coagulation--fragmentation models with growth, decay and sedimentation. We demonstrate the existence and uniqueness of classical global solutions provided the linear processes are sufficiently strong.…
We consider decompositions of processes of the form $Y=f(t,X_t)$ where $X$ is a semimartingale. The function $f$ is not required to be differentiable, so It\^{o}'s lemma does not apply. In the case where $f(t,x)$ is independent of $t$, it…
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…