Abstract
Message-based systems usually consist of distributed components that communicate using asynchronous message passing. In such systems, particular message orderings may violate some required properties. Given an automata-based specification of unwanted message sequences, we propose a decentralized deadlock-free runtime enforcement algorithm to prevent the formation of such sequences. In our approach, components are equipped with monitors executed concurrently. A component is only blocked before sending or receiving the last message of a sequence, until its associated monitor checks that such a message does not complete an unwanted sequence. According to the specification of unwanted sequences, some blocked components may suffer from a deadlock. Our deadlock-free algorithm guarantees that monitors detect and resolve such deadlocks by improving the existing deadlock detection algorithms. We evaluate the efficiency and scalability of our approach in terms of the communication overhead, the prevention latency, and the overhead of deadlock detection through simulation.
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.
