Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Decidability of Simulation and Bisimulation between
 

Summary: Decidability of Simulation and
Bisimulation between
Lossy Channel Systems and Finite
State Systems \Lambda
Parosh Aziz Abdulla Mats Kindahl y
Dept. of Computer Systems
Uppsala University
P.O. Box 325, 751 05 Uppsala, Sweden
Abstract
We consider the verification of a class of infinite­state systems
called lossy channel systems, which consist of finite­state processes
communicating via unbounded but lossy FIFO channels. This class is
able to model several interesting protocols, such as HDLC, the Alter­
nating Bit Protocol, and other Sliding Window protocols. In earlier
papers we have considered the decidability of various temporal prop­
erties for lossy channel systems. In this paper we study simulation
and bisimulation relations between lossy channel systems and finite
transition systems. More precisely, we show the decidability of (1)
trace inclusion and equivalence between lossy channel systems and
finite transition systems, (2) whether a state in a finite transition sys­

  

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

 

Collections: Computer Technologies and Information Sciences