Reachability and reverse reachability analysis of CFSMs

  • Authors:
  • Wuxu Peng;Kia Makki

  • Affiliations:
  • Department of Computer Science, Southwest Texas State University, San Marcos, TX 78666, USA;Department of Computer Science, University of Nevada Las Vegas, Las Vegas, NV 89154-4019, USA

  • Venue:
  • Computer Communications
  • Year:
  • 1996

Quantified Score

Hi-index 0.24

Visualization

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.