Some theoretical aspects of verification (with a focus on bisimilarity)
Some theoretical aspects of verification (with a focus on bisimilarity)
Some theoretical aspects of verification (with a focus on bisimilarity)
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Decidability <str<strong>on</strong>g>of</str<strong>on</strong>g> Presburger arithmetic - c<strong>on</strong>t.<br />
An automat<strong>on</strong> accepting all (binary codes <str<strong>on</strong>g>of</str<strong>on</strong>g>) (k1, k2, . . . , kn)<br />
which satisfy quantifier-free φ(x1, x2, . . . , xn)<br />
k1 1 0 0 1 1<br />
k2 0 1 1 0 1<br />
. .<br />
kn 1 1 0 1 0<br />
q0<br />
By projecti<strong>on</strong>, an automat<strong>on</strong> accepting (k1, k2, . . . , kn−1)<br />
satisfying ∃xn.φ(x1, x2, . . . , xn)<br />
Formula ∀x.φ is rewritten by ¬∃x.¬φ ...<br />
Petr Jančar (TU Ostrava) <str<strong>on</strong>g>Some</str<strong>on</strong>g> <str<strong>on</strong>g>aspects</str<strong>on</strong>g> <str<strong>on</strong>g>of</str<strong>on</strong>g> <str<strong>on</strong>g>verificati<strong>on</strong></str<strong>on</strong>g><br />
Kolloquium Jena, 14 May 2007 17 /<br />
89
Change language