Jump to content

Concurrency semantics

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by JoeNMLC (talk | contribs) at 18:17, 29 July 2025 (chg unref. to one source tag; ► Wikipedia:WikiProject Unreferenced articles; you can help! ●). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Concurrency semantics" – news · newspapers · books · scholar · JSTOR (July 2025)

Subfields
Computational Lexical Lexis Lexicology Statistical Structural
Topics
Analysis Compositionality Context Prototype theory Force dynamics Semantic feature Semantic gap Theory of descriptions
Analysis
Latent Computational Machine learning
Applications
Desktop File system Matching Parsing Querying web wiki Similarity

In computer science, concurrency semantics^[1] is a way to give meaning to concurrent systems in a mathematically rigorous way. Concurrency semantics is often based on mathematical theories of concurrency such as various process calculi, the actor model, or Petri nets.

A more detailed account of concurrency semantics is given here: Concurrency (computer science).

References

^ Pichon-Pharabod, Jean; Sewell, Peter (11 January 2016). "A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions". dl.acm.org. Association for Computing Machinery. pp. 622–633. doi:10.1145/2837614.2837616. Retrieved 29 July 2025.

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Concurrency_semantics&oldid=1303216289"

Hidden categories: