Abstract State Machines (ASM), formerly known as Evolving Algebras, are a formal method for specification and verification. The approach was originally developed by Yuri Gurevich, based around the concept of an abstract state machine, and is also espoused by Egon Börger. It is based around AsmL, the Abstract State Machine Language. A number of support tools are available. In computer science, formal methods refers to a variety of scientific and engineering techniques for rigorous reasoning about the correctness of computer programs, chiefly based on the use of mathematical logic. ... In engineering and manufacturing, the term specification has the following meanings: Technical requirement An essential technical requirement for items, materials, or services, including the procedures to be used to determine whether the requirement has been met. ... In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of a system with respect to a certain formal specification or property, using formal methods. ... An abstract state machine is most often used as a synonym for a finite state machine with regards to abstract algorithms (for sorting, etc. ...
References
Y. Gurevich, P. Kutter, M. Odersky and L. Thiele (eds.), Abstract State Machines: Theory and Applications, Lecture Notes in Computer Science, volume 1912, Springer-Verlag, 2000. (ISBN 3-540-67959-6)
E. Börger and R. Stärk, Abstract State Machines: A Method for High-Level System Design and Analysis, Springer-Verlag, 2003. (ISBN 3-540-00702-4)
Lecture Notes in Computer Science (LNCS) is an important computer science series published by Springer-Verlag. ... The Springer-Verlag (pronounced SHPRING er FAIR lahk) was a worldwide publishing company base in Germany. ... Jump to: navigation, search This article is about the year 2000. ... The Springer-Verlag (pronounced SHPRING er FAIR lahk) was a worldwide publishing company base in Germany. ... Jump to: navigation, search 2003 (MMIII) is a common year starting on Wednesday of the Gregorian calendar. ...
A finite statemachine (FSM) or finite automaton is a model of behaviour composed of states, transitions and actions.
Finite statemachines are very widely used in modelling of application behaviour, design of hardware digital systems, software engineering, study of computation and languages.
The next state and output of a FSM is a function of the input and of the current state.
Feeds |
Contact