Abstract
This paper adopts counterexample guided abstraction refinement scheme to alleviate the state explosion problem of deadlock detection. We extend the classical labeled transition system models by qualifying transitions as certain and uncertain to make deadlock-freedom conservative, i.e. if the abstraction of a system is deadlock-free, then the system is deadlock-free. An abstraction refinement approach to deadlock detection is proposed, and the correctness of the approach is proved.
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.