Abstract
AbstractUsually, communication protocols are modelled as a communication between two finite‐state machines. Yu and Gouda [1] have shown that if the messages of a single type and the finite‐state machine have no mixed nodes, the verification of deadlock can be made in a polynomial time. This paper shows that if the messages are of a single type, the verification of deadlock can be made in a polynomial time, even if there does exist mixed nodes. The proof is derived by indicating that the communication sequences arriving at deadlock states form a context‐free language. If there does not exist a deadlock in the protocol obtained by converting all the messages into a single type, no deadlock exists in the original protocol (the converse is not always true). In this sense, the result in this paper is important.
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.
