The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Latch optimization in circuits generated from high-level descriptions
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Sequential Circuit Design Using Synthesis and Optimization
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
A Structural Approach to State Space Decomposition for Approximate Reachability Analysis
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Constructive Analysis of Cyclic Circuits
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Don't care-based BDD minimization for embedded software
DAC '98 Proceedings of the 35th annual Design Automation Conference
Partitioning and optimizing controllers synthesized from hierarchical high-level descriptions
DAC '98 Proceedings of the 35th annual Design Automation Conference
Formal Methods in Designing Embedded Systems—the SACRES Experience
Formal Methods in System Design
Compositional Verification of Synchronous Networks
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Scalable and scalably-verifiable sequential synthesis
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Applying Techniques of Asynchronous Concurrency to Synchronous Languages
Fundamenta Informaticae
Hi-index | 0.00 |
Controller circuits synthesized from high-level languagesoften have many more latches than the minimum,with a resulting sparse reachable state space thathas a particular structure. We propose an algorithmthatexploits this structure to remove latches. The reachablestate set (RSS) is much easier to compute for the new,smaller circuit and can be used to efficiently computethe RSS of the original. Thus we provide a method forobtaining the RSS, and two different initial implementationsfrom which to begin logic optimization.