Results 1  10
of
78
Modeling Concurrency with Geometry
, 1991
"... The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in tutorial detail. So why should these phenomena prefer ..."
Abstract

Cited by 125 (13 self)
 Add to MetaCart
The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in tutorial detail. So why should these phenomena prefer one home over the other? We identify dimension as the culprit: 1dimensional automata are skeletons permitting only interleaving concurrency, whereas true nfold concurrency resides in transitions of dimension n. The truly concurrent automaton dual to a schedule is not a skeletal distributive lattice but a solid one. We introduce true nondeterminism and define it as monoidal homotopy; from this perspective nondeterminism in ordinary automata arises from forking and joining creating nontrivial homotopy. The automaton dual to a poset schedule is simply connected whereas that dual to an event structure schedule need not be, according to monoidal homotopy though not to group homotopy. We conclude...
Higher dimensional algebra III: ncategories and the algebra of opetopes
, 1997
"... We give a definition of weak ncategories based on the theory of operads. We work with operads having an arbitrary set S of types, or ‘Soperads’, and given such an operad O, we denote its set of operations by elt(O). Then for any Soperad O there is an elt(O)operad O + whose algebras are Soperads ..."
Abstract

Cited by 74 (6 self)
 Add to MetaCart
We give a definition of weak ncategories based on the theory of operads. We work with operads having an arbitrary set S of types, or ‘Soperads’, and given such an operad O, we denote its set of operations by elt(O). Then for any Soperad O there is an elt(O)operad O + whose algebras are Soperads over O. Letting I be the initial operad with a oneelement set of types, and defining I 0+ = I, I (i+1)+ = (I i+) +, we call the operations of I (n−1)+ the ‘ndimensional opetopes’. Opetopes form a category, and presheaves on this category are called ‘opetopic sets’. A weak ncategory is defined as an opetopic set with certain properties, in a manner reminiscent of Street’s simplicial approach to weak ωcategories. In a similar manner, starting from an arbitrary operad O instead of I, we define ‘ncoherent Oalgebras’, which are n times categorified analogs of algebras of O. Examples include ‘monoidal ncategories’, ‘stable ncategories’, ‘virtual nfunctors ’ and ‘representable nprestacks’. We also describe how ncoherent Oalgebra objects may be defined in any (n + 1)coherent Oalgebra.
Homotopy Invariants of Higher Dimensional Categories and Concurrency in Computer Science
, 1999
"... The strict globular omegacategories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) omegacategory C three homology theories. The first one is called the globular homology. It contains the oriented loops of C. The two other one ..."
Abstract

Cited by 49 (10 self)
 Add to MetaCart
The strict globular omegacategories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) omegacategory C three homology theories. The first one is called the globular homology. It contains the oriented loops of C. The two other ones are called the negative (resp. positive) corner homology. They contain in a certain manner the branching areas of execution paths or negative corners (resp. the merging areas of execution paths or positive corners) of C. Two natural linear maps called the negative (resp. the positive) Hurewicz morphism from the globular homology to the negative (resp. positive) corner homology are constructed. We explain the reason why these constructions allow the reinterpretation of some geometric problems coming from computer science.
SOME GEOMETRIC PERSPECTIVES IN CONCURRENCY THEORY
 HOMOLOGY, HOMOTOPY AND APPLICATIONS, VOL.5(2), 2003, PP.95–136
, 2003
"... Concurrency, i.e., the domain in computer science which deals with parallel (asynchronous) computations, has very strong links with algebraic topology; this is what we are developing in this paper, giving a survey of “geometric” models for concurrency. We show that the properties we want to prove on ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
Concurrency, i.e., the domain in computer science which deals with parallel (asynchronous) computations, has very strong links with algebraic topology; this is what we are developing in this paper, giving a survey of “geometric” models for concurrency. We show that the properties we want to prove on concurrent systems are stable under some form of deformation, which is almost homotopy. In fact, as the “direction ” of time matters, we have to allow deformation only as long as we do not reverse the direction of time. This calls for a new homotopy theory: “directed ” or dihomotopy. We develop some of the geometric intuition behind this theory and give some hints about the algebraic objects one can associate with it (in particular homology groups). For some historic as well as for some deeper reasons, the theory is at a stage where there is a nice blend between cubical, ωcategorical and topological techniques.
A model category for the homotopy theory of concurrency
 Homology, Homotopy and Applications
"... Abstract. We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are Shomotopy equivalent. This result provides an interpretation of the notion ..."
Abstract

Cited by 38 (13 self)
 Add to MetaCart
Abstract. We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are Shomotopy equivalent. This result provides an interpretation of the notion of Shomotopy equivalence in the framework of model
Higherdimensional word problems with applications to equational logic
 Theoretical Computer Science
, 1993
"... logic ..."
Combinatorics Of Branchings In Higher Dimensional Automata
 Theory Appl. Categ
, 2001
"... We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular #category and the combinatorics of a new homology theory ca ..."
Abstract

Cited by 35 (9 self)
 Add to MetaCart
We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular #category and the combinatorics of a new homology theory called the reduced branching homology. The latter is the homology of the quotient of the branching complex by the subcomplex generated by its thin elements. Conjecturally it coincides with the non reduced theory for higher dimensional automata, that is #categories freely generated by precubical sets. As application, we calculate the branching homology of some #categories and we give some invariance results for the reduced branching homology. We only treat the branching side. The merging side, that is the case of merging areas of execution paths is similar and can be easily deduced from the branching side.
From Concurrency to Algebraic Topology
, 2000
"... This paper is a survey of the new notions and results scattered in [13], [11] and [12]. Starting from a formalization of higher dimensional automata (HDA) by strict globular !categories, the construction of a diagram of simplicial sets over the threeobject small category gl ! + is exposed. Some of ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
This paper is a survey of the new notions and results scattered in [13], [11] and [12]. Starting from a formalization of higher dimensional automata (HDA) by strict globular !categories, the construction of a diagram of simplicial sets over the threeobject small category gl ! + is exposed. Some of the properties discovered so far on the corresponding simplicial homology theories are explained, in particular their links with geometric problems coming from concurrency theory in computer science.
About the Globular Homology of Higher Dimensional Automata
, 2000
"... We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of [Gau99] disappear. Moreover the important morphisms which associate to every globe its co ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of [Gau99] disappear. Moreover the important morphisms which associate to every globe its corresponding branching area and merging area of execution paths become morphisms of simplicial sets.
Combinatorics of nonabelian gerbes with connection and curvature
, 203
"... Abstract: We give a functorial definition of Ggerbes over a simplicial complex when the local symmetry group G is nonAbelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a fibered category equipped with a functorial connectio ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
Abstract: We give a functorial definition of Ggerbes over a simplicial complex when the local symmetry group G is nonAbelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a fibered category equipped with a functorial connection over the space of edgepaths. By computing the curvature of the latter on the faces of an infinitesimal 4simplex, we recover the cocycle identities satisfied by the curvature of this gerbe. The link with BFtheories suggests that gerbes provide a framework adapted to the geometric formulation of strongly coupled gauge theories.