Calcul des etats atteignables de programmes Esterel partitionne ...
Calcul des etats atteignables de programmes Esterel partitionne ...
Calcul des etats atteignables de programmes Esterel partitionne ...
- No tags were found...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
98 BIBLIOGRAPHY[77] Herve J. Touati, Hamid Savoj, Bill Lin, Robert K. Brayton, and Alberto Sangiovanni-Vincentelli. Implicit State Enumeration of Finite State Machines using BDD’s. In Proceedingsof the International Conference on Computer-Ai<strong>de</strong>d Design, ICCAD’90. IEEEComputer Society Press, November 1990.[78] University of California at Berkeley. Berkeley Logic Interchange Format, December 1998.Available at http ://www.bdd-portal.org/docu/blif/.[79] C. Han Yang and David L. Dill. Validation with gui<strong>de</strong>d search of the state space. InProceedings of the 1998 Conference on Design Automation (DAC-98), pages 599–604, LosAlamitos, CA, June 15–19 1998. ACM/IEEE.