Formal Relationships Between Geometrical and Classical Models for Concurrency

Abstract : 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.
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download

https://hal.inria.fr/inria-00473765
Contributor : Samuel Mimram <>
Submitted on : Monday, June 11, 2012 - 4:33:59 PM
Last modification on : Friday, April 12, 2019 - 10:20:07 AM
Long-term archiving on : Wednesday, September 12, 2012 - 2:35:43 AM

Files

petri-adj.pdf
Files produced by the author(s)

Identifiers

Collections

CEA | DRT | LIST

Citation

Eric Goubault, Samuel Mimram. Formal Relationships Between Geometrical and Classical Models for Concurrency. Electronic Notes in Theoretical Computer Science, Elsevier, 2012, Proceedings of the workshop on Geometric and Topological Methods in Computer Science (GETCO), 283, pp.77-109. ⟨10.1016/j.entcs.2012.05.007⟩. ⟨inria-00473765v2⟩

Share

Metrics

Record views

168

Files downloads

340