English
Related papers

Related papers: The parallel composition of processes

200 papers

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by…

Formal Languages and Automata Theory · Computer Science 2010-06-09 Miklós Bartha

We review definitions of generalized parallel transports in terms of Cheeger-Simons differential characters. Integration formulae are given in terms of Deligne-Beilinson cohomology classes. These representations of parallel transport can be…

High Energy Physics - Theory · Physics 2009-11-10 M. Bauer , G. Girardi , R. Stora , F. Thuillier

A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…

Computational Complexity · Computer Science 2011-11-09 Johannes Koebler , Oleg Verbitsky

We use the framework of "props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric monoidal category where the objects are natural numbers, with the tensor product of objects given by addition.…

Category Theory · Mathematics 2018-05-23 Brandon Coya

We define a construction on operads which yields a new description of the minimal model. The construction also allows us to define algebraic structures on the homology of chain complexes with homologously trivial operad algebra structures,…

Algebraic Topology · Mathematics 2015-08-17 Cole Hugelmeyer

The non-commutative algebraic analog of the moduli of vector and covector fields is built. The structure of moduli of derivations of non-commutative algebras are studied. The canonical coupling is introduced and the conditions for…

q-alg · Mathematics 2008-02-03 G. N. Parfionov , R. R. Zapatrin

In this paper, we theoretically and experimentally analyze sequential processors with limited communication between parts. We compare the expressivity of sequential quantum and classical processors under the same constraints. They consist…

Boolean circuits abstract away from physical details to focus on the logical structure and computational behaviour of digital components. Although such circuits have been studied for many decades, compositionality has been widely ignored or…

Logic in Computer Science · Computer Science 2026-03-24 Damian Arellanes

The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…

Quantum Algebra · Mathematics 2007-10-18 Frédéric Chapoton , Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

A method of reducing general quaternion functions of first degree, i.e., linear quaternion functions, to quaternary canonical form is given. Linear quaternion functions, once reduced to canonical form, can be maintained in this form under…

Rings and Algebras · Mathematics 2007-05-23 Todd A. Ell

A recent study of bugs in real-world concurrent and distributed systems found that, while implementations of individual protocols tend to be robust, the composition of multiple protocols and its interplay with internal computation is the…

Programming Languages · Computer Science 2017-08-09 Luís Cruz-Filipe , Fabrizio Montesi

Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies.…

Logic in Computer Science · Computer Science 2017-01-11 Johannes Borgström , Ramūnas Gutkovas , Joachim Parrow , Björn Victor , Johannes Åman Pohjola

The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of this comonad are the topic of study in this paper (following earlier…

Logic in Computer Science · Computer Science 2015-07-01 Bart Jacobs

We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…

Category Theory · Mathematics 2015-11-30 Volodymyr Lyubashenko

This paper is a fundamental study of comodules and contramodules over a comonoid in a symmetric closed monoidal category. We study both algebraic and homotopical aspects of them. Algebraically, we enrich the comodule and contramodule…

Category Theory · Mathematics 2023-03-21 Katerina Hristova , John Jones , Dmitriy Rumynin

If $\mathbf{C}$ is a category with pullbacks then there is a bicategory with the same objects as $\mathbf{C}$, spans as morphisms, and maps of spans as 2-morphisms, as shown by Benabou. Fong has developed a theory of "decorated" cospans,…

Category Theory · Mathematics 2017-09-20 Kenny Courser

Compositional minimisation can be an effective technique to reduce the state space explosion problem. This technique considers a parallel composition of several processes. In its simplest form, each sequential process is replaced by an…

Logic in Computer Science · Computer Science 2020-12-14 Maurice Laveaux , Tim A. C. Willemse

This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…

Formal Languages and Automata Theory · Computer Science 2013-05-30 Shigeki Akiyama , Victor Marsault , Jacques Sakarovitch

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Logic · Mathematics 2022-06-15 Célia Borlido , Brett McLean

This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in…

Logic in Computer Science · Computer Science 2014-07-15 Timothy Bourke , Robert J. van Glabbeek , Peter Höfner
‹ Prev 1 8 9 10 Next ›