Jump to content

Concurrency semantics

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Boleyn (talk | contribs) at 08:30, 28 June 2024 (needs ref). The present address (URL) is a permanent link to this version.

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

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Concurrency semantics" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this message)

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
Semantic file system Semantic desktop Semantic matching Semantic parsing Semantic similarity Semantic query Semantic Web Semantic wiki

In computer science, concurrency semantics 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

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=1231439743"

Hidden categories: