The geometry of synchronization
From MaRDI portal
Abstract: We graft synchronization onto Girard's Geometry of Interaction in its most concrete form, namely token machines. This is realized by introducing proof-nets for SMLL, an extension of multiplicative linear logic with a specific construct modeling synchronization points, and of a multi-token abstract machine model for it. Interestingly, the correctness criterion ensures the absence of deadlocks along reduction and in the underlying machine, this way linking logical and operational properties.
Recommendations
- The geometry of chaos synchronization
- On the geometry of master–slave synchronization
- Geometric unfolding of synchronization dynamics on networks
- Geometry, Topology and Simplicial Synchronization
- A geometric theory of chaotic phase synchronization
- SYNCHRONIZATION IN RANDOM GEOMETRIC GRAPHS
- Geometrical properties of coupled oscillators at synchronization
- The geometry of synchronization problems and learning group actions
- Complete synchronizability of chaotic systems: A geometric approach
- Synchronization in Temporal Simplicial Complexes
Cited in
(11)- The geometry of synchronization problems and learning group actions
- SYNCHRONIZATION IN RANDOM GEOMETRIC GRAPHS
- Semantics of higher-order quantum computation via geometry of interaction
- Parallelism and synchronization in an infinitary context
- Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
- The size of the sync basin revisited
- Geometry, Topology and Simplicial Synchronization
- A Fresh Look at the λ-Calculus
- The geometry of concurrent interaction: handling multiple ports by way of multiple tokens
- A geometric theory of chaotic phase synchronization
- Geometrical properties of coupled oscillators at synchronization
This page was built for publication: The geometry of synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635620)