A new explanation of quaternary Q gate expression in Post algebra is given in this paper by using transmission function theory proposed in [1] and the quaternary ECL Q gate circuit is de- signed.The SPICE2 simulation ...A new explanation of quaternary Q gate expression in Post algebra is given in this paper by using transmission function theory proposed in [1] and the quaternary ECL Q gate circuit is de- signed.The SPICE2 simulation to this circuit has confirmed that it has desired logical function and is totally compatible with various quaternary ECL circuits proposed before.展开更多
A new method,orthogonal algorithm,is presented to compute the logic probabilities(i.e.signal probabili- ties)accurately.The transfer properties of logic probabilities are studied first,which are useful for the calcula...A new method,orthogonal algorithm,is presented to compute the logic probabilities(i.e.signal probabili- ties)accurately.The transfer properties of logic probabilities are studied first,which are useful for the calcula- tion of logic probability of the circuit with random independent inputs.Then the orthogonal algorithm is des- cribed to compute the logic probability of Boolean function realized by a combinational circuit.This algorithm can make Boolean function“ORTHOGONAL”so that the logic probabilities can be easily calculated by summing up the logic probabilities of all orthogonal terms of the Boolean function.展开更多
A lambda system with algebraic operators,lambda-plus system,is introduced.After giving the definitions of the system,we present a sufficient condition for formulating a model of the system. Finally,a model of such sys...A lambda system with algebraic operators,lambda-plus system,is introduced.After giving the definitions of the system,we present a sufficient condition for formulating a model of the system. Finally,a model of such system is constructed.展开更多
A formal technique for incorporating two specification paradigms is presented,in which an algebraic specifi- cation is implemented by a set of abstract procedures specified in pre- and post-condition style.The link be...A formal technique for incorporating two specification paradigms is presented,in which an algebraic specifi- cation is implemented by a set of abstract procedures specified in pre- and post-condition style.The link be- tween the two level specifications is provided via a translation from terms of algebraic specifications into tempo- ral logic formulae representing abstract programs.In terms of translation,a criterion for an abstract implementation satisfying its specification is given,which allows one to check the consistency between the two levels of specifications.The abstract implementations can be refined into executable code by refining each abstract procedure in it.It is proved that the satisfication relation between a specification and its implementations is preserved by such refinement steps.展开更多
Given n propositional variables,let K_n(i,j),0≤i≤j≤n,be the set (or disjunction )of all conjunctions of i literals of which exactly j literais are negative.Dunham and Wang conjectured that it may require exponentia...Given n propositional variables,let K_n(i,j),0≤i≤j≤n,be the set (or disjunction )of all conjunctions of i literals of which exactly j literais are negative.Dunham and Wang conjectured that it may require exponential time to decide that every disjunction K_n (i,j)is not valid by the resolution method.This paper gives a proof of the conjecture and then exhibits a new counterexample to the feasibility of the resolution or con- sensus method.展开更多
基金The subject is supported by Zhejiang Provincial Natural Science Foundation.
文摘A new explanation of quaternary Q gate expression in Post algebra is given in this paper by using transmission function theory proposed in [1] and the quaternary ECL Q gate circuit is de- signed.The SPICE2 simulation to this circuit has confirmed that it has desired logical function and is totally compatible with various quaternary ECL circuits proposed before.
文摘A new method,orthogonal algorithm,is presented to compute the logic probabilities(i.e.signal probabili- ties)accurately.The transfer properties of logic probabilities are studied first,which are useful for the calcula- tion of logic probability of the circuit with random independent inputs.Then the orthogonal algorithm is des- cribed to compute the logic probability of Boolean function realized by a combinational circuit.This algorithm can make Boolean function“ORTHOGONAL”so that the logic probabilities can be easily calculated by summing up the logic probabilities of all orthogonal terms of the Boolean function.
基金Supported by Chinese Natural Science Foundation.
文摘A lambda system with algebraic operators,lambda-plus system,is introduced.After giving the definitions of the system,we present a sufficient condition for formulating a model of the system. Finally,a model of such system is constructed.
基金This project is supported by National Natural Science Foundation of China.
文摘A formal technique for incorporating two specification paradigms is presented,in which an algebraic specifi- cation is implemented by a set of abstract procedures specified in pre- and post-condition style.The link be- tween the two level specifications is provided via a translation from terms of algebraic specifications into tempo- ral logic formulae representing abstract programs.In terms of translation,a criterion for an abstract implementation satisfying its specification is given,which allows one to check the consistency between the two levels of specifications.The abstract implementations can be refined into executable code by refining each abstract procedure in it.It is proved that the satisfication relation between a specification and its implementations is preserved by such refinement steps.
基金now in Department of Computer Science,Columbia University in the City of New York.
文摘Given n propositional variables,let K_n(i,j),0≤i≤j≤n,be the set (or disjunction )of all conjunctions of i literals of which exactly j literais are negative.Dunham and Wang conjectured that it may require exponential time to decide that every disjunction K_n (i,j)is not valid by the resolution method.This paper gives a proof of the conjecture and then exhibits a new counterexample to the feasibility of the resolution or con- sensus method.
