Abstract
The main results of this paper are:
-
(a)
The validity problem for PDL with the single additional context-free program AΔ(B)AΔ, for atomic programs A,B, defined as \(\mathop \cup \limits_{i \geqslant o}\) Ai;B;Ai, is ∏ 11 -complete.
-
(b)
There exists a recursive (but nonregular) one-letter program L\(\subseteq\)A* such that the validity problem for PDL with the single additional program L is ∏ 11 -complete.
Preview
Unable to display preview. Download preview PDF.
References
Fischer, M.J. and R.E. Ladner. Propositional dynamic logic of regular programs. J. Comp. Sys. Sciences, 18 (1979), pp. 194–211.
Harel, D., A. Pnueli and J. Stavi. Propositional dynamic logic of context-free programs. 22nd IEEE Symp. on Found. of Comp. Sc., Nashville, Tenn., October 1981.
Pratt, V.R. Semantical considertions on Floyd-Hoare logic. Proc. 17th Symp. on Found. of Comp. Sc., (1976),pp. 109–121.
Pratt, V.R. A near optimal method for reasoning about action. J. Comp. Sys. Sciences, 20, (1980), pp. 231–254.
Rogers, H., Jr., Theory of Recursive Functions and Effective Computability. McGraw-Hill Co., New York, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harel, D., Pnueli, A., Stavi, J. (1982). Further results on propositional dynamic logic of nonregular programs. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025779
Download citation
DOI: https://doi.org/10.1007/BFb0025779
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11212-9
Online ISBN: 978-3-540-39047-3
eBook Packages: Springer Book Archive