Verifikation reaktiver Systeme - Universität Kaiserslautern
Verifikation reaktiver Systeme - Universität Kaiserslautern
Verifikation reaktiver Systeme - Universität Kaiserslautern
Sie wollen auch ein ePaper? Erhöhen Sie die Reichweite Ihrer Titel.
YUMPU macht aus Druck-PDFs automatisch weboptimierte ePaper, die Google liebt.
Abb. 1. Schaltung des AEC<br />
1<br />
0<br />
0<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 />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<br />
)<br />
(<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 />
<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 />
error<br />
state<br />
old<br />
multiple<br />
error<br />
state<br />
old<br />
error<br />
multiple<br />
error<br />
it<br />
reject<br />
error<br />
it<br />
correct<br />
error<br />
it<br />
reject<br />
it<br />
correct<br />
error<br />
it<br />
reject<br />
it<br />
correct<br />
error<br />
it<br />
reject<br />
it<br />
correct<br />
error<br />
p<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 />
(<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 />
(<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 />
<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 />
s<br />
s<br />
multiple<br />
error<br />
s<br />
multiple<br />
error<br />
error<br />
state<br />
old<br />
multiple<br />
error<br />
s<br />
multiple<br />
error<br />
it<br />
reject<br />
error<br />
it<br />
correct<br />
error<br />
it<br />
reject<br />
it<br />
correct<br />
error<br />
it<br />
reject<br />
it<br />
correct<br />
error<br />
it<br />
reject<br />
it<br />
correct<br />
error<br />
p<br />
NAND<br />
AND<br />
NOT<br />
NOT<br />
AND<br />
AND<br />
q(t)<br />
multiple(t)<br />
correct_it(t)<br />
error(t)<br />
s(t)<br />
old_state(t)<br />
r(t)<br />
t(t)<br />
reject_it(t)<br />
new_state(t)<br />
45
Change language