2002 · 25 citations · 4 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureFormal MethodsDeductive VerificationDigital Logic DesignModel CheckingSymbolic ExecutionAsynchronous Circuit DesignAsynchronous Digital Circuit DesignReachability AnalysisSymbolic Model CheckingSymbolic Verification
This paper defines conditions for a Signal Transition Graph to be implemented by an asynchronous circuit. A hierarchy of the implementability classes is presented. Our main concern is the implementability of the specification under the restricted input-output interface between the design and the environment, i.e., when no additional interface signals are allowed to be added to the design. We develop algorithms and present experimental results of using BDD-traversal for checking STG implementability. These results demonstrate efficiency of the symbolic approach and show a way of improving existing tools for STG-based asynchronous circuit design.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
4
Petri nets: Properties, analysis and applications
T. Murata · Proceedings of the IEEE · 1989 · 10.5K citations
Optimized synthesis of asynchronous control circuits from graph-theoretic specifications
Peter Vanbekbergen, Gert Goossens, Francky Catthoor et al. · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1992 · 110 citations
Engineering, Computer Engineering, Electrical Engineering +16