How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Who is Descendant of Whom?<br />
► Sometimes we need <<strong>st</strong>rong>to</<strong>st</strong>rong> know transitive edges, I.e., edges after<br />
edges of the same color<br />
► Que<strong>st</strong>ion: what is reachable from a no<strong>de</strong>?<br />
■ Which <strong>de</strong>scendants has Adam?<br />
► Answer: Transitive closure calculates reachability over no<strong>de</strong>s<br />
■ It contracts a graph, inserting masses of edges <<strong>st</strong>rong>to</<strong>st</strong>rong> all reachable no<strong>de</strong>s<br />
■ It contracts all paths <<strong>st</strong>rong>to</<strong>st</strong>rong> single edges<br />
■ It makes reachability <strong>inf</strong>ormation explicit<br />
► After transitive closure, it can easily be <strong>de</strong>ci<strong>de</strong>d whether a no<strong>de</strong> is<br />
reachable or not<br />
► Basic premise: base relation is not changed (offline problem)<br />
Prof. Uwe Aßmann, Softwaretechnologie II<br />
61