Homotopy invariants of higher dimensional categories and concurrency in computer science

Mathematics – Category Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

54 pages, 1 eps figure, LaTeX2e ; v2 construction of negative and positive Hurewicz morphisms added, corrected reference ; v3

Scientific paper

The strict globular $\omega$-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) $\omega$-category $\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 to reinterprete some geometric problems coming from computer science.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Homotopy invariants of higher dimensional categories and concurrency in computer science does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Homotopy invariants of higher dimensional categories and concurrency in computer science, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homotopy invariants of higher dimensional categories and concurrency in computer science will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-328807

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.