{"product_id":"9781441951700","title":"Synthesis of Finite State Machines: Functional Optimization","description":"\u003ch1\u003eSynthesis of Finite State Machines: Functional Optimization\u003c\/h1\u003e \u003ch2\u003eKam, Timothy; Villa, Tiziano; Brayton, Robert K.; Sangiovanni-Vincentelli, Alberto L.\u003c\/h2\u003e \u003cp\u003e\u003cem\u003eSynthesis of Finite State Machines: Functional  Optimization\u003c\/em\u003e is one of two monographs devoted to the synthesis of  Finite State Machines (FSMs). This volume addresses functional  optimization, whereas the second addresses logic optimization. By  functional optimization here we mean the body of techniques that:  \u003c\/p\u003e\u003cul\u003e \u003cli\u003ecompute all permissible sequential functions for  a given topology of interconnected FSMs, and \u003c\/li\u003e  \u003cli\u003eselect a `best'  sequential function out of the permissible ones.\u003c\/li\u003e  \u003c\/ul\u003e   \u003cbr\u003e  The result is a symbolic description of the FSM representing the  chosen sequential function. By logic optimization here we mean the  steps that convert a symbolic description of an FSM into a hardware  implementation, with the goal to optimize objectives like area,  testability, performance and so on. \u003cbr\u003e  \u003cem\u003eSynthesis of Finite State Machines: Functional Optimization\u003c\/em\u003e is  divided into three parts. The first part presents some preliminary  definitions, theories and techniques related to the exploration of  behaviors of FSMs. The second part presents an implicit algorithm for  exact state minimization of incompletely specified finite state  machines (ISFSMs), and an exhaustive presentation of explicit and  implicit algorithms for the binate covering problem. The third part  addresses the computation of permissible behaviors at a node of a  network of FSMs and the related minimization problems of  non-deterministic finite state machines (NDFSMs). \u003cbr\u003e  Key themes running through the book are the exploration of behaviors  contained in a non-deterministic FSM (NDFSM), and the representation  of combinatorial problems arising in FSM synthesis by means of Binary  Decision Diagrams (BDDs). \u003cbr\u003e  \u003cem\u003eSynthesis of Finite State Machines: Functional Optimization\u003c\/em\u003e will  be of interest to researchers and designers in logic synthesis, CAD  and design automation. \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2010-12-07\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003e ISBN-10: 9781441951700\u003c\/p\u003e \u003cp\u003eISBN-13: 9781441951700\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4757-2622-0\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 282\u003c\/p\u003e ","brand":"Springer","offers":[{"title":"Default Title","offer_id":44358602915980,"sku":"9781441951700","price":153.0,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781441951700_1eb2f3ac-d851-4d3f-a684-737097bfd0df.jpg?v=1755109506","url":"https:\/\/lateknightbooks.com\/products\/9781441951700","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}