Skip to main content

Detection of Disjunctive Normal Form Predicate in Distributed Systems

  • Conference paper
Distributed Computing and Networking (ICDCN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4904))

Included in the following conference series:

Abstract

Predicate detection in a distributed system is an important problem. It is useful in debugging and testing of the distributed system. Two modalities are introduced for predicate detection by Cooper and Marzullo. They are denoted by Possibly and Definitely. In general, the complexity of detecting predicates in the two modalities is NP-complete and coNP-complete. On detecting conjunctive predicates in Definitely modality, Garg and Waldecker proposed an efficient method. In this paper, we extend the notion of the conjunctive predicate to the notion of the disjunctive normal form (DNF) predicate, which is a disjunction of several conjunctive predicates. We are concerned with the problem of detecting DNF predicates in Definitely modality. We study two classes of DNF predicates called separation DNF predicates and separation-inclusion DNF predicates, which can be detected in Definitely modality using an idea similar to that of Garg and Waldecker.

Supported by the National Natural Science Foundation of China under Grant No. 60573012 and 60421001, and the National Grand Fundamental Research 973 Program of China under Grant No. 2002cb312200.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alagar, S., Venkatesan, S.: Techniques to Tackle State Explosion in Global Predicate Detection. Proceedings of the IEEE Transactions on Software Engineering 27(8), 704–714 (2001)

    Article  Google Scholar 

  2. Chakraborty, A., Garg, V.K.: On Reducing the Global State Graph for Verification of Distributed Computations. In: MTV 2006. Proceedings of 7th International Workshop on Microprocessor Test and Verification Common Challenges and Solutions (2006)

    Google Scholar 

  3. Chase, C., Garg, V.K.: Efficient Detection of Restricted Classes of Global Predicates. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 303–317. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  4. Cooper, R., Marzullo, K.: Consistent Detection of Global Predicates. In: Proceedings of ACM/ONR workshop on Parallel and Distributed Debugging, pp. 163–173 (1991)

    Google Scholar 

  5. Fromentin, E., Raynal, M.: Inevitable global states: A concept to detect unstable properties of distributed computations in an observer independent way. In: Proceedings of Sixth IEEE Symposium on Parallel and Distributed Processing, pp. 242–248 (1994)

    Google Scholar 

  6. Garg, V.K., Mittal, N.: On Slicing a Distributed Computation. In: Proceedings of IEEE International Conference on Distributed Computing Systems, pp. 322–329 (2001)

    Google Scholar 

  7. Garg, V.K., Waldecker, B.: Detection of Strong Unstable Predicates in Distributed Programs. IEEE Transactions on Parallel and Distributed Systems 7(12), 1323–1333 (1996)

    Article  Google Scholar 

  8. Garg, V.K., Waldecker, B.: Detection of Weak Unstable Predicates in Distributed Programs. IEEE Transactions on Parallel and Distributed Systems 5(3), 299–307 (1994)

    Article  Google Scholar 

  9. Hurfin, M., Mizuno, M., Raynal, M., Singhal, M.: Efficient detection of conjunctions of local predicates. IEEE Transactions on Software Engineering 24(8), 664–677 (1998)

    Article  Google Scholar 

  10. Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–564 (1978)

    Article  MATH  Google Scholar 

  11. Marzullo, K., Neiger, G.: Detection of Global Stable Predicates. In: Proceedings of the Fifth Workshop on Distributed Algorithms and Graphs, pp. 254–272 (1991)

    Google Scholar 

  12. Mattern, F.: Virtual Time and Global States of Distributed Systems. In: Proceedings of the International Workshop on Parallel and Distributed Algorithms, pp. 120–131 (1989)

    Google Scholar 

  13. Tarafdar, A., Garg, V.K.: Predicate Control for Active Debugging of Distributed Programs. In: SPDP. Proceedings of IEEE 9th Symposium on Parallel and Distributed Processing, pp. 763–769 (1998)

    Google Scholar 

  14. Venkatesan, S., Dathan, B.: Test and Debugging Distributed Programs Using Global Predicates. IEEE Transactions on Software Engineering 21(2), 163–177 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shrisha Rao Mainak Chatterjee Prasad Jayanti C. Siva Ram Murthy Sanjoy Kumar Saha

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, H. (2007). Detection of Disjunctive Normal Form Predicate in Distributed Systems. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77444-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77443-3

  • Online ISBN: 978-3-540-77444-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics