94 search results - page 5 / 19 » Reaching and Distinguishing States of Distributed Systems |
SBMF
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Cellular Automata (CAs) have been investigated extensively as abstract models of the distributed systems composed of autonomous entities characterized by local interaction. How...
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
PODC
1994
ACM
13 years 11 months ago
1994
ACM
Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application's executio...