Sciweavers

231 search results - page 2 / 47
» A Parallel State Assignment Algorithm for Finite State Machi...
Sort
View
122
Voted
IPPS
2009
IEEE
15 years 8 months ago
A fusion-based approach for tolerating faults in finite state machines
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
Vinit A. Ogale, Bharath Balasubramanian, Vijay K. ...
129
Voted
DAC
1996
ACM
15 years 6 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
106
Voted
IPPS
2003
IEEE
15 years 7 months ago
Lazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image Processing Applications
Performance obtained with existing library-based parallelization tools for implementing high performance image processing applications is often sub-optimal. This is because inter-...
Frank J. Seinstra, Dennis Koelma
111
Voted
VLSID
1997
IEEE
98views VLSI» more  VLSID 1997»
15 years 6 months ago
Synthesis for Logical Initializability of Synchronous Finite State Machines
—Logical initializability is the property of a gate-level circuit whereby it can be driven to a unique start state when simulated by a three-valued (0, 1, ) simulator. In practic...
Montek Singh, Steven M. Nowick
114
Voted
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 5 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng