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

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^{\prime }$ is written $t:s\to s^{\prime }$.
• 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,\cdots ,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,\cdots ,t_n,\cdots$ such that $∀i :1\leq i<n,\beta(t_i)=\alpha(t_{i+1}), $and $\alpha (t_1)=S_0$

If $\exists t\in T$, $\alpha (t)=s\cap \beta (t)=s^{\prime }$, we say $s\to s^{\prime }$, we define the generalized transition relation $\twoheadrightarrow \subseteq S\times A\times S$ such that

• If $s\to s^{\prime }$, $s\twoheadrightarrow s^{\prime }$
• If $s\to s^{\prime }$, $s^{\prime }\twoheadrightarrow s^{\prime \prime }$, we say $s\twoheadrightarrow s^{\prime \prime }$

Let $\mathcal{A}=<S,S_0,T,\alpha ,\beta >$ be a TS, we say s is reachable if $s\in S$, $s_0\in S_0$, $s_0\twoheadrightarrow s$.

Let $T$ be a transition system. A state $s$ is a terminal state of $T$ if there are no state $s^{\prime }$ such that $s\to s^{\prime }$.

A state $s$ is a deadlock state of $T$ if s is reachable and terminal.

Write $T^{+}$ for the set of finite paths and $T^w$ for the set of infinite paths. The mappings $\alpha$ and $\beta$ can be extended to $T^{+}$ by defining $\alpha(t_1\dots t_n) = \alpha(t_1), \beta(t_1\dots t_n)=\beta(t_n) $

Similarly, the mapping $\alpha$ is extended to $T^w$ by defining $\alpha (t_1\dots )=\alpha (t_1)$

A partial product over $T^{+}$ is defined as
if $c=t_1\dots t_n$ is a path of length n, if $c^{\prime }=t_1^{\prime }\dots t_n^{\prime }$ is a path of length m, and if $\beta© = \alpha(c’) $
$c\cdot c^{\prime }=t_1\dots t_n{t}_1^{\prime }\dots t{\prime }_m$ is a finite path of length n+m and $\alpha (c\cdot c^{\prime })=\alpha (c)$, $\beta (c\cdot c^{\prime })=\beta (c^{\prime })$.

Empty path: for each state $s$ of S, define the empty path ${\epsilon }_s$ of length zero, and $\alpha {\epsilon }_s)=\beta ({\epsilon }_s)=s$.

A transition system labeled by an alphabet A is a 6-tuple $\mathcal{A}=<S,S_0,T,\alpha ,\beta ,\lambda >$ where
$\mathcal{A}=<S,S_0,T,\alpha ,\beta >$ is a transition system,
$\lambda$ is a mapping from T to A taking each transition $t$ to its label $\lambda (t)$.

Intuitively, the label of a transition indicates the action or event which triggers the transition.

If $c=t_1,t_2\cdots$, is a path in a labeled transition system, the sequence of actions $trace(c)$ = $\lambda (t_1),\lambda (t_2)\cdots$ is called the trace of the path.

Transition system homomorphism

Definition:
Let $\mathcal{A}=<S,S_0,T,\alpha ,\beta >$ and ${\mathcal{A}}^{\prime }=<S^{\prime },S_0^{\prime },T^{\prime },{\alpha }^{\prime },{\beta }^{\prime }>$ be two transition systems. A homomorphism h from $\mathcal{A}$ to ${\mathcal{A}}^{\prime }$ is a pair $(h_{\sigma },h_{\tau })$ of mappings
$h_{\sigma }:S\to S^{\prime }$, $h_{\tau }:T\to T^{\prime }$
which satisfies, for every transition $t$ of $T$:
${\alpha }^{\prime }(h_{\tau }(t))=(h_{\sigma }\alpha (t))$
${\beta }^{\prime }(h_{\tau }(t))=(h_{\sigma }\beta (t))$

Labeled transition system homomorphism
Let $\mathcal{A}=<S,S_0,T,\alpha ,\beta ,\lambda >$ and ${\mathcal{A}}^{\prime }=<S^{\prime },S_0^{\prime },T^{\prime },{\alpha }^{\prime },{\beta }^{\prime },{\lambda }^{\prime }>$ be two transition systems labeled by the same alphabet. A labeled transition system homomorphism from $\mathcal{A}$ to ${\mathcal{A}}^{\prime }$ is a homomorphism $h$ which also satisfies the condition ${\lambda }^{\prime }(h_{\tau }(t))=\lambda (t)$.

A homomorphism h is surjective if the two mappings $h_{\sigma }$ and $h_{\tau }$ are surjective. If $h$ is a surjective homomorphism from $\mathcal{A}$ to ${\mathcal{A}}^{\prime }$, the transition system ${\mathcal{A}}^{\prime }$ is the quotient of $\mathcal{A}$ under $h$.

A TS strong isomorphism is a TS homomorphism where $h_{\sigma }$ and $h_{\tau }$ are bijective. In this case, the inverse mappings $g=<h_{\sigma }$, $h_{\tau }>$ is itself a isomorphism.

If two TS are strong isomorphic, the only difference can be how they are named.

Isomorphic is a kind of equivalence.

If the isomorphism function is defined on $reach(T)$ = { s ∈ S ∣ s 0 ↠ s } \{s ∈ S | s_0↠s\} {s∈S∣s0​↠s} , then we call these two systems weak isomorphic with each other.

Theorem:
If two transition systems are isomorphic, then they are weakly isomorphic.
Weak isomorphism is an equivalence relation.

Let $T$ and $T^{\prime }$ be two TS, a bisimulation between $T$ and $T^{\prime }$ is a binary relation $B\subseteq S\times S^{\prime }$ such that

• $B(s_0,s_0^{\prime })$
• If $B(s_1,s_1^{\prime })$ and $s_1\to s_2$, then there is a $s_2^{\prime }\in S^{\prime }$ such that $s_1^{\prime }\to s_2^{\prime }$and $B(s_2,s_2^{\prime })$
• If $B(s_1,s_1^{\prime })$ and $s_1^{\prime }\to s_2^{\prime }$, then there is a $s_2\in S$ such that $s_1\to s_2$and $B(s_2,s_2^{\prime })$

$T$ and $T^{\prime }$ are bisimulation equivalent iff there exists a bisimulation between $T$ and $T^{\prime }$.

Strong Isomorphism: the transition systems are identical except for the names of the states.
Weak Isomorphism: the transition systems are strongly isomorphic provided that the transition systems are restricted to the reachable states.
Bisimulation Equivalence: the transition systems have the same behavior, and make choice at same time.

The free product of transition systems

The synchronous product of transition systems

When processes interact, not all possible global actions are useful, since the interaction is subject to communication and synchronization constraints.

The transition system associated with the system of processes must therefore be a subsystem of the free product of the component transition systems.

The synchronous product allows only those global transitions corresponding to action vectors included in the synchronization constraint.

Modeling sequential circuits

Model logical dynamical system

Model a Mutual Exclusion Protocol

State Space
The state space of a program can be captured by the valuations of the variables and the program counters
Each state of the program is a valuation of all the variables

CTL*

Temporal logic is a formalism for describing sequences of transitions between states in a reactive system.

Properties like eventually or never are specified using special temporal operators.

CTL* formulas

CTL* formulas describe properties of computation trees.
The computation tree shows all of the possible executions starting from the initial state.

Path quantifiers

• A ( for all computation path )
• E ( for some computation path )

Temporal operators

• X (next time) requires the property holds in the second state of the path
• F (finally) the property will hold at some state on the path
• G (globally) the property holds at every state on the path
• U (until) if there is a state on the path where the second property holds, at every preceding state, the first one holds
• R (release) the second property holds along the path up to and including the first state where the first property holds. However, the first property is not required to hold eventually

Two types of formulas in CTL*

• state formulas ( which are true in a special state )
• path formulas ( which are true along a special path )

Syntax of state formulas rules:

• if $p\in AP$, then $p$ is sf
• if $f$ and $g$ are sf, $\neg f$, $f\wedge g$, $f\vee g$ are sf
• if $f$ is a pf, then $Ef$ and $Af$ are sf

Syntax of path formulas

• if $f$ is a sf, then $f$ is also a pf
• if $f$ and $g$ are pf, $\neg f$, $f\wedge g$, $f\vee g$, X f, F f, G f, f U g and f R g are pf
• CTL* is the set of state formulas generated by the above rules

Semantics of CTL*

• if $f$ is a sf, $M,s\models f$ means that $f$ holds at state $s$ in the M
• if $g$ is a pf, $M,\pi \models g$ means that $g$ holds along path $\pi$ in the M

Two sublogics of CTL*

• Branching-time logic

  • The temporal operators quantify over the paths that are possible from a given state.
  • Temporal operators must be immediately preceded by a path quantifier.
  • if $f$ and $g$ are sf, $Xf$, $Ff$, $Gf$, $fUg$ and $fRg$ are pf
  • $A(FGp)$

• Linear temporal logic

  • operators are provided for describing events along a single computation path.
  • LTL implicitly quantifies universally over paths.
  • If $p\in AP$, then $p$ is pf, $Af$ where $f$ is a pf
  • $AG(EFp)$

Ten basic CTL operators:

• AX and EX
• AF and EF
• AG and EG
• AU and EU
• AR and ER

Express Properties

• Safety: something bad will not happen
  Usually: AG

• Liveness: something good will happen
  Usually: AF

• Fairness: something is successful/allocated infinitely often.
  Usually: AGAF

CTL and LTL have incomparable expressive power.

The choice between LTL and CTL depends on application and personal preferences.

http://www.cs.utexas.edu/users/moore/acl2/seminar/2010.05-19-krug/slides.pdf
http://www.inf.unibz.it/~artale/FM/slide4.pdf