Behavior finite state machine

We shall find it more convenient to use a result on two-tape finite state machines rather than directly employ the result for Hiring machines. We shall consider a finite state machine with two tapes, each with its own read-only head moving from left to right, and observe its behavior when each tape has the same input. 

A Finite State Machine (FSM) is an abstract model describing the behavior of a sequential circuit. A completely specified FSM Af is a 6-tuple... 

Each model s core is the hybrid system model, imaging the failure-free system architecture with the use of Reliability Block Diagrams and the system behavior and interactions of the components with the use of Concurrent Finite State Machines. Based on this hybrid system model, the article on hand presents an optimization environment considering system reliability, residual reliabdities and additional static parameters for different system states. The optimization process is demonstrated using a generic electrical power supply system based on a single-aisle twin-jet commercial aircraft. 

The rehabdity modeling of fault-tolerant aircraft systems using SyRelAn can be divided into two modeling levels, one mapping the system architecture, the other defining the redundancy management. Therefore the SyRelAn tool uses ReUabdity Block Diagrams for the definition of the nominal system architecture. To map the multi-state behavior of different components Concurrent Finite State Machines are implemented. 

D. Dowling, K.E. Forward, "Scheduling Algorithms for the Translation of Behavioral Descriptions to Finite-State Machines", Submitted to the European Corference on Design Automation, Feb. 1991. 

Relative control optimization by resynchronization. The control circuit resulting om control synthesis can be optimized further to reduce its size, with the requirement that the optimized hardware is still a valid implementation of its behavioral model. Most approaches to control optimization use a finite state machine model, where operations are bound to control slates. Howevo, when synthesizing circuits from a higher, more abstract level of hardware specification that supports concurrency, synchronization, and timing constraints, these approaches may be overly restrictive. 

In this paper, we present a method based on schematization to deal with this kind of non-termination problem. Schematization is a method for finitely representing infinite sets of objects (Gramlich 1988, Chen Hsiang 1995, Salzer 1992, Comon 1992, Kirchner 1989) terms, rewrites rules, substitutions,. .. etc. If some infinite sets can be represented finitely and if algebraic operations can be performed on these finite representations, then the problem of non-termination can be avoided. The abstract machines we consider are those that present a cyclic behavior starting from any state of the ma-... 

---