3 replies
A finite-state machine (FSM) or finite-state automaton (plural: automata), or just a state machine, may be a mathematical model of computation accustomed style each pc programs and consecutive logic circuits. it's formed as associate abstract machine which will be in one among a finite variety of states. The machine is in just one state at a time; the state it's in at any given time is named the present state. It will modification from one state to a different once initiated by a triggering event or condition; this can be known as a transition. a specific FSM is outlined by an inventory of its states, and also the triggering condition for every transition.
"•Design methods and tools require good modelling and specification techniques
•Those must be formal and rigorous and easy to comprehend (cf. timing diagrams, waveforms, traditionally used by logic designers)
•Today’s hardware description languages allow high level of abstraction
•Models must allow for equivalence-preserving refinements
•They must allow for non-functional qualities such as speed, size and power
Source: http://in.docsity.com/en-docs/Advanced_Tutorial_-_Design_of_Sequential_Circuit_-_Lecture_Slides_
"
to see other 1 answers
Related documents
Search questions by subject