Summary: Undecidable Verification Problems
for Programs with Unreliable
Channels \Lambda
Parosh Aziz Abdulla and Bengt Jonsson
Uppsala University, Dept. of Computer Systems
P.O. Box 325, 751 05 Uppsala, Sweden
E--mail:fparosh,bengtg@docs.uu.se y
Abstract
We consider the verification of a particular class of infinite­state
systems, namely systems consisting of finite­state processes that com­
municate via unbounded lossy FIFO channels. This class is able to
model e.g. link protocols such as the Alternating Bit Protocol and
HDLC. In an earlier paper, we showed that the problems of checking
reachability, safety properties, and eventuality properties are decidable
for this class of systems. In this paper, we show that the following
problems are undecidable, namely
ffl The model checking problem in propositional temporal logics
such as Propositional Linear Time Temporal Logic (PTL) and
Computation Tree Logic (CTL).
ffl The problem of deciding eventuality properties with fair chan­

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

Collections: Computer Technologies and Information Sciences