Sciweavers

369 search results - page 16 / 74
» Canonical finite state machines for distributed systems
Sort
View
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
13 years 6 months ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
TAICPART
2006
IEEE
134views Education» more  TAICPART 2006»
14 years 1 months ago
Integration Testing of Components Guided by Incremental State Machine Learning
The design of complex systems, e.g., telecom services, is nowadays usually based on the integration of components (COTS), loosely coupled in distributed architectures. When compon...
Keqin Li 0002, Roland Groz, Muzammil Shahbaz
IPPS
1996
IEEE
13 years 11 months ago
A Parallel Algorithm for Minimization of Finite Automata
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
Bala Ravikumar, X. Xiong
DAGSTUHL
2007
13 years 9 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
DSN
2000
IEEE
14 years 1 days ago
Loki: A State-Driven Fault Injector for Distributed Systems
Distributed applications can fail in subtle ways that depend on the state of multiple parts of a system. This complicates the validation of such systems via fault injection, since...
Ramesh Chandra, Ryan M. Lefever, Michel Cukier, Wi...