Undecidable Verification Problems for Programs with Unreliable Channels

We consider the class of finite-state systems communicating through unbounded butlossyFIFO channels (calledlossy channel systems). These systems have infinite state spaces due to the unboundedness of the channels. In an earlier paper, we showed that the problems of checking reachability, safety properties, and eventuality properties are decidable for lossy channel systems. In this paper, we show that the following problems are undecidable:?The model checking problem in propositional temporal logics such as propositional linear time temporal logic (PTL) and computation tree logic (CTL).?The problem of deciding eventuality properties with fair channels: do all computations eventually reach a given set of states if the unreliable channels satisfy fairness assumptions ?The results are obtained through reduction from a variant of the Post correspondence problem.

[1]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[2]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[3]  Hsu-Chun Yen,et al.  Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata , 1986, Theor. Comput. Sci..

[4]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[5]  A. Prasad Sistla,et al.  Automatic Temporal Verification of Buffer Systems , 1991, CAV.

[6]  Wang Yi,et al.  Time Abstracted Bisimiulation: Implicit Specifications and Decidability , 1993, MFPS.

[7]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[8]  Faron Moller,et al.  Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

[9]  Pierre Wolper,et al.  Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.

[10]  Orna Grumberg,et al.  Network Grammars, Communication Behaviors and Automatic Verification , 1989, Automatic Verification Methods for Finite State Systems.

[11]  Wang Yi,et al.  CCS + Time = An Interleaving Model for Real Time Systems , 1991, ICALP.

[12]  Parosh Aziz Abdulla,et al.  Undecidable Verification Problems for Programs with Unreliable Channels , 1994, Inf. Comput..

[13]  S. Purushothaman Iyer,et al.  Data flow analysis of communicating finite state machines , 1991, TOPL.

[14]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for Context-Free Processes , 2005 .

[15]  Jan K. Pachl,et al.  Protocol Description and Analysis Based on a State Transition Model with Channel Expressions , 1987, PSTV.

[16]  Bengt Jonsson,et al.  Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs , 1989, Inf. Comput..

[17]  Edmund M. Clarke,et al.  Avoiding the state explosion problem in temporal logic model checking , 1987, PODC '87.

[18]  Mohamed G. Gouda,et al.  On deadlock detection in systems of communicating finite state machines , 1987 .

[19]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[20]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[21]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[22]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[23]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[24]  Petr Jancar,et al.  Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..

[25]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[26]  Bruno Courcelle,et al.  On Constructing Obstruction Sets of Words , 1991, Bull. EATCS.

[27]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[28]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[29]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.