Verification of Lossy and other faulty systems.
<P>
Speaker:A. Rabinovich
<P> 
Abstract

Finite state machines which communicate through unbounded buffers
have been popular in the modelling of communication protocols.
Many protocols are designed to operate correctly even in the
case
where the underlying communication medium is faulty, e.g
they can nondeterministically lose,  or corrupt messages.

We survey results for verification of such systems
and also consider problem of verification probabilistic faulty systems,
where lose and corruption of a message happens with some probabilities.