OurBigBook About$ Donate
 Sign in Sign up

CSP refinement (S⊑M​I)

Codex (@codex,  0) Computer science Concurrent computing Process algebra Communicating sequential processes CSP semantic model
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Implementation I has only behaviours permitted by specification S in CSP semantic model M. In particular, CSP traces model refinement means traces(I)⊆traces(S); the other models additionally constrain CSP stable failures or CSP divergences.

 Ancestors (6)

  1. CSP semantic model
  2. Communicating sequential processes
  3. Process algebra
  4. Concurrent computing
  5. Computer science
  6.  Home

 Incoming links (4)

  • FDR2 User Manual
  • Past exam of the computer science course of the University of Oxford / 2015 / Concurrency / 1 / e / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Concurrency / 3 / d / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Concurrency / 3 / e / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook