Results 1  10
of
1,138,409
Dependent Latch Identification in the Reachable State Space
"... Abstract—The large number of latches in current designs increase the complexity of formal verification and logic synthesis, since the growth of latch number leads the state space to explode exponentially. One solution to this problem is to find the functional dependencies among these latches. Then, ..."
Abstract
 Add to MetaCart
theorem. In addition, the proposed approach detects sequential functional dependencies existing in the reachable state space only. Experimental results show that our approach could deal with large sequential circuits with up to 1.5K latches in a reasonable time and simultaneously identify
Reachable state space analysis of LOTOS specifications
, 1994
"... interpretation Abstract Interpretation is a useful method proposed by [8] for computing formally and automatically an approximation of the dynamic behaviour of a program. It gives a way to establish a correspondence between the concrete domain and an abstract domain on which representation of elem ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
interpretation Abstract Interpretation is a useful method proposed by [8] for computing formally and automatically an approximation of the dynamic behaviour of a program. It gives a way to establish a correspondence between the concrete domain and an abstract domain on which representation of elements becomes simpler and more efficient. An application of this framework proposed in [9] gives us an answer to our first question: they propose to represent a concrete set OE of valuations of variables by an abstract representation given by the convex hull \Phi of the set OE. This convex hull can be defined as the set of solutions of a system of linear constraints, i.e. a convex polyhedron. We first recall the definition of a convex polyhedron, then we present how the usual operators on sets such as inclusion, union, : : : translate in terms of operators on polyhedra. 5 Convex polyhedron A convex polyhedron P can be expressed as one of the following dual representations: ffl a system o...
Inductively Finding a Reachable State Space OverApproximation
"... Abstract — We present an algorithm to find an overapproximation of the set of reachable states in a finite state machine. The algorithm works by inductively proving implications of the form a ⇒ b between pairs of nodes in the logic network. Because each implication proved is guaranteed to hold in ev ..."
Abstract
 Add to MetaCart
tightenough reachable state space approximation to enable circuit optimization, even for very large problems. I.
SyntaxDriven Reachable State Space Construction of Synchronous Reactive Programs
"... Abstract. We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fixpoint construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case of seq ..."
Abstract
 Add to MetaCart
Abstract. We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fixpoint construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case
SyntaxDriven Reachable State Space Construction of Synchronous Reactive Programs
"... Abstract. We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fixpoint construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case of s ..."
Abstract
 Add to MetaCart
Abstract. We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fixpoint construction used in modelchecking techniques [CGP99]. The basic idea sounds utterly simple, as seen on the case
A family of distributed deadlock avoidance protocols and their reachable state spaces
 In Fundamental Approaches to Software Engineering (FASE’07
, 2007
"... 1 Introduction Middleware services play a key role in the development of modern distributedrealtime and embedded (DRE) systems. DRE systems often consist of a variety of hardware and software components, each with their own protocols, interfaces,operating systems, and API's. Middleware service ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
1 Introduction Middleware services play a key role in the development of modern distributedrealtime and embedded (DRE) systems. DRE systems often consist of a variety of hardware and software components, each with their own protocols, interfaces,operating systems, and API's. Middleware services hide this heterogeneity, allowing the software engineer to focus on the application, by providing a highleveluniform interface, and handling management of resources and communication and coordination between components. However, this approach is effective onlyif these services are welldefined, flexible and efficient.
The algorithmic analysis of hybrid systems
 THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract

Cited by 778 (71 self)
 Add to MetaCart
to linear hybrid systems. In particular, we consider symbolic modelchecking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
Impulses and Physiological States in Theoretical Models of Nerve Membrane
 Biophysical Journal
, 1961
"... ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of nonlinear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing excitabi ..."
Abstract

Cited by 505 (0 self)
 Add to MetaCart
the 4dimensional HH phase space onto a plane produces a similar diagram which shows the underlying relationship between the two models. Impulse trains occur in the BVP and HH models for a range of constant applied currents which make the singular point representing the resting state unstable.
Spacetime codes for high data rate wireless communication: Performance criterion and code construction
 IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract

Cited by 1782 (28 self)
 Add to MetaCart
are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2–3 dB of the outage capacity for these channels using only 64 state encoders.
Results 1  10
of
1,138,409