Efficient detection of global properties in distributed systems using partial-order methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1855, Issue , 2000, Pages 264-279

  Stoller, Scott D ^a   Unnikrishnan, Leena ^a   Liu, Yanhong A ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS;

ASYMPTOTIC TIME COMPLEXITY; ASYNCHRONOUS DISTRIBUTED SYSTEM; DETECTION ALGORITHM; DISTRIBUTED SYSTEMS; EFFICIENT DETECTION; GLOBAL PROPERTIES; PARTIAL-ORDER METHODS; STATE SPACE SEARCH;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84944402184     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/10722167_22     Document Type: Article

References (22)

1. Rajeev Alur, Ken McMillan, and Doron Peled. Deciding global partial-order properties. In Proc. 25th International Colloquium on Automata, Languages, and Programming (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 41-52. Springer-Verlag, 1998.
2. Sridhar Alagar and S. Venkatesan. Techniques to tackle state explosion in global predicate detection. In Proc. International Conference on Parallel and Distributed Systems, pages 412-417, December 1994.
3. Rajeev Alur and Mihalis Yannakakis. Model checking of message sequence charts. In Proc. 10th Int'l. Conference on Concurrency Theory (CONCUR), volume 1664 of Lecture Notes in Computer Science, pages 114-129, 1999.
4. Craig M. Chase and Vijay K. Garg. Detection of global predicates: Techniques and their limitations. Distributed Computing, 11(4):169-189, 1998.
5. Robert Cooper and Keith Marzullo. Consistent detection of global predicates. In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, 1991. ACM SIGPLAN Notices 26(12):167-174, Dec. 1991.
6. C. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In Proceedings of the 11th Australian Computer Science Conference, pages 56-66, 1988.
7. Eddy Fromentin and Michel Raynal. Local states in distributed computations: A few relations and formulas. Operating Systems Review, 28(2), April 1994.
8. Patrice Godefroid. Partial-Order Methods for the Verification of Concurrent Systems, volume 1032 of Lecture Notes in Computer Science. Springer- Verlag, 1996.
9. Vijay K. Garg and Brian Waldecker. Detection of weak unstable predicates in distributed programs. IEEE Transactions on Parallel and Distributed Systems, 5(3):299-307, 1994.
10. Vijay K. Garg and Brian Waldecker. Detection of strong unstable predicates in distributed programs. IEEE Transactions on Parallel and Distributed Systems, 7(12):1323-1333, 1996.
11. R. Jegou, R. Medina, and L. Nourine. Linear space algorithm for on-line detection of global predicates. In J. Desel, editor, Proc. Int'l Workshop on Structures in Concurrency Theory (STRICT '95). Springer, 1995.
12. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-564, 1978.
13. Friedemann Mattern. Virtual time and global states of distributed systems. In M. Corsnard, editor, Proc. International Workshop on Parallel and Distributed Algorithms, pages 120-131. North-Holland, 1989.
14. Keith Marzullo and Gil Neiger. Detection of global state predicates. In Proc. 5th Int'l. Workshop on Distributed Algorithms (WDAG), volume 579 of Lecture Notes in Computer Science, pages 254-272. Springer, 1991.
15. Anca Muscholl, Doron Peled, and Zhendong Su. Deciding properties of message sequence charts. In FoSSaCS '98, volume 1378 of Lecture Notes in Computer Science, pages 226-242, 1998.
16. Doron Peled, Vaughan R. Pratt, and Gerard J. Holzmann, editors. Proc. Workshop on Partial Order Methods in Verification, volume 29 of DIMACS Series. American Mathematical Society, 1997.
17. Abraham Silberschatz and Peter B. Galvin. Operating System Concepts. Addison Wesley, 5th edition, 1998.
18. Scott D. Stoller, Leena Unnikrishnan, and Yanhong A. Liu. Efficient detection of global properties in distributed systems using partial-order methods. Technical Report 523, Computer Science Dept., Indiana University, 1999.
19. A. Prasad Sistla and Jennifer Welch. Efficient distributed recovery using message logging. In Proc. Eighth ACM Symposium on Principles of Distributed Computing. ACM SIGOPS-SIGACT, 1989.
20. Alexander I. Tomlinson and Vijay K. Garg. Detecting relational global predicates in distributed systems. In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, 1993. ACM SIGPLAN Notices 28(12), December 1993.
21. Antti Valmari. Stubborn set methods for process algebras. In Peled et al. [PPH97], pages 213-231.
22. Igor Walukiewicz. Difficult configurations - on the complexity of ltrl. In Proc. 25th International Colloquium on Automata, Languages, and Programming (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 140-151. Springer-Verlag, 1998.