Tiziano Villa, Nina Yevtushenko, Robert K. Brayton, Alan Mishchenko, Alexandre Petrenko, Alberto Sangiovanni-Vincentelli

The Unknown Component Problem (eBook, PDF)

Theory and Applications

• Format: PDF

Produktbeschreibung

The authors of this book cast the problem as solving abstract equations over language and study the most general (largest) solutions under the synchronous and parallel composition operators. They also apply such equations to languages associated with important classes of automata used for modeling systems, e.g., regular languages as counterparts of finite automata, FSM languages as counterparts of FSMs. The authors investigate the largest subsets of solutions closed with respect to various language properties; in particular, classes of the largest compositional solutions (defined by properties exhibited by the composition of the solution and of the context). The first algorithm to compute the largest compositionally progressive solution of synchronous equations is provided. This approach unifies in a seamless frame previously reported techniques.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer US
• Seitenzahl: 312
• Erscheinungstermin: 16. November 2011
• Englisch
• ISBN-13: 9780387687599
• Artikelnr.: 37286225

Autorenporträt

The authors of this book cast the problem as solving abstract equations over language and study the most general (largest) solutions under the synchronous and parallel composition operators. They also apply such equations to languages associated with important classes of automata used for modeling systems, e.g., regular languages as counterparts of finite automata, FSM languages as counterparts of FSMs. The authors investigate the largest subsets of solutions closed with respect to various language properties; in particular, classes of the largest compositional solutions (defined by properties exhibited by the composition of the solution and of the context). The first algorithm to compute the largest compositionally progressive solution of synchronous equations is provided. This approach unifies in a seamless frame previously reported techniques.

Inhaltsangabe

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.

Rezensionen

From the reviews:

"Synthesis is a hard computational area that is now becoming accessible, thanks to increasing computational power. It is good to have a book from experts that surveys the techniques available." (K. Lodaya, ACM Computing Reviews, November, 2012)