Sciweavers

1916 search results - page 20 / 384
» Reconfiguring a state machine
Sort
View
DCC
2006
IEEE
14 years 7 months ago
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
Amir Ingber, Meir Feder
DAC
1994
ACM
13 years 11 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
13 years 6 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 8 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
IJCSA
2007
84views more  IJCSA 2007»
13 years 7 months ago
Real Time Model Checking Using Timed Concurrent State Machines
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
Wiktor B. Daszczuk