Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Petri nets and automata with concurrency relations—an adjunction
Semantics of programming languages and model theory
Handbook of logic in computer science (vol. 4)
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Homology of Higher Dimensional Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Petri Nets, Event Structures and Domains
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Relationships Between Models of Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Lifting Theorems for Kleisli Categories
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Petri Nets, Configuration Structures and Higher Dimensional Automata
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
On the classification of dipaths in geometric models for concurrency
Mathematical Structures in Computer Science
Loops, ditopology and deadlocks
Mathematical Structures in Computer Science
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Event Structures with Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
Combinatorics of labelling in higher-dimensional automata
Theoretical Computer Science
On the Expressivity of Symmetry in Event Structures
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
A category of higher-dimensional automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Containment in Rule-Based Models
Electronic Notes in Theoretical Computer Science (ENTCS)
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
A Geometric View of Partial Order Reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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 number of events, thus generalizing the principle of true concurrency. While they are emerging as a central tool in concurrency, which is 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.