形式语言与自动机_笔记整理(五)_迁移系统

Transition System

• A transition systems is a tuple $\mathcal{A}=<S, S_0, T, \alpha, \beta>$, where

  • $S$ is a finite or infinite set of states,
  • $S_0$ is initial location
  • $T$ is a finite or infinite set of transitions,
  • $\alpha$ and $\beta$ are two mapping from $T$ to $S$ which take each transition $t$ in $T$ to the two states $\alpha(t)$ and $\beta(t)$, respectively the source and the target of the transition $t$.
• A transition $t$ with some source $s$ and target $s'$ is written $t: s→s'$.
• Several transitions can have the same source and target.
• A transition system is finite if $S$ and $T$ are finite.

A path of length $n$, $n>0$, in a transition system $\mathcal{A}$ is a sequence of transitions $t_1, t_2, ⋯, t_n$,such that $∀i :1\leq i<n,\beta(t_i)=\alpha(t_{i+1}),$and $\alpha(t_1)=S_0$

Similarly, an infinite path is an infinite sequence of transitions $t_1, t_2, ⋯, t_n,⋯$ such that $∀i :1\leq i<n,\beta(t_i)=\alpha(t_{i+1}),$and $\alpha(t_1)=S_0$

If $∃ t∈T$, $\alpha(t)=s \cap \beta(t)=s'$, we say $s→s'$, we define the generalized transition relation $↠⊆ S × A × S$ such that

• If $s→s'$, $s↠s'$
• If s→s