More on nonregular PDL: Expressive power, finite models, Fibonacci programs

Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Volumn , Issue , 1995, Pages 140-149

  Harel, David ^a   Singerman, Eli ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

DECIDABILITY QUESTIONS; EXPRESSIVE POWER; FINITE MODEL; FINITE MODEL PROPERTY; LINEAR RECURRENCES; PROPOSITIONAL DYNAMIC LOGIC;

COMPUTATION THEORY;

EID: 33745791591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISTCS.1995.377037     Document Type: Conference Paper

References (14)

1. R. Berger, "The undecidability of the domino problem" Mem. Amer. Math. Soc. 66 (1966)
2. M. Blum and C. Hewitt, "Automata on a 2-Dimensional Tape", Proc. 8th IEEE Symp. on Switching and Automata Theory, pp. 155-160, 1967.
3. M. J. Fischer and R. E. Ladner, "Propositional Dynamic Logic, of Regular Programs" J. Comput. Sys. Sci. 18 (1979), 194-211.
4. D. Harel, "Dynamic Logic", In Handbook of Philosophical Logic,(D. Gabbay and F. Guenthner, eds.), Vol. II, Reidel Publishing Company, Dordrecht, 1984, pp. 497-604.
5. D. Harel, "Recurring Dominoes: Making the Highly Undecidable Highly Understandable", Ann. Disc. Math. 24 (1985), 51-72.
6. D. Harel and M. S. Paterson, "Undecidability of PDL with L = {a2'\i 0}"J. Comput. Sys. Sci. 29 (1984), 359-365.
7. D. Harel, A. Pnueli, and J. Stavi, "Propositional Dynamic Logic of Nonregular Programs", J. Comput. Sys. Sci. 26 (1983), 222-243.
8. D. Harel and D. Raz, "Deciding Properties of Non-regular Programs", SIAM J. Comput. 22 (1993), 857-874.
9. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
10. T. Koren and A. Pnueli, "There Exist Decid-able Context-Free Propositional Dynamic Logics", Proc. Symp. on Logics of Programs, Lecture Notes in Computer Science, Vol. 164, Springer-Verlag, New York, pp. 290-312. 1983.
11. D. Kozen and J. Tiuryn, "Logics of Programs", in Handbook of Theoretical Computer Science,(J. Van Leeuwen, ed.), Vol. B, Elsevier Science Publishers B. V., Amsterdam, 1990, pp. 789-840.
12. R. J. Parikh, "On context-free languages" J. Assoc. Comput. Mach. 13 (1966), 570-581.
13. V. R. Pratt, "Semantical Considerations on Floyd-Hoare Logic", 17th IEEE Symp. Found. Comput. Sci., IEEE Press, New York, pp. 109121, 1976.
14. V. R. Pratt, "A Near Optimal Method for Reasoning about Action", J. Comput. Sys. Sci. 20 (1980), 231-254.