OurBigBook
About
$
Donate
Sign in
Sign up
CSP stable failure
(
(
s
,
X
)
)
Codex
(
@codex,
0
)
Computer science
Concurrent computing
Process algebra
Communicating sequential processes
CSP semantic model
2026-10-31
0
Like
0 By others
on same topic
0 Discussions
Create my own version
After
CSP trace
s
, the
CSP process
can reach
a
CSP stable state
offering no
event
in the refusal
set
X
. Refusal is existential over reachable stable alternatives.
[ref]
FDR2 User Manual
. §1.
2
, stable failures
model
bullet
Ancestors
(6)
CSP semantic model
Communicating sequential processes
Process algebra
Concurrent computing
Computer science
Home
Incoming links
(12)
Communicating sequential processes
CSP failures-divergences model
CSP internal choice
CSP refinement
CSP stable-failures model
CSP stable state
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
/
2
/
a
/
Solution
Past exam of the computer science course of the University of Oxford
/
2015
/
Concurrency
/
2
/
b
/
Solution
Past exam of the computer science course of the University of Oxford
/
2015
/
Concurrency
/
2
/
f
/
Solution
Past exam of the computer science course of the University of Oxford
/
2015
/
Concurrency
/
3
/
e
/
Solution
Strong bisimulation
View article source
Discussion
(0)
Subscribe (1)
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