LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
sav08:review_of_fixpoints_in_semantics [2008/04/30 10:54]
vkuncak
sav08:review_of_fixpoints_in_semantics [2008/04/30 11:05]
vkuncak
Line 72: Line 72:
 The set of reachable states is defined as the least solution of constraints:​ The set of reachable states is defined as the least solution of constraints:​
 \[ \[
-\begin{array}{l} +  ​I \subseteq C(p_0) 
-  ​I \subseteq C(p_0) \\+\
 +\[
   \bigwedge_{(p_1,​p_2) \in E} sp(C(p),​r(c(p_1,​p_2)))) \subseteq C(p_2)   \bigwedge_{(p_1,​p_2) \in E} sp(C(p),​r(c(p_1,​p_2)))) \subseteq C(p_2)
-\end{array} 
 \] \]
-where $c(p_1,​p_2)$ is command associated with edge $(p_1,​p_2)$,​ $r(c(p_1,​p_2))$ is relation for this command.+where $c(p_1,​p_2)$ is command associated with edge $(p_1,​p_2)$, ​and $r(c(p_1,​p_2))$ is the relation ​giving semantics ​for this command.