English
Related papers

Related papers: Unique Parallel Decomposition for the Pi-calculus

200 papers

We show that the irreducible components of any moduli space of semistable representations of a special biserial algebra are always isomorphic to products of projective spaces of various dimensions. This is done by showing that irreducible…

Representation Theory · Mathematics 2020-03-03 Andrew T. Carroll , Calin Chindris , Ryan Kinser , Jerzy Weyman

We introduce the notion of being cohomologically complete for objects of the derived category of sheaves of $Z[\hbar]$-modules on a topological space. Then we consider a $Z[\hbar]$-algebra satisfying some suitable conditions and prove…

Quantum Algebra · Mathematics 2010-03-22 Masaki Kashiwara , Pierre Schapira

In this paper we investigate the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo rooted branching bisimilarity, which is a classic, bisimulation-based notion of equivalence that abstracts from…

Logic in Computer Science · Computer Science 2022-06-29 Luca Aceto , Valentina Castiglioni , Anna Ingolfsdottir , Bas Luttik

In standard process algebra, parallel components do not share a common state and communicate through synchronisation. The advantage of this type of communication is that it facilitates compositional reasoning. For modelling and analysing…

Logic in Computer Science · Computer Science 2020-09-01 Mark Bouwman , Bas Luttik , Wouter Schols , Tim A. C. Willemse

Computations with integro-differential operators are often carried out in an associative algebra with unit, and they are essentially non-commutative computations. By adjoining a cocommutative co-product, one can have those operators perform…

Symbolic Computation · Computer Science 2018-06-21 Van Chiên Bui , Gérard H. E. Duchamp , Quoc Hoan Ngô , Vincel Hoang Ngoc Minh , Christophe Tollu

In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of algebra, the seed algebra, which describes exactly the behavior of a process within a…

Programming Languages · Computer Science 2010-01-08 Ruqian Lu , Lixing Li , Yun Shang , Xiaoyu Li

We study a two-component asymmetric simple exclusion process (ASEP) that is equivalent to the ASEP with second-class particles. We prove self-duality with respect to a family of duality functions which are shown to arise from the reversible…

Probability · Mathematics 2015-10-19 V. Belitsky , G. M. Schütz

We present a type system to guarantee termination of pi-calculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. We show that our…

Logic in Computer Science · Computer Science 2011-08-29 Ioana Cristescu , Daniel Hirschkoff

Many parallel algorithms use at least linear auxiliary space in the size of the input to enable computations to be done independently without conflicts. Unfortunately, this extra space can be prohibitive for memory-limited machines,…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-02 Yan Gu , Omar Obeya , Julian Shun

In this paper, we study the uniqueness of the direct decomposition of a toric manifold. We first observe that the direct decomposition of a toric manifold as \emph{algebraic varieties} is unique up to order of the factors. An algebraically…

Algebraic Topology · Mathematics 2016-01-28 Miho Hatanaka

The existence of decompositions of the nonlinear integrable systems not only permits us to establish so-called linear superposition solutions but also to derive new nonlinear integrable coupled systems. Restricting our attention to the…

Exactly Solvable and Integrable Systems · Physics 2022-05-18 Xiazhi Hao , S. Y. Lou

This paper is composed of two main results concerning chains of infinite order which are not necessarily continuous. The first one is a decomposition of the transition probability kernel as a countable mixture of unbounded probabilistic…

Probability · Mathematics 2010-06-01 Sandro Gallo , Nancy L. Garcia

We design a reversible version of truly concurrent process algebra CTC which is called RCTC. It has good properties modulo several kinds of strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent…

Logic in Computer Science · Computer Science 2018-05-10 Yong Wang

We supply basic tools for the study of the topological order of a multiplet which is an eigenspace of a finite-dimensional normal operator with continuous parameters. We allow intrinsic degeneracies within the multiplet where a well-known…

Mesoscale and Nanoscale Physics · Physics 2009-11-10 Yasuhiro Hatsugai

We present an algorithm for parallelising the TreePM code. We use both functional and domain decompositions. Functional decomposition is used to separate the computation of long range and short range forces, as well as the task of…

Astrophysics · Physics 2007-05-23 Suryadeep Ray , J. S. Bagla

Let $Y$ be a complex projective variety of dimension $n$ with isolated singularities, $\pi:X\to Y$ a resolution of singularities, $G:=\pi^{-1}\left(\rm{Sing}(Y)\right)$ the exceptional locus. From the Decomposition Theorem one knows that…

Algebraic Geometry · Mathematics 2020-01-09 Vincenzo Di Gennaro , Davide Franco

While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…

Algebraic Topology · Mathematics 2018-12-20 Mickaël Buchet , Emerson G. Escolar

We start with observing that the only connected finite dimensional algebras with finitely many isomorphism classes of indecomposable bimodules are the quotients of the path algebras of uniformly oriented $A_n$-quivers modulo the radical…

Representation Theory · Mathematics 2020-10-21 Volodymyr Mazorchuk , Xiaoting Zhang

This paper suggests a [email protected] of composable specification of concurrent programs that permits: (1) verification of program code for a given specification, and (2) composition of the specifications of the components to yield…

Programming Languages · Computer Science 2017-04-07 Jayadev Misra

We introduce a dialect of the Asynchronous pi-calculus, called AWpi, in which (1) an input name may be owned, at any time, by at most one process; (2) each name has either only the input or only the output capability. As a result, special…

Logic in Computer Science · Computer Science 2026-05-19 Ken Sakayori , Davide Sangiorgi , Simon Castellan , Pierre Clairambault