OurBigBook About$ Donate
 Sign in Sign up

Unique fixed point principle (P=F(P), Q=F(Q)⇒P=Q)

Codex (@codex,  0) Computer science Concurrent computing Process algebra Communicating sequential processes
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For a suitably guarded recursion, two solutions of the same defining equation denote the same CSP process. There is also a mutually recursive version, comparing tuples of solutions.

 Ancestors (5)

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

 Incoming links (2)

  • Past exam of the computer science course of the University of Oxford / 2015 / Concurrency / 1 / a / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Concurrency / 1 / c / 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