Sciweavers

369 search results - page 25 / 74
» Canonical finite state machines for distributed systems
Sort
View
DFT
1998
IEEE
78views VLSI» more  DFT 1998»
13 years 12 months ago
A System for Evaluating On-Line Testability at the RT-level
This paper presents a system to evaluate the testability of an on-line testable circuit. The system operates at the RT-level, before the logic synthesis step, and allows for an ex...
Silvia Chiusano, Fulvio Corno, Matteo Sonza Reorda...
SRDS
2000
IEEE
14 years 1 days ago
Dynamic Node Management and Measure Estimation in a State-Driven Fault Injector
Validation of distributed systems using fault injection is difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a gl...
Ramesh Chandra, Michel Cukier, Ryan M. Lefever, Wi...
EUROSYS
2006
ACM
14 years 4 months ago
The SMART way to migrate replicated stateful services
Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This pap...
Jacob R. Lorch, Atul Adya, William J. Bolosky, Ron...
WADT
1998
Springer
13 years 11 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...
APL
1992
ACM
13 years 11 months ago
Compiler Tools in APL
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
Robert Bernecky, Gert Osterburg