Transition System

A transition system is a pair (Γ, ⇒) where Γ is a set of elements γ, called states or configurations, and ⇒ ⊆ Γ × Γ is a binary relation, called the transition relation.

We say that γ' is a successor of γ if γ⇒γ'.

Example

The following diagramme shows a transition system with Γ={q₀, q₁, q₂, q₃}, and ⇒ = {(q₀, q₁), (q₁, q₂), (q₂, q₃), (q₃, q₀)}.

References

R. Burstall. Language Semantics and Implementation. Course Notes. 1994.