Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended 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 Alternating Bit Protocol, and other Sliding Window protocols. In earlier papers we have considered the decidability of various temporal properties 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) whether a state in a finite transition system simulates a state in a lossy channel system, and conversely,(2) whether a state in a finite transition system is bisimilar to a state in a lossy channel system, and (3) whether a state in a finite transition system weakly simulates a state in a lossy channel system. Furthermore, we show the undecidability of the following problems: (1) whether a state in a lossy channel system weakly simulates a state in a finite transition system, and (2) Whether a state in a finite transition system is weakly bisimilar to a state in a lossy channel system.

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

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

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

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

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

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

[7]  Karlis Cerans,et al.  Deciding Properties of Integral Relational Automata , 1994, ICALP.

[8]  Bengt Jonsson,et al.  Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms , 1995, CAV.

[9]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.

[10]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .

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

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

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

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

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

[16]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

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

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

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

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

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

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

[23]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

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

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

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