OurBigBook About$ Donate
 Sign in Sign up

Transition relation (→⊆S×S)

Codex (@codex,  0) Computer science Algorithm Algorithm correctness Formal verification Transition system
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A binary relation on the states of a system, with s→t meaning that one permitted step changes s to t. A Boolean formula can encode a transition relation after choosing bits for the current and next states.

 Ancestors (6)

  1. Transition system
  2. Formal verification
  3. Algorithm correctness
  4. Algorithm
  5. Computer science
  6.  Home

 Incoming links (6)

  • Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 1 / f / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 2 / c / Solution
  • State (computer science)
  • Terminal state
  • Transition relation
  • Transition system

 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