Journal ArticleDOI
The synthesis of two-terminal switching circuits
Reads0
Chats0
TLDR
A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and this work shall consider some aspects of this problem.Abstract:
THE theory of switching circuits may be divided into two major divisions, analysis and synthesis. The problem of analysis, determining the manner of operation of a given switching circuit, is comparatively simple. The inverse problem of finding a circuit satisfying certain given operating conditions, and in particular the best circuit is, in general, more difficult and more important from the practical standpoint. A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and we shall consider some aspects of this problem.read more
Citations
More filters
Proceedings ArticleDOI
A Formal Model for Stateful and Variant-Rich Automotive Functions
TL;DR: A formal model which allows a later on analysis of a function with its different configurations, states, hardware, and software variants is introduced, so that complete safety analyses can be done in one step—opposed to stepwise analyzing all configurations, software variants, and states.
Journal ArticleDOI
Enumerative encoding of correlation-immune Boolean functions
TL;DR: This paper provides the first enumerative encoding of a class of Boolean functions with cryptographic applications, which naturally leads to efficient random generation algorithms.
Exploiting Satisfiability Solvers for Efficient Logic Synthesis
TL;DR: A rapid algorithm for LEXSAT, which generates satisfying assignments in lexicographic order and can bring canonicity, which guarantees the generation of unique results when using SAT solvers in EDA applications, and a new SAT-based algorithm that progressively generates irredundant sums of products (SOPs), which still play a crucial role in many logic synthesis tools.
Proceedings Article
Estimating reaction plan size
TL;DR: The general domain-independent result is obtained that for a domain containing w world states, the expected size of a reaction plan with variables is O((w/log w)1/log p(p+(b-1)v)) where p is the number of preconditions per operator, v is theNumber of those precondition that introduce an unbound variable, and b is thenumber of possible bindings per variable.
Book ChapterDOI
Lower bounds on the complexity of the wavelength-based machine
TL;DR: It is shown that the provided lower bound is tight by providing such a w-machine, and an exponential lower bound on the complexity of most of w- Machine languages is provided, by showing that when n tends to infinity, the ratio of n-bit languages requiring exponential size w- machine to be computed, converges to 1.
References
More filters
Journal ArticleDOI
A logical calculus of the ideas immanent in nervous activity
Warren S. McCulloch,Walter Pitts +1 more
TL;DR: In this article, it is shown that many particular choices among possible neurophysiological assumptions are equivalent, in the sense that for every net behaving under one assumption, there exists another net which behaves under another and gives the same results, although perhaps not in the same time.
Journal ArticleDOI
A symbolic analysis of relay and switching circuits
TL;DR: It will be shown that several of the well-known theorems on impedance networks have roughly analogous theorem in relay circuits, including the delta-wye and star-mesh transformations, and the duality theorem.
Book
The axiomatic method in biology
TL;DR: Interestingly, the axiomatic method in biology that you really wait for now is coming, and it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
The Number of Two-Terminal Series-Parallel Networks
John Riordan,Claude E. Shannon +1 more