Abstract
In this chapter, we discuss detection of relational global predicates which cannot be rewritten as a conjunction, or a disjunction of local predicates. The predicate (x 0 + x 1 < C) belongs to this class, where x0 and x1 are integers in different processes and C is a constant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Garg, V.K. (1996). Relational Possible Global Predicates. In: Principles of Distributed Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1321-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1321-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8567-0
Online ISBN: 978-1-4613-1321-2
eBook Packages: Springer Book Archive