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.
[S|M][S|M]PP Path Problems:<br />
Variants of Transitive Closure<br />
► Single Source Single Target Path Problem, SSPP:<br />
■ Te<strong>st</strong>, whether there is a path from a source <<strong>st</strong>rong>to</<strong>st</strong>rong> a target<br />
► Single Source Multiple Target SMPP:<br />
■ Te<strong>st</strong>, whether there is a path from a source <<strong>st</strong>rong>to</<strong>st</strong>rong> several targets<br />
■ Or: find n targets, reachable from one source<br />
► Multiple Source Single Target MSPP:<br />
■ Te<strong>st</strong>, whether a path from n sources <<strong>st</strong>rong>to</<strong>st</strong>rong> one target<br />
► Multiple Source Multiple Target MMPP:<br />
■ Te<strong>st</strong>, whether a path of n sources <<strong>st</strong>rong>to</<strong>st</strong>rong> n targets exi<strong>st</strong>s<br />
► All can be computed with transitive closure:<br />
■ Compute transitive closure<br />
■ Te<strong>st</strong> sources and targets on direct neighborship<br />
Prof. Uwe Aßmann, Softwaretechnologie II<br />
65