Formal Relationships Between Geometrical and Classical Models for Concurrency

Details Formal Relationships Between Geometrical and Classical Models for Concurrency Formal Relationships Between Geometrical and Classical Models for Concurrency

2010-04-16

arxiv.org/abs/1004.2818v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality between events, conflicts and schedules due to resource accesses, etc. More recently, models with a geometrical flavor have been introduced, based on the notion of cubical set. These models are very rich and expressive since they can represent commutation between any bunch of events, thus generalizing the principle of true concurrency. While they seem to be very promising - because they make possible the use of techniques from algebraic topology in order to study concurrent computations - they have not yet been precisely related to the previous models, and the purpose of this paper is to fill this gap. In particular, we describe an adjunction between Petri nets and cubical sets which extends the previously known adjunction between Petri nets and asynchronous transition systems by Nielsen and Winskel.

Affiliated with

Also associated with

No associations

Rating

Formal Relationships Between Geometrical and Classical Models for Concurrency 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 Formal Relationships Between Geometrical and Classical Models for Concurrency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Relationships Between Geometrical and Classical Models for Concurrency will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623894