The propositional dynamic logic of deterministic, well-structured programs


Journal Article

We consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dynamic Logic (SDPDL), which is appropriate for reasoning about deterministic well-structured programs. In contrast to PDL, for which the validity problem is known to be complete in deterministic exponential time, the validity problem for SDPDL is shown to be polynomial space complete. We also show that SDPDL is less expressive than PDL, and give a complete axiomatization for it. The results rely on structure theorems for models of satisfiable SDPDL formulas, and the proofs give insight into the effects of nondeterminism on intractability and expressiveness in program logics. © 1983.

Full Text

Duke Authors

Cited Authors

  • Halpern, JY; Reif, JH

Published Date

  • January 1, 1983

Published In

Volume / Issue

  • 27 / 1-2

Start / End Page

  • 127 - 165

International Standard Serial Number (ISSN)

  • 0304-3975

Digital Object Identifier (DOI)

  • 10.1016/0304-3975(83)90097-X

Citation Source

  • Scopus