We present an efficient algorithm to detect if the conjunction of two nonlocal predicates is possibly true in a distributed computation. For offline detection of such global predicates, our algorithm is significantly more efficient than the previous algorithms by Cooper and Marzullo, and by Staller
Polyvariant detection of uninitialized arguments of prolog predicates
β Scribed by Thomas Lindgren
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 769 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0743-1066
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper discusses efficient detection of global predicates in a distributed program. Previous work in this area required predicates to be specified as a conjunction of predicates defined on individual processes. Many properties in distributed systems, however, use the state of channels, such as "
The semantic relations between and within utterances are marked by the use of connectors and adverbials. One type of semantic relations is causal relations expressed by causal markers such as because, therefore, so, for, etc. Some of these markers cover different types of causal relations such as ca
Comparison of the Clearview chlamydia test for detection of Ch/a-mydia trachomatis in women with a low prevalence of infection.