TEST - Catálogo BURRF
   

The Unknown Component Problem : Theory and Applications / by Tiziano Villa, Nina Yevtushenko, Robert K. Brayton, Alan Mishchenko, Alexandre Petrenko, Alberto Sangiovanni-Vincentelli.

Por: Colaborador(es): Tipo de material: TextoTextoEditor: Boston, MA : Springer US, 2012Descripción: xv, 311 páginas recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9780387687599
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • TK7888.4
Recursos en línea:
Contenidos:
1. Synopsis -- 2. Equations over Languages and Finate Automata -- 3. Equations over Finite State Machines -- 4. Equations Over w-Automata -- 5. A Survey of Relevant Literature -- 6. Implementation of Automata Manipulations -- 7. Manipulations of FSMs Represented as Sequential Circuits -- 8. The Software Package BALM -- 9. Fundamental Operations in BALM -- 10. Computation of Flexibility in Sequential Networks -- 11. Computation of Sequential Flexibility in Netlists by Windowing -- 12. Computation of Sequential Flexibility in Networks of FSMs by Windowing -- 13. Language Solving Using Simulation Relations -- 14. Exploitation of Flexibility in Sequential Networks -- 15. Supervisory Control -- 16. Testing -- 17. Synthesis of Strategies for Games -- 18. Extending BALM to Synchronous Equations Over co-Büchi Specifications -- 19. Conclusions and Open Problems.
Resumen: The Problem of the Unknown Component: Theory and Applications addresses the issue of designing a component that, combined with a known part of a system, conforms to an overall specification. The authors tackle this problem by solving abstract equations over a language. The most general solutions are studied when both synchronous and parallel composition operators are used. The abstract equations are specialized to languages associated with important classes of automata used for modeling systems. The book is a blend of theory and practice, which includes a description of a software package with applications to sequential synthesis of finite state machines. Specific topologies interconnecting the components, exact and heuristic techniques, and optimization scenarios are studied. Finally the scope is enlarged to domains like testing, supervisory control, game theory and synthesis for special omega languages. The authors present original results of the authors along with an overview of existing ones.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

1. Synopsis -- 2. Equations over Languages and Finate Automata -- 3. Equations over Finite State Machines -- 4. Equations Over w-Automata -- 5. A Survey of Relevant Literature -- 6. Implementation of Automata Manipulations -- 7. Manipulations of FSMs Represented as Sequential Circuits -- 8. The Software Package BALM -- 9. Fundamental Operations in BALM -- 10. Computation of Flexibility in Sequential Networks -- 11. Computation of Sequential Flexibility in Netlists by Windowing -- 12. Computation of Sequential Flexibility in Networks of FSMs by Windowing -- 13. Language Solving Using Simulation Relations -- 14. Exploitation of Flexibility in Sequential Networks -- 15. Supervisory Control -- 16. Testing -- 17. Synthesis of Strategies for Games -- 18. Extending BALM to Synchronous Equations Over co-Büchi Specifications -- 19. Conclusions and Open Problems.

The Problem of the Unknown Component: Theory and Applications addresses the issue of designing a component that, combined with a known part of a system, conforms to an overall specification. The authors tackle this problem by solving abstract equations over a language. The most general solutions are studied when both synchronous and parallel composition operators are used. The abstract equations are specialized to languages associated with important classes of automata used for modeling systems. The book is a blend of theory and practice, which includes a description of a software package with applications to sequential synthesis of finite state machines. Specific topologies interconnecting the components, exact and heuristic techniques, and optimization scenarios are studied. Finally the scope is enlarged to domains like testing, supervisory control, game theory and synthesis for special omega languages. The authors present original results of the authors along with an overview of existing ones.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha