Journal ArticleDOI
Linear programming for hazard elimination in asynchronous circuits
Luciano Lavagno,N. Shenoy,Alberto Sangiovanni-Vincentelli +2 more
- Vol. 7, Iss: 1, pp 137-160
Reads0
Chats0
TLDR
This article describes how to analyze the STG specification and the synthesized circuit, using bounded delay information, to formulate the problem and use a branch-and-bound procedure to solve it.Abstract:
Hazards can be globally eliminated from an asynchronous circuit synthesized from a Signal Transition Graph by repeatedly solving an appropriate Linear Program. This article describes how to analyze the STG specification and the synthesized circuit, using bounded delay information, to formulate the problem and use a branch-and- bound procedure to solve it. Known information about the environment delays can be expressed as time bounds on the external signal transitions, and it can be exploited by the proposed methodology.read more
Citations
More filters
Journal ArticleDOI
Synthesis of hazard-free asynchronous circuits with bounded wire delays
TL;DR: A proof that STG persistency is neither necessary nor sufficient for hazard-free implementation is given, and a new synthesis methodology for asynchronous sequential control circuits from a high level specification, the signal transition graph is introduced.
Proceedings ArticleDOI
Approximate algorithms for time separation of events
TL;DR: This work describes a polynomial-time approximate algorithm for computing minimum and maximum time separations between all pairs of events in systems specified by acyclic timing constraint graphs, and proposes finding an approximate solution by first approximating the non-convex feasible space with a suitable convex envelope.
Journal ArticleDOI
Efficient algorithms for approximate time separation of events
TL;DR: A method for approximating min and max type constraints, and a polynomial-time algorithm for computing approximate time separation bounds in choice-free systems without repeated events are described.
Proceedings ArticleDOI
Approximate algorithms for time separation of events
Chakraborty,Dill +1 more
TL;DR: In this article, a polynomial-time algorithm for computing minimum and maximum time separations between all pairs of events in systems specified by acyclic timing constraint graphs is presented.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.