Alternating the temporal picture for safety

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

Volumn 1853, Issue , 2000, Pages 429-450

  Manna, Zohar ^a   Sipma, Henny B ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

ALTERNATING AUTOMATA; DEDUCTIVE VERIFICATION; FIRST ORDER; INFINITE STATE SYSTEMS; INFINITE WORD; LINEAR TEMPORAL LOGIC; SAFETY PROPERTY; TEMPORAL REASONING;

TEMPORAL LOGIC;

EID: 84974623717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_37     Document Type: Conference Paper

References (17)

1. N.S. Bjørner, A. Browne, E.S. Chang, M. Colón, A. Kapur, Z. Manna, B. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover, User’s Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University, November 1995. available from http://www-step.stanford.edu/
2. N.S. Bjørner, A. Browne, M. Colón, B. Finkbeiner, Z. Manna, H.B. Sipma, and T.E. Uribe. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System, Design, 16(3):227-270, June 2000.
3. st Intl. Conf. on Principles and Practice of Constraint Programming, vol. 976 of LNCS, pp. 589-623, Springer-Verlag, 1995.
4. A. Browne, Z. Manna, and H.B. Sipma. Generalized temporal verification diagrams. In 15th Conference on the Foundations of Software Technology and Theoretical Computer Science, vol. 1026 of Lecture Notes in Computer Science, pages 484-498. Springer-Verlag, 1995.
5. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. J. ACM, 28:114-133, 1981.
6. O. Grumberg and L. Fix. Verification of temporal properties. Logic and Computation, 6(3):343-361, June 1996
7. Z. Manna, A. Browne, H.B. Sipma, and T.E. Uribe. Visual abstractions for temporal verification. In A. Haeberer, editor, Algebraic Methodology and Software Technology (AMAST’98), vol. 1548 of Lecture Notes in Computer Science, pages 28-41. Springer-Verlag, December 1998.
8. S. Miyano and T. Hayashi. Alternating finite automata on w-words. Theoretical Computer Science, 32, 1984
9. Z. Manna and A. Pnueli. Specification and verification of concurrent programs by ∀-automata. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, number 398 in Lecture Notes in Computer Science, pages 124-164. Springer-Verlag, Berlin, 1987. Also in Proc. 14th ACM Symp. Princ. of Prog. Lang., Munich, Germany, pp. 1-12, January 1987.
10. Z. Manna and A. Pnueli. Completing the temporal picture. Theoretical Computer Science, 83(1):97-130, 1991.
11. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
12. D.E. Muller, A. Saoudi, and P.E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In Proc. 3rd IEEE Symp. Logic in Comp. Sci., pages 422-427, 1988.
13. MY. Vardi. Nontraditional applications of automata theory. In M. Hagiya and J.C. Mitchell, editors, Proc. International Symposium on Theoretical Aspects of Computer Software, vol. 789 of Lecture Notes in Computer Science, pages 575-597. Springer-Verlag, 1994.
14. M.Y. Vardi. Alternating automata and program verification. In J. van Leeuwen, editor, Computer Science Today. Recent Trends and Developments, vol. 1000 of Lecture Notes in Computer Science, pages 471-485. Springer-Verlag, 1995.
15. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency. Structure versus Automata, vol. 1043 of Lecture Notes in Computer Science, pages 238-266. Springer-Verlag, 1996.
16. th Intl. Conference on Automated Deduction, vol. 1249 of Lecture Notes in Computer Science. Springer-Verlag, July 1997.
17. M.Y. Vardi. Reasoning about the past with two-way automata. In K. Larsen, S. Skyum, and G. Winskel, editors, Proc. 25th Intl. Colloq. Aut. Lang. Prog., Lecture Notes in Computer Science, pages 628-641, Aalborg, Denmark, Springer-Verlag