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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
