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.
Applications of <<strong>st</strong>rong>Graph</<strong>st</strong>rong> Reachability in<br />
Consi<strong>st</strong>ency Checking<br />
► Corollary: To solve an arbitrary rechability problem, use a nonrecursive<br />
query and the opera<<strong>st</strong>rong>to</<strong>st</strong>rong>r TransitiveClosure.<br />
► Consequence: should a graph-based specification be checked on<br />
consi<strong>st</strong>ency (by evaluation of consi<strong>st</strong>ency con<strong>st</strong>raints),<br />
■ it can be done with non-recursive Datalog query and the<br />
opera<<strong>st</strong>rong>to</<strong>st</strong>rong>r TransitiveClosure<br />
■ And solved with the complexity of a good TransitiveClosure<br />
algorithm<br />
► Precondition: the input graphs are fix, i.e., do not change (<strong>st</strong>atic<br />
problem)<br />
► Since the relation is one of the qualities of the world this is a central<br />
problem of computer science and IT<br />
■ Similar <<strong>st</strong>rong>to</<strong>st</strong>rong> searching and sorting<br />
Prof. Uwe Aßmann, Softwaretechnologie II<br />
71
Change language