Systems, consisted of fixed quantity of operating devices and actuators, were considered in case of determined functional algorithm. It’s shown, for binary description of system’s state, including variability of transition states, can be applied a given memory criterion. Memory zero-values correspond to undetermined operating logic of a system. Whenever states, when memory equal to zero, pointing on process stage, where unregistered information was appeared. The design procedure of the relative memory calculation is shown. The construction of the process structure and functional graph is represented by the example of the assemble technology of a pneumatic cylinder. It is shown that the use of reduced memory allows reducing the laboriousness of logical synthesis of systems and control algorithms for parallel processes, as compared with Petri nets and cyclograms.
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.