Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symbolic Verification of Lossy Channel Systems: Application to
 

Summary: Symbolic Verification of Lossy Channel Systems:
Application to
the Bounded Retransmission Protocol
Parosh Abdulla 1 Aurore Annichini 2 Ahmed Bouajjani 2
1 Dept. of Computer Systems, P.O. Box 325, S­75105 Uppsala, Sweden.
parosh@docs.uu.se
2 Verimag, Centre Equation, 2 av. de Vignate, 38610 Gi`eres, France.
Aurore.Annichini@imag.fr, Ahmed.Bouajjani@imag.fr
Abstract. We consider the problem of verifying automatically infinite­
state systems that are systems of finite machines that communicate by
exchanging messages through unbounded lossy fifo channels. In a previous
work [1], we proposed an algorithmic approach based on constructing a
symbolic representation of the set of reachable configurations of a system
by means of a class of regular expressions (SREs). The construction of
such a representation consists of an iterative computation with an acceler­
ation technique which enhances the chance of convergence. This technique
is based on the analysis of the effect of iterating control loops. In the work
we present here, we experiment our approach and show how it can be ef­
fectively applied. For that, we developed a tool prototype based on the
results in [1]. Using this tool, we provide an automatic verification of (the

  

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences