And for the extended finite state machine (EFSM) data dependence relationship path, two main methods are widely used, but they still have room for improvement. This paper takes into consideration the strengths and weakness of the two methods, gives the mathematical description of the path dependence, improves the selection of path marks, and through the analysis of actual case verifies the effectiveness of the proposed method.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.