Abstract
We present detailed algorithms for finding, for a given finitestate concurrent software system, all states reachable from a given set of possible initial states. Our systems consist of processes that send and receive messages through links of bounded capacity. Input to the algorithm is a software system, described in a modeling notation that resembles a programming language. Of particular interest are the techniques for modeling the effects of concurrency and nondeterminism, for detecting infinite loops, and for selecting a set of particularly significant states to report to the user. We discuss performance of the algorithms and provide data from implementations.
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.
