IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1992 · 110 citations · 13 references
EngineeringComputer EngineeringElectrical EngineeringComputer ArchitectureHardware Description LanguagesMicroelectronicsDelay ModelingDesign SynthesisGraph AlgorithmsLogic SynthesisTiming AnalysisTiming ModelingAsynchronous Circuit DesignAsynchronous Digital Circuit DesignAsynchronous Sequential CircuitsGraph-theoretic Circuit FormulationSequential Circuit SynthesisState Transition GraphsTiming
The proposed synthesis method starts from a graph-theoretic specification called a signal transition graph (STG). A method for transforming a given STG into an STG that satisfies the original timing behavior and that in addition obeys the unique state coding requirement is given. It is shown that in general, many valid solutions to this problem are possible. Therefore, an attempt is made to find a transformed STG that can be realized in a circuit with optimized speed and area.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
13
Petri nets: Properties, analysis and applications
T. Murata · Proceedings of the IEEE · 1989 · 10.5K citations
The design of an asynchronous MIPS R3000 microprocessor
Alain J. Martin, Andrew Lines, Rajit Manohar et al. · 2002 · 325 citations