346 search results - page 39 / 70 » Determinizing Asynchronous Automata |
OTM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
WISE
2002
Springer
15 years 3 months ago
2002
Springer
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
101
click to vote
WWW
2011
ACM
14 years 5 months ago
2011
ACM
Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distrib...
CORR
2002
Springer
14 years 10 months ago
2002
Springer
We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism...
LATA
2010
Springer
15 years 4 months ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...