Automation of Industrial Serial Processes Based on Finite State Machines
نویسندگان
چکیده
منابع مشابه
Cognitive Processes by Using Finite State Machines
Finite State Machines (FSM) are formalisms that have been used for decades to describe the behavior of systems. They can also provide an intelligent agent with a suitable formalism for describing its own beliefs about the behavior of the world surrounding it. In fact, FSMs are the suitable acceptors for right linear languages, which are the simplest languages considered in Chomsky’s classificat...
متن کاملEasily testable PLA-based finite state machines
the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...
متن کاملOn the Implementation of Finite State Machines
Finite State Machines (FSM) provide a powerful way to describe dynamic behavior of systems and components. However, the implementation of FSMs in OO languages, often suffers from maintenance problems. The State pattern described in [1] that is commonly used to implement FSMs in OO languages, also suffers from these problems. To address this issue we present an alternative approach. In addition ...
متن کاملInteractive Web Applications Based on Finite State Machines
Interactive applications on the World-Wide Web are supported by the CGI interface, which allows transferring information from the browser to programs invoked by the server. Information is obtained through fillout forms embedded in documents written in the HTML language and rendered by the browser as collections of user interface objects. While the World-Wide Web is based on the stateless HTTP p...
متن کاملHighly Testable Finite State Machines Based on EXOR Logic
It is well-known that AND/EXOR circuits are more easily testable than AND/OR circuits. Therefore, in this paper, we primarily propose to use AND/EXOR realizations for implementation of the combinational logic parts of finite state machines. Then, we investigate the effect of different state assignments (i.e. one-hot, gray-code, etc.) and that of using different types of registers (i.e. D-type, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.07.409