Abstract
Reachability analysis and the recently proposed reverse reachability analysis are two important verification techniques for communicating finite state machines (CFSM). The issue of the relative efficiency of reachability analysis and reverse reachability analysis is still unsettled. In this paper, we first propose a new theory of reachability and reverse reachability analysis. Based on the new theory, we discuss and analyse the suitability of these two reachability analysis methods. We then present a reachability evaluator which, given any network of CFSMs, will try to estimate the sizes of the reachable and reverse reachable state spaces by taking snapshots of the reachability and reverse reachability spaces. The core of the evaluator is the notion of random state generation with seed states, which extends the idea of random state exploration proposed in [1]. Results from example applications have shown that the evaluator provides an excellent guidance in choosing the better of the two methods.
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.
