What are the fundamental structures of concurrency? We still don't know!

Samson Abramsky

What are the fundamental structures of concurrency? We still don't know!

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.4973 v1 pith:L5EXFJHG submitted 2014-01-20 cs.LO

What are the fundamental structures of concurrency? We still don't know!

Samson Abramsky This is my paper

classification cs.LO

keywords fundamentalalgebrabeenconcurrencyfleetinggeometryglimpsesknow

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

Process algebra has been successful in many ways; but we don't yet see the lineaments of a fundamental theory. Some fleeting glimpses are sought from Petri Nets, physics and geometry.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Completeness for Probabilistic Boolean Tapes
cs.LO 2026-06 unverdicted novelty 7.0

Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.