An Algebraic Characterisation of Concurrent Composition
Samson Abramsky
TL;DR
This paper provides an algebraic framework for understanding synchronized parallel composition that supports true concurrency, building on Landin's automata theory to formalize the concept.
Contribution
It introduces a novel algebraic characterization of concurrent composition that captures true concurrency using automata theory concepts.
Findings
Algebraic framework for true concurrency
Formalization of synchronized parallel composition
Extension of Landin's automata theory
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".
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Formal Methods in Verification