Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)

DOI10.1007/978-3-662-48653-5_28zbMath1394.68225OpenAlexW2339401772MaRDI QIDQ1664155

Sergio Rajsbaum, Michel Raynal, Armando Castañeda

Publication date: 24 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_28

zbMATH Keywords

linearizabilitytaskconcurrent objectsequential specification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Geometric and combinatorial views on asynchronous computability ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Life beyond set agreement ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relaxed data types as consistency conditions ⋮ t-Resilient Immediate Snapshot Is Impossible

This page was built for publication: Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)