Concurrency semantics
Appearance
From Wikipedia, the free encyclopedia
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)
Find sources: "Concurrency semantics" – news · newspapers · books · scholar · JSTOR (July 2025)
| Semantics | ||||||||
|---|---|---|---|---|---|---|---|---|
|
||||||||
|
Semantics of programming languages | ||||||||
|
||||||||
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
[edit ]- ^ 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.
Stub icon
This computer science article is a stub. You can help Wikipedia by expanding it.