Accurate evaluation of delays of combinatorial circuits is crucial in circuit verification and design. In this paper we present a logical approach to timing analysis which allows us to compute exact stabilization bounds while proving the correctness of the boolean behavior.

The title of this paper highlights an emerging duality between two basic topics in algorithms and complexity theory. Algorithms for circuits refers to the design of algorithms which can analyze finite logical circuits or Boolean functions as input, checking a simple property about the complexity of the underlying function. For instance, an algorithm determining if a given logical circuit C has ...

Most common uses of negatively weighted bits (negabits), normally assuming arithmetic value 21(0) for logical 1(0) state, are as the most significant bit of 2’s-complement numbers and negative component in binary signed-digit (BSD) representation. More recently, weighted bit-set (WBS) encoding of generalised digit sets and practice of inverted encoding of negabits (IEN) have allowed for easy ha...

We explore the sensitivity of an interferometer based on a quantum circuit for coherent states. We show that its sensitivity is at the Heisenberg limit. Moreover we show that this arrangement can measure very small length intervals. There exists a well known isomorphism between interferometers and basic quantum processing circuits. In particular the circuit comprising a Hadamard gate followed b...

This paper presents new structures of combinatorial and constant coefficient multipliers based on the current-mode gates – digital elements operating with constant, continuous power supply current. Current mode circuits do not perturb the analogue part of the chip integrated on the same die through the parasitic coupling across the substrate with the same strength as voltage mode circuits do. D...

We have developed representations and analysis methods for electrical circuits in a deductive system called DUCK.** Circuits are represented as conjunctions of logical predicates. Circuit analysis is done as an iteration of proofs which determine the basic structures in the circuit. Electrical constraints for the circuit are produced from the results of the proofs. The constraints are then solv...

It is well-known that abstract neurons of the McCulloch-Pitts type compute input-output functions that are formally equivalent to suitably defined Boolean functions. Boolean functions, in turn, can be classified (up to isomorphism of underlying logical structure) into a limited number of basic types, each of which is non-isomorphic to each other type. These basic types are conveniently expresse...

Quantum computation has suggested new forms of quantum logic, called quantum computational logics. In these logics wellformed formulas are supposed to denote pieces of quantum information: possible pure states of quantum systems that can store the information in question. At the same time, the logical connectives are interpreted as quantum logical gates: unitary operators that process quantum i...

This memo specifies, for OSPF implementors and users, mechanisms describing how the protocol operates in ATM networks over PVC and SVC meshes with the presence of Proxy-PAR. These recommendations require no protocol changes and allow simpler, more efficient and costeffective network designs. It is recommended that OSPF implementations should be able to support logical interfaces, each consistin...

Dynamical modelling is at the core of the systems biology paradigm. However, the development of comprehensive quantitative models is complicated by the daunting complexity of regulatory networks controlling crucial biological processes such as cell division, the paucity of currently available quantitative data, as well as the limited reproducibility of large-scale experiments. In this context, ...