Sciweavers

936 search results - page 127 / 188
» FSM-Hume is finite state
Sort
View
VTS
1998
IEEE
97views Hardware» more  VTS 1998»
14 years 1 months ago
On the Identification of Optimal Cellular Automata for Built-In Self-Test of Sequential Circuits
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...
Fulvio Corno, Nicola Gaudenzi, Paolo Prinetto, Mat...
ISSTA
1996
ACM
14 years 1 months ago
Elements of Style: Analyzing a Software Design Feature with a Counterexample Detector
We illustrate the application of Nitpick, a specification checker, to the design of a style mechanism for a word processor. The design is cast, along with some expected properties...
Daniel Jackson, Craig Damon
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
14 years 1 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
14 years 1 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
14 years 1 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...