Verifikation reaktiver Systeme - Universität Kaiserslautern
Verifikation reaktiver Systeme - Universität Kaiserslautern
Verifikation reaktiver Systeme - Universität Kaiserslautern
Erfolgreiche ePaper selbst erstellen
Machen Sie aus Ihren PDF Publikationen ein blätterbares Flipbook mit unserer einzigartigen Google optimierten e-Paper Software.
1<br />
_<br />
_<br />
_<br />
1)<br />
(<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1)<br />
(<br />
1)<br />
(<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
2<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
s<br />
s<br />
multiple<br />
error<br />
error<br />
multiple<br />
s<br />
multiple<br />
error<br />
error<br />
it<br />
correct<br />
multiple<br />
error<br />
error<br />
it<br />
correct<br />
multiple<br />
error<br />
error<br />
it<br />
correct<br />
multiple<br />
error<br />
error<br />
p<br />
(8)<br />
s ist in jedem Zeitschritt t+1 1-covered von P2<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
1<br />
_<br />
_<br />
_<br />
_<br />
_<br />
_<br />
1<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
3<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
s<br />
error<br />
state<br />
old<br />
multiple<br />
multiple<br />
s<br />
error<br />
state<br />
old<br />
multiple<br />
multiple<br />
s<br />
it<br />
reject<br />
it<br />
correct<br />
it<br />
reject<br />
it<br />
correct<br />
p<br />
(9)<br />
s ist in jedem Zeitschritt 0-covered von P3<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
1<br />
_<br />
_<br />
_<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
1<br />
1)<br />
(<br />
1)<br />
(<br />
)<br />
(<br />
4<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
t<br />
s<br />
error<br />
multiple<br />
error<br />
error<br />
error<br />
error<br />
multiple<br />
multiple<br />
error<br />
error<br />
error<br />
oldstate<br />
multiple<br />
multiple<br />
error<br />
error<br />
it<br />
reject<br />
multiple<br />
error<br />
error<br />
it<br />
reject<br />
multiple<br />
error<br />
error<br />
it<br />
reject<br />
multiple<br />
error<br />
error<br />
p<br />
(10)<br />
s ist not-covered von P4<br />
59
Change language