OurBigBook About$ Donate
 Sign in Sign up

Strong bisimulation

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Directed graph Rooted directed graph Bisimulation
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A relation on states of labelled transition systems matching every transition with a transition of the same label in either direction, with successor states again related. In particular, τ transitions are matched individually, rather than silently skipped. For CSP processes this preserves CSP traces, CSP stable failures and CSP divergences.

 Ancestors (8)

  1. Bisimulation
  2. Rooted directed graph
  3. Directed graph
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

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