Abstract
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. Several probabilistic versions of these systems have been proposed in recent years, with the two aims of modeling more faithfully the losses of messages, and circumventing undecidabilities by some kind of randomization. We survey these proposals and the verification techniques they support.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.