An automata-theoretic approach to linear temporal logic

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

Volumn 1043, Issue , 1996, Pages 238-266

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; PROGRAM TRANSLATORS; ROBOTS; SPECIFICATIONS; TEMPORAL LOGIC;

AS RELATIONSHIPS; AUTOMATA-THEORETIC APPROACH; FINITE WORDS; INFINITE WORD; ITS APPLICATIONS; LINEAR TEMPORAL LOGIC; PROGRAM SPECIFICATION; SATISFIABILITY;

AUTOMATA THEORY;

EID: 84947731286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60915-6_6     Document Type: Conference Paper

References (60)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Colloquium on Automata, Languages and Programming, volume 372, pages 1-17. Lecture Notes in Computer Science, Springer-Verlag, July 1989.
2. J.R. Bülchi and L.HG. Landweber. Solving sequentialconditions by finite-state strategies. Trans. AMS, 138:295-311, 1969.
3. J.A. Brzozowski and E. Leiss. Finite automata, and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
4. J.R. Btlchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
5. Y. Choueka. Theories of automata on w-tapes: A simplified approach. J. Computer and System Sciences, 8:117-141, 1974.
6. A. Church. Logic, arithmetics, and automata, In Proc. International Congress of Mathematicians, 1962, pages 23-35. institut Mittag-Leffler, 1963.
7. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114-133, January 1981.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. Mrr Press, 1990.
9. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory 'efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
10. D.L. Dill. Trace theory for automatic hierarchical verification of speed independent circuits. MIT Press, 1989.
11. E.A. Emerson and E.M. Clarke. Using branching time logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
12. E.A. Emerson and J.Y. Halpem. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
13. E.A. Emerson and C. Jufla. The complexity of tree automata and logics of programs. In Proceedings of the 29th IEEE Symposium on Foundations of ComputerScience, White Plains, October 1988.
14. E.A. Emerson and C. Jufla. On simultaneously determinizing and complementing toautomata. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science, pages 333-342, 1989.
15. E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pages 84-96, New Orleans, Janhary 1985.
16. E.A. Emerson and C.-L. Lei. Temporal model checking under gene~:alized fairness constraints. In Prec. 18th Hawaii International Conference on System Sciences, Hawaii, 1985.
17. E.A. Emerson. Automata, tableaux, and temporal logics. In Prec. Workshop on Logic of Programs, volume 193 of Lecture Notes in Computer Science, pages 79-87. Springer-Verlag, 1985.
18. M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory ofNP-completeness. W. Freeman and Co., San Francisco, 1979.
19. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proceedings ofthe 7th ACM Symposiumon Principles of Programming Languages, pages 163-173, January 1980.
20. D. Gale and F. M. Stewart. Infinite games ofperfectinformation. Ann. Math. Studies, 28:245-266, 1953.
21. D. Harel and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO AdvancedSummer Institutes, pages 477-498. Springer-Verlag, 1985.
22. R. Hossley and C.W. Rackoff. The emptiness problem for automata on infinite trees. In Prec. 13th IEEE Symp. on Switching and Automata Theory, pages 121-124, 1972.
23. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, New York, 1979.
24. N.D. Jones. Space-bounded reducibility among combinatorial problems. Journal of Computer and System Sciences, 11:68-75, 1975.
25. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic ofprograms. In Proceedings ofthe 7thACM Symposiumon Principles of Programming Languages, pages 174-185, January 1980.
26. Leiss. Succinctrepresentation of regular languages by boolean automata. Theoretical Computer Science, 13:323-330, 1981.
27. M.T. Liu. Protocol engineering. Advances in Computing, 29:79-195, 1989.
28. O. Lichtenstein and A. Pnueli. Checking that finite state concurrentprograms satisfy their linear specification. In Proceedings of the Twelfth A CM Symposium on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
29. O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Logics of Programs, volume 193, pages 196-218, Brooklyn, June 1985. Lecture Notes in Computer Science, Springer-Verlag.
30. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
31. A.R. Meyer and i. J. Fischer. Economy of description by automata, grammars, and formal systems. In Prec. 12th IEEE Syrup. on Switching andAutomata Theory, pages 188-191, 1971.
32. S. Miyano and T. Hayashi. Alternating finite automata on w-words. Theoretical Computer Science, 32:321-330, 1984.
33. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
34. Y.N. Moschovakis. Descriptive Set Theory. North Holland, 1980.
35. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
36. A.R. Meyer and L.J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential time. In Proc. 13th IEEE Symp. on Switching and Automata Theory, pages 125-129, 1972.
37. D.E. Muller and EE. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54,:267-276, 1987.
38. D. E. Muller, A. Saoudi, and E E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In Proceedings 3rd IEEE Symposium on Logic in Computer Science, pages 422-427, Edinburgh, July 1988.
39. Z. Manna and E Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68-93, January 1984.
40. S. Owicki and L. Lamport. Proving liveness properties ofconcurrentprograms. ACM Transactions on Programming Languages and Systems, 4(3):455-495, July 1982.
41. R. Peikert. w-regular languages and propositional temporal logic. Technical Report 85-01, ETH, 1985.
42. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
43. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, Januery 1989.
44. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
45. M.O. Rabin. Automata on infinite objects and Church's problem. In Regional Conf. Set Math., 13,Providence, Rhode Island, 1972. AMS.
46. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. of Research and Development, 3:115-125, 1959.
47. H. Rudin. Network protocols and tools to help produce them. Annual Review of Computer Science, 2:291-316, 1987.
48. S. Safra. On the complexity of omega-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains, October 1988.
49. W.J. Savitch. Relationship between nondeterministic and deterministic tape complexities. J. on Computer and System Sciences, 4:177-192, 1970.
50. A.E Sisfla and E.M. Clarke. The complexity of propositional linear temporal logic. J. ACM, 32:733-749, 1985.
51. A.E Sistla. Theoretical issues in the design and analysis of distributed systems. PhD thesis, Harvard University, 1983.
52. R. Sherman, A. Pnueli, and D. Harel. Is the interesting part of process logic uninteresting: a translation from PL to PDL. SlAM J. on Computing; 13(4):825-839, 1984.
53. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Btlchi automata with applications to temporallogic. Theoretical ComputerScience, 49:217-237, 1987.
54. W. Thomas. Automata on infinite objects. Handbook of theoretical computerscience, pages 165-191, 1990.
55. M.Y. Vardi. Nontraditional applications of automata theory. In Prec. Int'l Syrup. on Theoretical Aspects of Computer Software, volume 789, pages 575-597. Lecture Notes in Computer Science, Springer-Verlag, 1994.
56. M.Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th ACM Symp. on Theory of Computing, pages 240-251, 1985.
57. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
58. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
59. P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specificat/ ons. PhD thesis, Stanford University, 1982.
60. P. Wolper, M.Y. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Prec. 24th IEEE Symposium on Foundations of Computer Science, pages 185-194, Tucson, 1983.