We present an executable formalization of the language Promela, the description language for models of the model checker SPIN. This formalization is part of the work for a completely verified model checker (CAVA), but also serves as a useful (and executable!) description of the semantics of the language itself, something that is currently missing. The formalization uses three steps: It takes an...

A prey-predator model with Beddington-DeAngelis functional response and impulsive state feedback control is investigated. We obtain the sufficient conditions of the global asymptotical stability of the system without impulsive effects. By using the geometry theory of semicontinuous dynamic system and themethod of successor function, we obtain the systemwith impulsive effects that has an order o...

Understanding what numbers are means knowing several things. It means knowing how counting relates to numbers (called the cardinal principle or cardinality); it means knowing that each number is generated by adding one to the previous number (called the successor function or succession), and it means knowing that all and only sets whose members can be placed in one-to-one correspondence have th...

In this paper, we establish a unilateral diffusion Gompertz model of a single population in two patches in a theoretical way. Firstly, we prove the existence and uniqueness of an order-one periodic solution by the geometry theory of differential equations and the method of successor function. Secondly, we prove the stability of the order-one periodic solution by imitating the theory of the limi...

Gödel’s theory T can be understood as a theory of the simplytyped lambda calculus that is extended to include the constant 0N, the successor function S+, and the operator Rτ for primitive recursion on objects of type τ . It is known that the functions from non-negative integers to non-negative integers that can be defined in this theory are exactly the <ε0-recursive functions of non-negative in...

Functional decomposition is becoming more and more popular, because it is more general than all other known logic synthesis approaches and it seems to be the most effective approach for LUT-based FPGAs, (C)PLDs and complex CMOS-gates. The multi-level functional decomposition can be seen as a recursive splitting of a given function, into two sub-functions: the predecessor (bound-set) function an...

Correct prediction of file accesses can improve system performance by mitigating the relative speed difference between CPU and disks. This paper discusses Program-based Last Successor (PLS) and presents Programand Userbased Last Successor (PULS), file prediction algorithms that utilize information about the program and user that access the files. Our simulation results show that PLS makes 21% f...

A cognitive vision neuronal network based on leaky integrate-and-fire (LIF) neurons is proposed for object recognition and depth analysis. In this network every LIF neuron is able to capture the edge flowing through it and record the temporal information. If the neuron issues a spike, the temporal information will be encoded by the time constant of the spike potential and transferred to its suc...

This paper proposes two compiler-assisted techniques to improve thread level control speculation in speculative multithreading execution. The first technique is to identify threads which have exactly one successor and the successor’s address is statically known (we call these threads fixed-successor threads), and use a small full associative buffer to predict the successors. This technique redu...

The Main Theorem is the equiconsistency of the following two statements: (1) κ is a measurable cardinal and the tree property holds at κ; (2) κ is a weakly compact hypermeasurable cardinal. From the proof of the Main Theorem, two internal consistency results follow: If there is a weakly compact hypermeasurable cardinal and a measurable cardinal far enough above it, then there is an inner model ...