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.
Dynamic <<strong>st</strong>rong>Graph</<strong>st</strong>rong> Reachability and its Applications<br />
► The Reps/Ramalinguan Checking Theorem: (1997):<br />
■ An online analysis and con<strong>st</strong>raint-checking problem is a probem<br />
that is specified by Datalog, EARS, or <strong>de</strong>finite set con<strong>st</strong>raints, in<br />
which the basic relations are changed online (dynamic graph<br />
reachability problem)<br />
■ An online analysis problem can be reduced <<strong>st</strong>rong>to</<strong>st</strong>rong> context-sensitive<br />
graph reachability resp. dynamic transitive closure<br />
■ and be computed in O(n 3 ) (cubic barrier problem)<br />
► Applies <<strong>st</strong>rong>to</<strong>st</strong>rong> many problems in mo<strong>de</strong>ling, requirement analysis,<br />
<strong>de</strong>sign consi<strong>st</strong>ency:<br />
■ If you can reduce a consi<strong>st</strong>ency or <strong>st</strong>ruc<strong>tu</strong>ring problem <<strong>st</strong>rong>to</<strong>st</strong>rong> <strong>st</strong>atic<br />
or dynamic graph reachability, you have almo<strong>st</strong> won since<br />
Datalog and transitive closure are powerful <<strong>st</strong>rong>to</<strong>st</strong>rong>ols!<br />
Prof. Uwe Aßmann, Softwaretechnologie II<br />
72
Change language