Reasoning about systems with transition fairness

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

Volumn 3452 LNAI, Issue , 2005, Pages 194-208

  Aminof, Benjamin ^a   Ball, Thomas ^b   Kupferman, Orna ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; SOCIAL SCIENCES COMPUTING;

FORMAL VERIFICATION METHODS; KRIPKE STRUCTURES; LTL MODEL CHECKING;

ARTIFICIAL INTELLIGENCE;

EID: 26844444326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_14     Document Type: Conference Paper

References (34)

1. ABK04. B. Aminof, T. Ball, and O. Kupferman. Reasoning about systems with transition fairness. Technical Report MSR-TR-2004-89, September 2004.
2. 20 states and beyond. I&C, 98(2):142-170, June 1992.
3. BGS00. R. Bloem, H.N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In Formal Methods in Computer Aided Design, LNCS 1954, pages 37-54, 2000.
4. BKAW98. A.L. Buchsbaum, H. Kaplan, A.Rogers, and J.R. Westbrook. A new, simpler linear-time dominators algorithm. ACM TOPLAS., 20(6):1265-1296, 1998.
5. BRS99. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In Proc. 11th CAV, LNCS 1633, pages 222-235, 1999.
6. CE81. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pages 52-71, 1981.
7. CES86. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
8. +91. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst., 13(4):451-490, 1991.
9. CGP99. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
10. CKV01. H. Chockler, O. Kupferman, and M.Y. Vardi. Coverage metrics for temporal logic model checking. In 7th TACAS, LNCS 2031, pages 528-542, 2001.
11. EH86. E.A. Emerson and J.Y. Halpern. 'Sometimes' and 'not never' revisited: on branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
12. EL87. E.A. Emerson and C.-L. Lei. Modalities for model checking: branching time logic strikes back. Science of Computer Programming, 8:275-306, 1987.
13. Eme90. E.A. Emerson. Temporal and modal logic. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 997-1072. Elsevier, MIT Press, 1990.
14. FOW87. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst., 9(3):319-349, 1987.
15. Fra86. N. Francez. Fairness. Springer-Verlag, New York, 1986.
16. GL94. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
17. GPP03. R. Gentilini, C. Piazza, and A. Policriti. Computing strongly connected components in a linear number of symbolic steps. In 14th ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, Baltimore, Maryland, 2003.
18. Hoa85. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
19. HT96. M. Henzinger and J.A. Telle. Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning. In Proc. 5th Scandinavian Workshop on Algorithm Theory, LNCS 1097, pages 10-20, 1996.
20. KG96. O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, 1996.
21. KPR98. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In Proc. 25th ICALP, LNCS 1443, pages 1-16, 1998.
22. KPSZ02. Y. Kesten, A. Pnueli, E. Shahar, and L. Zuck. Network invariant in action. In Proc. 13th CONCUR, LNCS 2421, pages 101-115, 2002.
23. KV98a. O. Kupferman and M.Y. Vardi. Verification of fair transition systems. Chicago Journal of Theoretical Computer Science, 1998(2), March 1998.
24. KV98b. O. Kupferman and M.Y. Vardi. Relating linear and branching model checking. In Proc PROCOMET, pages 304 - 326, Chapman & Hall, 1998.
25. LH00. Timo Latvala and Keijo Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1-4):175-193, 2000.
26. LPS81. D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness - the ethics of concurrent termination. In Proc. 8th ICALP, LNCS 115, pages 264-277, 1981.
27. LT79. T. Lengauer and R.E. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Prog. Lang. and Sys., 1(1):121-141, 1979.
28. Mai00. M. Maidl. Using Model Checking for System Verification. PhD thesis, Ludwig-Maximilians-Universität München, 2000.
29. MP92. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
30. QS81. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, LNCS 137, pages 337-351, 1981.
31. QS83. J.P. Queille and J. Sifakis. Fairness and related properties in transition systems - A temporal logic to deal with fairness. In Acta Informatica 19:195-220, 1983.
32. Tho90. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
33. Var85. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th FOCS, pages 327-338, October 1985.
34. VW94. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.