369 search results - page 30 / 74 » Canonical finite state machines for distributed systems |
PTS
2004
13 years 9 months ago
2004
In this paper, we propose two fault models and methods for the derivation of interoperability test suites when the system implementation is given in the form of two deterministic c...
SIROCCO
2008
13 years 9 months ago
2008
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
Probability distributions of response times are important in the design and analysis of transaction processing systems and computercommunication systems. We present a general tech...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...