Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Walters, R. F. C."'
Autor:
Sabadini, N., Walters, R. F. C.
In the paper Blocked-braid Groups, submitted to Applied Categorical Structures, the present authors together with Davide Maglia introduced the blocked-braid groups BB_n on n strands, and proved that a blocked torsion has order either 2 or 4. We conje
Externí odkaz:
http://arxiv.org/abs/1307.5404
We introduce and study a family of groups $\mathbf{BB}_n$, called the blocked-braid groups, which are quotients of Artin's braid groups $\mathbf{B}_n$, and have the corresponding symmetric groups $\Sigma_n$ as quotients. They are defined by adding a
Externí odkaz:
http://arxiv.org/abs/1307.5383
The theme of the paper is the use of commutative Frobenius algebras in braided strict monoidal categories in the study of varieties of circuits and communicating systems which occur in Computer Science, including circuits in which the wires are tangl
Externí odkaz:
http://arxiv.org/abs/1110.0715
In an earlier paper we introduced a notion of Markov automaton, together with parallel operations which permit the compositional description of Markov processes. We illustrated by showing how to describe a system of n dining philosophers, and we obse
Externí odkaz:
http://arxiv.org/abs/1005.0949
Publikováno v:
Theory and Applications of Categories, Vol. 24, No. 1, 2010, pp. 1{24
Bicategories of spans are characterized as cartesian bicategories in which every comonad has an Eilenberg-Moore ob ject and every left adjoint arrow is comonadic.
Externí odkaz:
http://arxiv.org/abs/0910.2996
We develop further the algebra of cospans and spans of graphs introduced by Katis, Sabadini and Walters for the sequential and parallel composition of processes, adding here data types.
Externí odkaz:
http://arxiv.org/abs/0909.4136
In this note we define a process algebra TCP (Truly Concurrent Processes) which corresponds closely with the automata model of concurrency based on Span(RGraph), the category of spans of reflexive graphs. In TCP, each process has a fixed set of inter
Externí odkaz:
http://arxiv.org/abs/0904.3964
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 arising from
Externí odkaz:
http://arxiv.org/abs/0904.3961
We describe an algebra for composing automata which includes both classical and quantum entities and their communications. We illustrate by describing in detail a quantum protocol.
Externí odkaz:
http://arxiv.org/abs/0901.4754
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in a model of the classical Dining Philosopher problem, and show, using t
Externí odkaz:
http://arxiv.org/abs/0901.2434