Results 1  10
of
1,594,128
Finite State Machines
"... optimization method. They use populations of acceptable solutions (genes) of the given problem, which evolve toward optimum. The genes in standard GA are Boolean vectors. When in synthesis of finite state machine are used JK and RS flipflops there are undefined variables in the activation signals. ..."
Abstract
 Add to MetaCart
optimization method. They use populations of acceptable solutions (genes) of the given problem, which evolve toward optimum. The genes in standard GA are Boolean vectors. When in synthesis of finite state machine are used JK and RS flipflops there are undefined variables in the activation signals
Finite State Machines for BGP
"... This report presents the finite state machines for the BGP decision process, and uses these finite state machines to BGP protocol syntax checking. The routing protocol syntax defines the legitimate sequence of messages and is used to reject invalid messages. If the protocol syntax is well defined, s ..."
Abstract
 Add to MetaCart
This report presents the finite state machines for the BGP decision process, and uses these finite state machines to BGP protocol syntax checking. The routing protocol syntax defines the legitimate sequence of messages and is used to reject invalid messages. If the protocol syntax is well defined
FINITE STATE MACHINES w
"... The invertibility of finite state machines is considered in detail. Necessary and sufficient conditions for the general class, as well as some important subclasses, of finite state machines to be invertible with delay L (called INV #L if L is the least delay for which an inverse exists) are given. ..."
Abstract
 Add to MetaCart
The invertibility of finite state machines is considered in detail. Necessary and sufficient conditions for the general class, as well as some important subclasses, of finite state machines to be invertible with delay L (called INV #L if L is the least delay for which an inverse exists) are given
Learning Finite State Machines
"... The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important re ..."
Abstract
 Add to MetaCart
The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important
On the Implementation of Finite State Machines
 in Proceedings of the 3rd Annual IASTED International Conference Software Engineering and Applications, IASTED/Acta
, 1999
"... Abstract. 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 [5] that is commonly used to implement FSMs in OO language ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Abstract. 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 [5] that is commonly used to implement FSMs in OO
Finite state machine for mutation
"... Abstract: In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of fini ..."
Abstract
 Add to MetaCart
Abstract: In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety
ON THE IMPLEMENTATION OF FINITE STATE MACHINES
"... Abstract. 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 language ..."
Abstract
 Add to MetaCart
Abstract. 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
Principles and methods of Testing Finite State Machines  a survey
 PROCEEDINGS OF IEEE
, 1996
"... With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This moti ..."
Abstract

Cited by 343 (16 self)
 Add to MetaCart
. This motivates the study of testing finite state machines to ensure the correct functioning of systems and to discover aspects of their behavior. A finite state machine contains a finite number of states and produces outputs on state transitions after receiving inputs. Finite state machines are widely used
Product Construction of FiniteState Machines
"... Abstract — Two algorithms to construct a product machine from two finitestate machines are presented and analyzed. The first algorithm is simple and correctly produces a product machine, but the product machine may include unreachable states and associated transitions. The second algorithm produces ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — Two algorithms to construct a product machine from two finitestate machines are presented and analyzed. The first algorithm is simple and correctly produces a product machine, but the product machine may include unreachable states and associated transitions. The second algorithm
Extrinsic Evolution of Finite State Machine
"... The paper outlines the use of the extrinsic evolvable hardware approach to evolve finite state machines (FSM). Both the genetic algorithm (GA) and Evolvable Hardware (EHW) are combined together to produce optimal logic circuit. GA is used to optimise the state assignment problem. EHW is used to desi ..."
Abstract
 Add to MetaCart
The paper outlines the use of the extrinsic evolvable hardware approach to evolve finite state machines (FSM). Both the genetic algorithm (GA) and Evolvable Hardware (EHW) are combined together to produce optimal logic circuit. GA is used to optimise the state assignment problem. EHW is used
Results 1  10
of
1,594,128