join-calculus
E807610
Join-calculus is a process calculus designed for specifying and reasoning about concurrent and distributed systems, emphasizing message-based synchronization and mobility.
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
formal language
ⓘ
process calculus ⓘ |
| designedFor |
reasoning about concurrent systems
ⓘ
reasoning about distributed systems ⓘ specifying concurrent systems ⓘ specifying distributed systems ⓘ |
| emphasizes |
message-based synchronization
ⓘ
mobility ⓘ |
| field |
concurrency theory
ⓘ
distributed computing ⓘ theoretical computer science ⓘ |
| focusesOn |
asynchronous concurrency
ⓘ
distribution transparency ⓘ explicit locality ⓘ |
| goal |
provide a calculus with explicit distribution primitives
ⓘ
simplify reasoning about distributed implementations ⓘ |
| hasAbstractionLevel | high-level model of distributed computation ⓘ |
| hasConcept |
channels
ⓘ
definitions ⓘ messages ⓘ processes ⓘ reactions ⓘ |
| hasFeature |
first-class channels
ⓘ
join patterns ⓘ lexically scoped names ⓘ localized definitions of channels ⓘ pattern-based synchronization ⓘ |
| inspiredBy | π-calculus NERFINISHED ⓘ |
| property |
compositional semantics
ⓘ
expressiveness comparable to π-calculus ⓘ formal operational semantics ⓘ |
| relatedTo |
CCS
NERFINISHED
ⓘ
CSP NERFINISHED ⓘ π-calculus ⓘ |
| semanticsBasedOn |
reduction rules
ⓘ
structural congruence ⓘ |
| supports |
asynchronous message passing
ⓘ
channel mobility ⓘ name passing ⓘ synchronous message passing ⓘ |
| synchronizationMechanism |
multi-way join of messages
ⓘ
pattern matching on message presence ⓘ |
| usedIn |
design of concurrent programming languages
ⓘ
design of distributed programming languages ⓘ formal modeling of distributed algorithms ⓘ formal verification of concurrent protocols ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.