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 Both sides next revision
sav08:collecting_semantics [2008/05/07 08:08]
vkuncak
sav08:collecting_semantics [2008/05/07 08:10]
vkuncak
Line 31: Line 31:
  
 Set of recursive inequations in the lattice of products of sets.  Note $e_1 \subseteq e_2$ is equivalent to $e_2 = e_1 \cup e_2$, so we have equations in lattice. Set of recursive inequations in the lattice of products of sets.  Note $e_1 \subseteq e_2$ is equivalent to $e_2 = e_1 \cup e_2$, so we have equations in lattice.
 +
 +They specify function $G$ from pairs of sets of states to pairs of sets of states which is $\cup$-morphism (and therefore monotonic).
 +
 +Least fixpoint of $G$ is $\bigcup_{i \ge 0} G^i(\emptyset)$.
  
 **Example** **Example**