17 Automata-theoretic techniques for temporal reasoning

Studies in Logic and Practical Reasoning

Volumn 3, Issue , 2007, Pages 971-989

  Vardi, Moshe Y ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40849111733     PISSN: 15702464     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-2464(07)80020-6     Document Type: Article

References (88)

1. Armoni R., Bustan D., Kupferman O., and Vardi M.Y. Resets vs. aborts in linear temporal logic. Proc. 9th International Conference on Tools and algorithms for the construction and analysis of systems. number 2619 in Lecture Notes in Computer Science (2003), Springer-Verlag 65-80
2. Grenoble, France, April. Armoni R., Fix L., Flaisher A., Gerth R., Ginsburg B., Kanza T., Landver A., Mador-Haim S., Singerman E., Tiemeyer A., Vardi M.Y., and Zbar Y. The ForSpec temporal logic: A new temporal property-specification logic. Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. volume 2280 of Lecture Notes in Computer Science (2002), Springer-Verlag 211-296
3. Ben-Ari M., Pnueli A., and Manna Z. The temporal logic of branching time. Acta Informatica 20 (1983) 207-226
4. Bryant R.E. Graph-based algorithms for boolean-function manipulation. IEEE Trans, on Computers C-35 8 (1986)
5. Brzozowski J.A., and Leiss E. Finite automata and sequential networks. Theoretical Computer Science 10 (1980) 19-35
6. Büchi J.R. Weak second-order arithmetic and finite automata. Zeit. Math. Logik und Grundl. Math. 6 (1960) 66-92
7. Stanford. Büchi J.R. On a decision method in restricted second order arithmetic. Proc. International Congress on Logic, Method, and Philosophy of Science. 1960 (1962), Stanford University Press 1-12
8. June. Burch J.R., Clarke E.M., McMillan K.L., Dill D.L., and Hwang L.J. Symbolic model checking: 1020 states and beyond. Information and Computation 98 2 (1992) 142-170
9. Burgess J.P. Logic and time. J. Symbolic Logic 44 (1979) 566-582
10. Bustan D., Flaisher A., Grumberg O., Kupferman O., and Vardi M.Y. Regular vacuity. Proc. 13th Advanced Research Working Conference on Correct Hardware Design and Verification Methods. volume 3725 of Lecture Notes in Computer Science (2005), Springer-Verlag 191-206
11. January. Chandra A.K., Kozen D.C., and Stockmeyer L.J. Alternation. Journal of the Association for Computing Machinery 28 1 (1981) 114-133
12. Choueka Y. Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences 8 (1974) 117-141
13. Clarke E.M., and Draghicescu I.A. Expressibility results for linear-time and branching-time logics. In: de Bakker J.W., de Roever W.P., and Rozenberg G. (Eds). Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency. volume 354 of Lecture Notes in Computer Science (1988), Springer-Verlag 428-437
14. Clarke E.M., and Emerson E.A. Design and synthesis of synchronization skeletons using branching time temporal logic. Proc. Workshop on Logic of Programs. volume 131 of Lecture Notes in Computer Science (1988), Springer-Verlag 428-437
15. January. Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (1986) 244-263
16. Clarke E.M., Grumberg O., and Peled D. Model Checking (1999), MIT Press
17. Cleaveland R. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. Formal Methods in System Design 2 (1993) 121-147
18. Courcoubetis C., Vardi M.Y., Wolper P., and Yannakakis M. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design 1 (1992) 275-288
19. Doner J.E. Decidability of the weak second-order theory of two successors. Notices Amer. Math. Soc 12 (1965) 819
20. Elgot C. Decision problems of finite-automata design and related arithmetics. Trans. Amer. Math. Soc 98 (1961) 21-51
21. Emerson E.A. Automata, tableaux, and temporal logics. Proc. Workshop on Logic of Programs. volume 193 of Lecture Notes in Computer Science (1985), Springer-Verlag 79-87
22. chapter 16. Emerson E.A. Temporal and modal logic. In: Van Leeuwen J. (Ed). Handbook of Theoretical Computer Science volume B (1990), Elsevier, MIT Press 997-1072
23. Emerson E.A., and Clarke E.M. Characterizing correctness properties of parallel programs using fixpoints. Proc. 1th InternationalColloq. on Automata, Languages and Programming (1980) 169-181
24. Emerson E.A., and Halpern J.Y. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30 (1985) 1-24
25. Emerson E.A., and Halpern J.Y. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM 33 1 (1986) 151-178
26. White Plains, October. Emerson E.A., and Jutla C. The complexity of tree automata and logics of programs. Proc. 29th IEEE Symp. on Foundations of Computer Science (1988) 328-337
27. San Juan, October. Emerson E.A., and Jutla C. Tree automata, μ-calculus and determinacy. Proc. 32nd IEEE Symp. on Foundations of Computer Science (1991) 368-377
28. New Orleans, January. Emerson E.A., and Lei C.-L. Modalities for model checking: Branching time logic strikes back. Proc. 20th ACM Symp. on Principles of Programming Languages (1985) 84-96
29. Emerson E.A., and Lei C.-L. Temporal model checking under generalized fairness constraints. Proc. 18th Hawaii International Conference on System Sciences (1985), Western Periodicals Company, North Holywood
30. Washington, April. Emerson E.A., and Sistla A.P. Deciding branching time logic. Proc. 16th ACM Symp. on Theory of Computing (1984) 14-24
31. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences 18 (1979) 194-211
32. Fritz C. Concepts of automata construction from LTL. Proc. 12th Int'l Conf. on Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 3835 (2005), Springer-Verlag 728-742
33. Gabbay D.M. Applications of trees to intermediate logics i. J. Symbolic Logic 37 (1972) 135-138
34. August. Gerth R., Peled D., Vardi M.Y., and Wolper P. Simple on-the-fly automatic verification of linear temporal logic. In: Dembiski P., and Sredniawa M. (Eds). Protocol Specification, Testing, and Verification (1995), Chapman & Hall 3-18
35. Hafer T., and Thomas W. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. Proc. 14th International Coll. on Automata, Languages, and Programming. volume 267 of Lecture Notes in Computer Science (1987), Springer-Verlag 269-279
36. February. Holzmann G. An improved protocol reachability analysis technique. Software Practice and Experi- ence 18 2 (1988) 137-161
37. Holzmann G.J. The SPIN Model Checker: Primer and Reference Manual (2003), Addison-Wesley
38. Kamp J.A.W. Tense Logic and the Theory of Order. PhD thesis (1968), UCLA
39. Kozen D. Results on the propositional μ-calculus. Theoretical Computer Science 27 (1983) 333-354
40. Kupferman O., Sattler U., and Vardi M.Y. The complexity of the graded μ-calculus. Proceedings of the Conference on Automated Deduction. volume 2392 of Lecture Notes in Artificial Intelligence (2002), Springer Verlag 423-437
41. July. Kupferman O., and Vardi M.Y. Weak alternating automata are not that weak. ACM Trans, on Computational Logic 2 2 (2001) 408-429
42. March. Kupferman O., Vardi M.Y., and Wolper P. An automata-theoretic approach to branching-time model checking. Journal of the ACM 47 2 (2000) 312-360
43. January. Lamport L. Sometimes is sometimes "not never" - on the temporal logic of programs. Proc. 7th ACM Symp. on Principles of Programming Languages (1980) 174-185
44. New Orleans, January. Lichtenstein O., and Pnueli A. Checking that finite state concurrent programs satisfy their linear specification. Proc. 12th ACM Symp. on Principles of Programming Languages (1985) 97-107
45. Brooklyn, June. Lichtenstein O., Pnueli A., and Zuck L. The glory of the past. Logics of Programs. volume 193 of Lecture Notes in Computer Science (1985), Springer-Verlag 196-218
46. Liu M.T. Protocol engineering. Advances in Computing 29 (1989) 79-195
47. January. Manna Z., and Pnueli A. The Temporal Logic of Reactive and Concurrent Systems: Specification (1992), Springer-Verlag, Berlin
48. Manna Z., and Pnueli A. Temporal specification and verification of reactive modules. Technical report (1992), Weizmann Institute
49. Marrero W. Using BDDs to decide ctl. Proc. 11th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science 3440 (2005), Springer-verlag 222-236
50. Michel M. Complementation is more difficult with automata on infinite words (1988), CNET, Paris
51. Miyano S., and Hayashi T. Alternating finite automata on ω-words. Theoretical Computer Science 32 (1984) 321-330
52. Mostowski A.W. Regular expressions for infinite trees and a standard form of automata. Computation Theory. volume 208 of Lecture Notes in Computer Science (1984), Springer-Verlag 157-168
53. Edinburgh, July. Muller D.E., Saoudi A., and Schupp P.E. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. Proceedings 3rd IEEE Symp. on Logic in Computer Science (1988) 422-427
54. Müller D.E., Saoudi A., and Schupp P.E. Alternating automata, the weak monadic theory of the tree and its complexity. Proc. 13th International Colloquium on Automata, Languages and Programming. volume 226 of Lecture Notes in Computer Science (1986), Springer-Verlag 275-283
55. Muller D.E., and Schupp P.E. Alternating automata on infinite trees. Theoretical Computer Science 54 (1987) 267-276
56. Muller D.E., and Schupp P.E. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141 (1995) 69-107
57. Pnueli A. The temporal logic of programs. Proc. 18th IEEE Symp. on Foundation of Computer Science (1977) 46-57
58. Pnueli A. Linear and branching structures in the semantics and logics of reactive systems. volume 194. Proc. 12th International Colloquium on Automata, Languages and Programming (1985), Springer-Verlag 15-32
59. Pnueli A. Linear and branching structures in the semantics and logics of reactive systems. volume 194. Lecture Notes in Computer Science (1985)
60. Prior A. Time and Modality (1957), Oxford University Press
61. Queille J.P., and Sifakis J. Specification and verification of concurrent systems in Cesar. Proc. 5th International Symp. on Programming. volume 137 of Lecture Notes in Computer Science (1981), Springer-Verlag 337-351
62. Rabin M.O. Decidability of second order theories and automata on infinite trees. Transaction of the AMS 141 (1969) 1-35
63. Rabin M.O. Weakly definable relations and special automata. Proc. Symp. Math. Logic and Foundations of Set Theory (1970), North Holland 1-23
64. Rudin H. Network protocols and tools to help produce them. Annual Review of Computer Science 2 (1987) 291-316
65. Sattler U., and Vardi M.Y. The hybrid μ-calculus. In: Goré R., Leitsch A., and Nipkow T. (Eds). Proc. 1st Int'l Joint Conf. on Automated Reasoning. Lecture Notes in Computer Science 2083 (2001), Springer-Verlag 76-91
66. Savitch W.J. Relationship between nondeterministic and deterministic tape complexities. Journal on Computer and System Sciences 4 (1970) 177-192
67. Sistla A.P. Theoretical issues in the design of distributed and concurrent systems. PhD thesis (1983), Harward University, Cambridge, MA
68. Sistla A.P., and Clarke E.M. The complexity of propositional linear temporal logic. Journal ACM 32 (1985) 733-749
69. Sistla A.P., Vardi M.Y., and Wolper P. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49 (1987) 217-237
70. July. Street R.S., and Emerson E.A. An elementary decision procedure for the μ-calculus. Proc. 11th International Colloquium on Automata, Languages and Programming volume 172 (1984), Springer-Verlag 465-472
71. July. Street R.S., and Emerson E.A. An elementary decision procedure for the μ-calculus. Lecture Notes in Computer Science (1984)
72. Streett R.S. Propositional dynamic logic of looping and converse. Information and Control 54 (1982) 121-141
73. Tarjan R.E. Depth first search and linear graph algorithms. SIAM Journal of Computing 1 2 (1972) 146-160
74. Thatcher J.W., and Wright J.B. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical System Theory 2 (1968) 57-81
75. Russian. Trakhtenbrot B.A. Finite automata and monadic second order logic. Siberian Math. J 3 (1962) 101-131
76. English translation in. Trakhtenbrot B.A. Finite automata and monadic second order logic. AMS Transi 59 (1966) 23-55
77. Vardi M.Y. Nontraditional applications of automata theory. Proc. International Symp. on The- oretical Aspects of Computer Software. volume 789 of Lecture Notes in Computer Science (1994), Springer-Verlag 575-597
78. Vardi M.Y. Alternating automata and program verification. Computer Science Today -Recent Trends and Developments. volume 1000 of Lecture Notes in Computer Science (1994), Springer-Verlag, Berlin 471-485
79. Vardi M.Y. Linear vs. branching time: A complexity-theoretic perspective. Proc. 13th IEEE Sym. on Logic in Computer Science (1998) 394-405
80. July. Vardi M.Y. Reasoning about the past with two-way automata. Proc. 25th International Coll. on Automata, Languages, and Programming. volume 1443 of Lecture Notes in Computer Science (1998), Springer-Verlag, Berlin 628-641
81. Vardi M.Y. Sometimes and not never re-revisited: on branching vs. linear time. In: Sangiorgi D., and de Simone R. (Eds). Proc. 9th Int'l Conf. on Concurrency Theory. Lecture Notes in Computer Science 1466 (1998) 1-17
82. Vardi M.Y. Branching vs. linear time: Final showdown. Proc. 7th International Conference on Tools and algorithms for the construction and analysis of systems. volume 2031 of Lecture Notes in Computer Science (2001), Springer-Verlag 1-22
83. Vardi M.Y., and Wolper P. Yet another process logic. Logics of Programs. volume 164 of Lecture Notes in Computer Science (1984), Springer-Verlag 501-512
84. Cambridge, June. Vardi M.Y., and Wolper P. An automata-theoretic approach to automatic program verification. Proc. 1st Symp. on Logic in Computer Science (1986) 332-344
85. Vardi M.Y., and Wolper P. Automata-theoretic techniques for modal logics of programs. 2. Journal of Computer and System Science 32 (1986) 182-221 April
86. November. Vardi M.Y., and Wolper P. Reasoning about infinite computations. Information and Computation 115 1 (1994) 1-37
87. Visser W., and Barringer H. Practical CTL* model checking: Should SPIN be extended?. Interna- tional Journal on Software Tools for Technology Transfer 2 4 (2000) 350-365
88. Tucson. Wolper P., Vardi M.Y., and Sistla A.P. Reasoning about infinite computation paths. Proc. 24th IEEE Symp. on Foundations of Computer Science (1983) 185-194