The Unknown Component Problem - Brayton, Robert K.

. .

Résumé :
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.
...

Biographie:
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....

Sommaire:
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...