Automatic verification of probabilistic free choice

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

Volumn 2294 LNCS, Issue , 2002, Pages 208-224

  Zuck, Lenore ^a   Pnueli, Amir ^a,b   Kesten, Yonit ^c  

^a NEW YORK UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; PHILOSOPHICAL ASPECTS;

AUTOMATIC METHOD; AUTOMATIC VERIFICATION; NON-PROBABILISTIC; PARAMETERIZED; PROBABILISTIC CHOICES; PROBABILISTIC SYSTEMS; TEMPORAL OPERATORS; TEMPORAL PROPERTY; MODEL CHECKER;

MODEL CHECKING;

EID: 84894639190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47813-2_15     Document Type: Conference Paper

References (24)

1. K. R. Apt and D. Kozen. Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters, 22(6), 1986.
2. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13rd Intl. Conference on Computer Aided Verification (CAV'01), volume 2102 ofLect. Notes in Comp. Sci., Springer-Verlag, pages 221-234, 2001.
3. M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many finite state processes. In Proc. 5th ACM Symp. Princ. of Dist. Comp., pages 240-248, 1986.
4. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395-407, 1995.
5. S. Cohen, D. Lehmann, and A. Pnueli. Symmetric and economical solutions to the mutual exclusion problem in a distributed system. Theor. Comp. Sci., 34:215-225, 1984.
6. E.A. Emerson and V. Kahlon. Reducing model checking of the many to the few. In 17th International Conference on Automated Deduction (CADE-17), pages 236-255, 2000.
7. E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In Proc. 22th ACM Conf. on Principles of Programming Languages, POPL'95, San Francisco, 1995.
8. E.A. Emerson and K.S. Namjoshi. Automatic verification of parameterized synchronous systems. In R. Alur and T. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification (CAV'96), volume 1102 of Lect. Notes in Comp. Sci., Springer-Verlag, 1996.
9. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. In Proc. 9th ACM Symp. Princ. of Prog. Lang., pages 1-6, 1982.
10. R.P. Kurshan and K.L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
11. Y. Kesten and A. Pnueli. Control and data abstractions: The cornerstones of practical formal verification. Software Tools for Technology Transfer, 4(2):328-342, 2000.
12. Zuck L. Interim report to PhD Committee. Technical report, Weizmann Institute of Sciences, 1985.
13. D. Lehmann and M.O. Rabin. On the advantages of free choice: A symmetric and fully distibuted solution to the dining philosophers problem. In Proc. 8th ACM Symp. Princ. of Prog. Lang., pages 133-138, 1981.
14. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. Colón, L. De Alfaro, H. Devarajan, H. Sipma, and T.E. Urib e. STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, Stanford, California, 1994.
15. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
16. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Proc. 7th Intl. Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), volume 2031, pages 82-97, 2001.
17. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In R. Alur and T. Henzinger, editors, Proc. 8th Intl. Conference on Computer Aided Verification (CAV'96), volume 1102 of Lect. Notes in Comp. Sci., Springer-Verlag, pages 184-195, 1996.
18. A. Pnueli and L. Zuck. Probablistic verification by tableaux. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 322-331, 1986.
19. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1:53-72, 1986.
20. A. Pnueli and L.D. Zuck. Probabilistic verification. Inf. and Cont., 103(1):1-29, 1993.
21. M.O. Rabin. The choice coordination problem. Acta Informatica, 17:121-134, 1982.
22. A.P. Sistla and L.D. Zuck. Reasoning in a restricted temporal logic. Inf. and Cont., 102(2):167-195, 1993.
23. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 332-344, 1986.
24. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, volume 407 of Lect. Notes in Comp. Sci., pages 68-80. Springer-Verlag, 1989.