Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Simulating Perfect Channels with Probabilistic Lossy Channels 2
 

Summary: Simulating Perfect Channels with
Probabilistic Lossy Channels 2
Parosh Abdulla a Christel Baier b S. Purushothaman Iyer c;1
Bengt Jonsson a
a Dept of Computer Systems, Uppsala University, SE-751 05 Uppsala, Sweden
b Dept of Computer Science, University of Bonn, 53117 Bonn, Germany
c Dept of Computer Science, North Carolina State University, Raleigh, NC 27695,
USA
Abstract
We consider the problem of deciding whether an in nite-state system (expressed
as a Markov chain) satis es a correctness property with probability 1. This problem
is, of course, undecidable for general in nite-state systems. We focus our attention
on the model of probabilistic lossy channel systems consisting of nite-state processes
that communicate over unbounded lossy FIFO channels. Abdulla and Jonsson have
shown that safety properties are decidable while progress properties are undecidable
for non-probabilistic lossy channel systems. Under assumptions of \suĂciently high"
probability of loss, Baier and Engelen have shown how to check whether a property
holds of probabilistic lossy channel system with probability 1.
In this paper we consider a model of probabilistic lossy channel systems, where
messages can be lost only during send transitions. In contrast to the model of Baier

  

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

 

Collections: Computer Technologies and Information Sciences