An Algebraic Characterisation of Concurrent Composition

Samson Abramsky

An Algebraic Characterisation of Concurrent Composition

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 1406.1965 v1 pith:YL43CR6V submitted 2014-06-08 cs.LO

Samson Abramsky This is my paper · ORCID

classification cs.LO

keywords algebraiccompositionallowingautomatacharacterisationcharacterizationconcurrencyconcurrent

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We give an algebraic characterization of a form of synchronized parallel composition allowing for true concurrency, using ideas based on Peter Landin's "Program-Machine Symmetric Automata Theory".

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

Topological Interpretation of Interactive Computation
cs.LO 2019-08 reject novelty 6.0 of 10

A topological Turing machine defined as a gauge group over a simplicial-complex environment is claimed to be a universal model for interactive computation, but the claim is not proven.

Pith tools