Results 1  10
of
29
Closed symmetric monoidal structure and flow
, 2003
"... The category of flows is not cartesian closed. We construct a closed symmetric monoidal structure which has moreover a satisfactory behavior from the computer scientific ..."
Abstract
 Add to MetaCart
The category of flows is not cartesian closed. We construct a closed symmetric monoidal structure which has moreover a satisfactory behavior from the computer scientific
Flows on Regular Semigroups
"... We study the structure of the flow monoid of a regular semigroup. This arises from the approach of Nambooripad of considering a regular semigroup as a groupoid  a category in which every morphism is invertible. A flow is then a section to the source map in this groupoid, and the monoid structure o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the structure of the flow monoid of a regular semigroup. This arises from the approach of Nambooripad of considering a regular semigroup as a groupoid  a category in which every morphism is invertible. A flow is then a section to the source map in this groupoid, and the monoid structure
Nets Enriched over Closed Monoidal Structures
"... Abstract. We show how the firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. On that basis we introduce closed monoidal structures which are residuated monoids. We identify a class of closed monoidal structures (associated with a family of idem ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of idempotent group dioids) for which one can mimic the token game of Petri nets to define the behaviour of these generalized Petri nets whose flow relations and place contents are valued in the closed monoidal structure. 1
Abstract Networks, Markov Lie Monoids, and Generalized Entropy
, 2005
"... The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n1) dimensional ‘Markov type ’ Lie group that is defined by preserving the sum of the components of a vector, and (2) the n dimensional Abelian Lie group, A(n), of scaling transformations of the coor ..."
Abstract
 Add to MetaCart
correspondence to one element of the Markov monoid of the same dimensionality. It follows that any network matrix, C, is the generator of a continuous Markov transformation that can be interpreted as producing an irreversible flow among the nodes of the corresponding network. Generalized entropy can be defined
RealValued Functions On Flows
, 1996
"... We develop the flow analog of the classical Yosida adjunction between spaces and archimedean latticeordered groups with strong unit. A product of this development is the flow counterpart of the classical compactification of a space. We characterize those flows which are compactifiable, i.e., dense ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
subflows of a compact flow. Finally, we exhibit a duality between the compactifications of a given flow and the topologies on the monoid of actions.
On cofree Sspaces and cofree Sflows
"... Khosravi Let STych be the category of Tychonoff Sspaces for a topological monoid S. We study the cofree Sspaces and cofree Sflows over topological spaces and we prove that for any topological space X and a topological monoid S, the function space C(S,X) with the compactopen topology and the ac ..."
Abstract
 Add to MetaCart
Khosravi Let STych be the category of Tychonoff Sspaces for a topological monoid S. We study the cofree Sspaces and cofree Sflows over topological spaces and we prove that for any topological space X and a topological monoid S, the function space C(S,X) with the compactopen topology
Geometry of Interaction and Linear Combinatory Algebras
, 2000
"... this paper was quite di#erent, stemming from the axiomatics of categories of tangles (although the authors were aware of possible connections to iteration theories. In fact, similar axiomatics in the symmetric case, motivated by flowcharts and "flownomials" had been developed some years ea ..."
Abstract

Cited by 61 (10 self)
 Add to MetaCart
earlier by Stefanescu (Stefanescu 2000).) However, the first author realized, following a stimulating discussion with Gordon Plotkin, that traced monoidal categories provided a common denominator for the axiomatics of both the Girardstyle and AbramskyJagadeesanstyle versions of the Geometry
Preautomata as Mathematical Models of Event Flows Recognisers
"... Abstract. The new class of recognisers is introduced and studied in the paper. The models are based on the notion of partial action of a free finite generated monoid. Authors called such models by preautomata. Some properties of preautomata were established and proved in the paper. These properties ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The new class of recognisers is introduced and studied in the paper. The models are based on the notion of partial action of a free finite generated monoid. Authors called such models by preautomata. Some properties of preautomata were established and proved in the paper. These properties
A Theory for Optical flowbased Transport on Image Manifolds
"... An image articulation manifold (IAM) is the collection of images formed when an object is articulated in front of a camera. IAMs arise in a variety of image processing and computer vision applications, where they provide a natural lowdimensional embedding of the collection of highdimensional images ..."
Abstract
 Add to MetaCart
fields, parallel transport, as well as a intuitive notion of curvature. The space of optical flow fields along a path of constant curvature has a natural multiscale structure via a monoid structure on the space of all flow fields along a path. We also develop lower bounds on approximation errors while
Turing Automata and Graph Machines
 DCM 2010
, 2010
"... Indexed monoidal algebras are introduced as an equivalent structure for selfdual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the co ..."
Abstract
 Add to MetaCart
that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann dataflow computer architecture, Turing graph machines are proposed as potentially reversible lowlevel universal computational devices, and a truly reversible molecular size hardware model is presented
Results 1  10
of
29