Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. J. Fischer and R. E. Ladner, Propositional modal logic of programs, in "Proceedings of the Ninth Annual ACM Symposium on Theory of Computing", 286–294, Association for Computing Machinery, New York, N. Y., 1977. A revised version appears as: Propositional dynamic logic of regular programs, Journal of Computer and System Science 18 (1979), 194–211.
D. Kozen and R. Parikh, An elementary proof of the completeness of PDL, to appear in Theoretical Computer Science.
R. Parikh, "A decidability result for Second Order Process Logic", Technical Report MIT/LCS/TM-112, M.I.T., 1978.
R. Parikh, Propositional logics of programs: systems, models, and complexity, in "Seventh Annual ACM Symposium on Principles of Programming Languages", 186–192, 1980.
V. R. Pratt, Semantical considerations of Floyd-Hoare logic, in "17th IEEE Symposium on the Foundations of Computer Science", 109–121, 1976.
V. R. Pratt, A practical decision method for propositional dynamic logic, in "10th ACM Symposium on the Theory of Computation", 326–337, 1977. A revised version appears as: A near optimal method for reasoning about action, Journal of Computer and Systems Science 20 (1980), 231–254.
V. R. Pratt, Models of program logics, in "20th IEEE Symposium on the Foundations of Computer Science", 115–122, 1979.
K. Segerberg, A completeness theorem in the modal logic of programs, Preliminary report, Notices of the American Mathematics Society 24 (1977), A552.
M. K. Valiev, On axiomatization of deterministic propositional dynamic logic, in "Symposium on the Mathematical Foundations of Computer Science, 1979", 482–491.
M. K. Valiev, Decision complexity of variants of propositional dynamic logic, in "Symposium on the Mathematical Foundations of Computer Science, 1980", 656–664.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Ari, M., Halpern, J.Y., Pnueli, A. (1981). Finite models for deterministic propositional dynamic logic. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_21
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive