Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems

In this paper, a formal model of Extended Finite State Machines (EFSMs) is proposed and an approach to their analysis is suggested. The state of an EFSM is captured by its configuration. A class of EFSMs, called Modular Vector Addition Systems (MVAS), is defined and analyzed. Modular Vector Addition Systems cover a significant subset of models used in communication protocols and behavioral synthesis of hardware. For this class of EFSMs, an algorithm to compute the set of configurations reachable from an initial configuration is presented. This algorithm may also be used to compute the set of recurrent configurations. Knowledge of these sets is useful in verification, testing, and optimization of EFSM models. A compact representation of these sets and a simple test for membership for such representations are also presented.

[1]  Nicolas Halbwachs,et al.  Minimal State Graph Generation , 1992, Sci. Comput. Program..

[2]  B. M. Stewart,et al.  Theory of numbers , 1953 .

[3]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[4]  David Lee,et al.  Online minimization of transition systems (extended abstract) , 1992, STOC '92.

[5]  A. S. Krishnakumar,et al.  Evaluation of protocols from formal specifications: a case study with LAPD , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[6]  Nicolas Halbwachs,et al.  Minimal Model Generation , 1990, CAV.

[7]  Kwang-Ting Cheng,et al.  Automatic Functional Test Generation Using The Extended Finite State Machine Model , 1993, 30th ACM/IEEE Design Automation Conference.