Repositorio de producción científica de la Universidad de Sevilla

State merging and state splitting via state assignment: a new FSM synthesis algorithm

 

Advanced Search
 
Opened Access State merging and state splitting via state assignment: a new FSM synthesis algorithm
Cites

Show item statistics
Icon
Export to
Author: Avedillo de Juan, María José
Quintana Toledo, José María
Huertas Díaz, José Luis
Department: Universidad de Sevilla. Departamento de Electrónica y Electromagnetismo
Date: 1994
Published in: IEE Proceedings Computers and Digital Techniques, 141 (4), 229-237.
Document type: Article
Abstract: The authors describe a state assignment algorithm for FSMs which produces an assignment of non-necessarily distinct, and eventually, incompletely specified codes. In this new approach, state-reduction and state assignment are dealt with concurrently, and a restricted state splitting technique is explored. The algorithm is particularly appropriate for machines with compatibility relations among its states because the potentials of state merging are exploited during the state assignment step. The input to SMAS, the program implementing the algorithm, is a symbolic cover of the FSM. The output is a Boolean representation of both next state and output functions suitable to minimise with ESPRESSO. The machines in the MCNC benchmark set are used to test the new algorithm and to compare it with a well known state assignment program.
Cite: Avedillo de Juan, M.J., Quintana Toledo, J.M. y Huertas Díaz, J.L. (1994). State merging and state splitting via state assignment: a new FSM synthesis algorithm. IEE Proceedings Computers and Digital Techniques, 141 (4), 229-237.
Size: 725.2Kb
Format: PDF

URI: https://hdl.handle.net/11441/76480

DOI: 10.1049/ip-cdt:19941228

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)