CSP failures semantics augments visible traces with refusal information. In the stable failures model, a pair means that after visible trace , the process can reach a stable state with no internal transition and no offered event in . It records a possible refusal, not a requirement that every state reached after refuse .[ref]
External choice between offering and offering cannot initially refuse either offered event. Internal choice between the same branches may select the branch and refuse . Their visible trace sets can agree even though these refusals differ. Failures-divergences semantics additionally records possible infinite internal activity; it is a distinct model.

Ancestors (7)

  1. CSP choice
  2. CSP process
  3. Communicating sequential processes
  4. Process algebra
  5. Concurrent computing
  6. Computer science
  7. Home

Incoming links (2)

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