CSP (Communicating Sequential Processes)
E96229
algebra of communicating processes
formal model of concurrency
mathematical model of computation
process calculus
CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
Observed surface forms (2)
| Surface form | As subject | As object |
|---|---|---|
| CSP process algebra | 0 | 1 |
| Communicating Sequential Processes | 0 | 1 |
Statements (53)
| Predicate | Object |
|---|---|
| instanceOf |
algebra of communicating processes
→
formal model of concurrency → mathematical model of computation → process calculus → |
| abbreviation | CSP NERFINISHED → |
| assumes |
independent processes
→
interaction solely via communication events → |
| basedOn |
message-passing communication
→
sequential processes → |
| communicationMedium | channels → |
| communicationStyle | synchronous message passing → |
| creator | C. A. R. Hoare NERFINISHED → |
| describedIn |
Communicating Sequential Processes (1978 paper)
NERFINISHED
→
Communicating Sequential Processes (1985 book) NERFINISHED → |
| field |
concurrency theory
→
theoretical computer science → |
| fullName | Communicating Sequential Processes NERFINISHED → |
| hasKeyConcept |
channel
→
choice operator → deadlock → divergences → event → failures → hiding operator → nondeterminism → parallel composition → process → refinement → renaming operator → sequential composition → synchronization → traces → |
| hasSemanticModel |
failures semantics
→
failures-divergences semantics → trace semantics → |
| hasToolSupport |
FDR model checker
NERFINISHED
→
ProBE animator NERFINISHED → |
| influenced |
Clojure core.async
NERFINISHED
→
Go concurrency model NERFINISHED → Limbo programming language NERFINISHED → Rust async channels design → occam programming language NERFINISHED → |
| models |
concurrent systems
→
distributed systems → |
| publicationYear | 1978 → |
| relatedTo |
Actor model
→
Calculus of Communicating Systems NERFINISHED → Pi-calculus NERFINISHED → |
| usedFor |
reasoning about deadlock
→
reasoning about livelock → refinement checking → specification of concurrent systems → verification of concurrent systems → |
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
CSP process algebra
this entity surface form:
Communicating Sequential Processes