On timing analysis of combinational circuits
From MaRDI portal
Recommendations
Cited in
(16)- Timed verification of the generic architecture of a memory circuit using parametric timed automata
- Modeling combinational circuits using linear word-level structures
- Time separation of events: an inverse method
- Cutting-edge timing analysis techniques
- Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis
- scientific article; zbMATH DE number 4043765 (Why is no real title available?)
- scientific article; zbMATH DE number 4057452 (Why is no real title available?)
- On discretization of delays in timed automata and digital circuits
- The determination of the cycle length in high level synthesis
- Characterising combinational timing analyses in intuitionistic modal logic
- On the complexity of designing optimal branch-and-combine clock networks
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- Extracting exact time bounds from logical proofs
- The Unmet Challenge of Timed Systems
- A menagerie of timed automata
- The Boolean Determinant Calculus
This page was built for publication: On timing analysis of combinational circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717495)