Finite models for deterministic propositional dynamic logic

  • Mordechai Ben-Ari
  • Joseph Y. Halpern
  • Amir Pnueli
Session 8: Z. Manna, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


Modal Logic Decision Procedure Interior Node Axiom Scheme Finite Model 
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.


  1. 1.
    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.Google Scholar
  2. 2.
    D. Kozen and R. Parikh, An elementary proof of the completeness of PDL, to appear in Theoretical Computer Science.Google Scholar
  3. 3.
    R. Parikh, "A decidability result for Second Order Process Logic", Technical Report MIT/LCS/TM-112, M.I.T., 1978.Google Scholar
  4. 4.
    R. Parikh, Propositional logics of programs: systems, models, and complexity, in "Seventh Annual ACM Symposium on Principles of Programming Languages", 186–192, 1980.Google Scholar
  5. 5.
    V. R. Pratt, Semantical considerations of Floyd-Hoare logic, in "17th IEEE Symposium on the Foundations of Computer Science", 109–121, 1976.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    V. R. Pratt, Models of program logics, in "20th IEEE Symposium on the Foundations of Computer Science", 115–122, 1979.Google Scholar
  8. 8.
    K. Segerberg, A completeness theorem in the modal logic of programs, Preliminary report, Notices of the American Mathematics Society 24 (1977), A552.Google Scholar
  9. 9.
    M. K. Valiev, On axiomatization of deterministic propositional dynamic logic, in "Symposium on the Mathematical Foundations of Computer Science, 1979", 482–491.Google Scholar
  10. 10.
    M. K. Valiev, Decision complexity of variants of propositional dynamic logic, in "Symposium on the Mathematical Foundations of Computer Science, 1980", 656–664.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Mordechai Ben-Ari
    • 1
  • Joseph Y. Halpern
    • 2
  • Amir Pnueli
    • 1
  1. 1.Department of Mathematical Sciences, Division of Computer SciencesTel Aviv UniversityRamat AvivIsrael
  2. 2.Mathematics DepartmentHarvard UniversityCambridge

Personalised recommendations